HOME
Top 10 List of Week 06
- execlp – Overlay Calling Process and Run New Program (C Programming)
Pada website ini dibahas tentang bagaimana kegunaan dari fungsi execlp() pada bahasa pemrograman C dan contoh penggunaannya.
- fork in C
Fork system call is used for creating a new process, which is called child process, which runs concurrently with the process that makes the fork() call (parent process). After a new child process is created, both processes will execute the next instruction following the fork() system call. A child process uses the same pc(program counter), same CPU registers, same open files which use in the parent process.
- Wait System Call in C
Pada website ini dibahas tentang penggunaan wait pada C Programming.
- How to measure time taken by a function in C?
To calculate time taken by a process, we can use clock() function which is available time.h. We can call the clock function at the beginning and end of the code for which we measure time, subtract the values, and then divide by CLOCKS_PER_SEC (the number of clock ticks per second) to get processor time.
- Time delay in C
Pada website ini dibahas tentang penggunaan Time delay pada C programming.
- How to move a file in Linux
Moving files in Linux can seem relatively straightforward, but there are more options available than most realize. This article teaches beginners how to move files in the GUI and on the command line, but also explains what’s actually happening under the hood, and addresses command line options that many experience users have rarely explored.
- fcntl() - Unix, Linux System Call
fcntl is a manipulate file descriptor. fcntl() performs one of the operations described below on the open file descriptor fd. The operation is determined by cmd.
- What is caching?
Cache is a type of memory that is used to increase the speed of data access. Normally, the data required for any process resides in the main memory. However, it is transferred to the cache memory temporarily if it is used frequently enough. The process of storing and accessing data from a cache is known as caching.
- Operating System Scheduling algorithms
Round robin adalah algoritma penjadwalan tertua dan paling sederhana. Nama algoritma ini berasal dari prinsip round-robin, di mana setiap orang mendapat bagian yang sama secara bergantian. Ini sebagian besar digunakan untuk menjadwalkan algoritma dalam multitasking. Metode algoritma ini membantu eksekusi proses tanpa kelaparan. Karakteristik dari Round-Robin Scheduling adalah Round robin adalah model hybrid yang digerakkan oleh jam, bagian waktu harus minimum, yang ditetapkan untuk tugas tertentu yang akan diproses. Namun, ini mungkin berbeda untuk proses yang berbeda, ini adalah sistem waktu nyata yang menanggapi acara dalam batas waktu tertentu.
- Belady’s Anomaly in Page Replacement Algorithms
Bélády’s anomaly is the name given to the phenomenon where increasing the number of page frames results in an increase in the number of page faults for a given memory access pattern.
This phenomenon is commonly experienced in following page replacement algorithms:
- First in first out (FIFO)
- Second chance algorithm
- Random page replacement algorithm
* * *