The memory binding could be static or dynamic. In dynamic binding system, user-generated virtual addresses are mapped to physical addresses. This leads to better memory… Read More »Logical Memory Address vs. Physical Memory Address
In a multiprocessing environment, several processes compete for limited resources. A running process goes to waiting state when a resource is not available. The process… Read More »What is a Deadlock?
The fork-join is a basic method of expressing concurrency within a computation. This is implemented in the UNIX operating system as system calls. Fork The… Read More »Fork-Join Concept
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 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
In this article, you will learn another popular method of interprocess communication called message passing. You will learn different techniques and characteristics of message passing.… Read More »Message Passing System
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
Pthreads is the POSIX standard (IEEE 1003.1c) defines an API for thread creation and synchronization. It is only a specification, not implementation which a programmer… Read More »Pthreads
A thread is a basic unit of CPU utilization; it has a thread id, a program counter, a register set, and a stack. It shares… Read More »Multi-threaded Programming