Precedence Graph
A precedence graph is a directed acyclic graph whose nodes corresponds to individual statements. An edge from to , implies that statement can only be… Read More »Precedence Graph
A precedence graph is a directed acyclic graph whose nodes corresponds to individual statements. An edge from to , implies that statement can only be… Read More »Precedence Graph
A scheduling algorithms like round-robin treat all processes as same. But if we consider other information about a process, some process is more important than… Read More »Priority Scheduling
The shortest job first algorithm associates the length of the next CPU burst with each process. The CPU time is assigned to a process with… Read More »Shortest-Job-First ( SJF )
The round-robin scheduling algorithm is suitable for time-sharing computers which are similar to FCFS. However, preemption is added to this algorithm to switch between processes.… Read More »Round Robin
The first come first served (FCFS) is the simplest CPU-scheduling algorithm. The process which requests CPU first will be allocated CPU first and so on.… Read More »First Come, First Served (FCFS)
The multi-programming technique wants high CPU utilization by executing some process all the time. The time-sharing computer keeps switching among processes so that all users… Read More »Types of Schedulers
The single processor system, one process runs, and other processes wait until CPU is free. In a multiprocessor system, some process always runs and thus… Read More »Process Scheduling Criteria
Interprocess communication is necessary to share information between two or more processes. This is how a process cooperates with other processes. In this article, you… Read More »Shared-Memory System
The Win32 threads are implemented in the kernel space of Windows OS. The multi-threaded applications can use the Win32 API library similar to Pthread library.… Read More »Win32 Threads