Paging
Paging allows the physical address space of a process to be non-contiguous. It avoids the external fragmentation and there is no need for compaction. Fragmentation… Read More »Paging
Home » Archives for admin »
admin
Contiguous Memory Allocation
The contiguous memory allocation uses memory partitions to allocate memory. These partitions could be fixed or variable size partitions allocated according to first fit, best… Read More »Contiguous Memory Allocation
Dynamic Loading And Linking
To run a process, the entire process and its data must be in physical memory. Thus, the size of a process is limited to the… Read More »Dynamic Loading And Linking
Logical Memory Address vs. Physical Memory Address
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
What is a Deadlock?
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?
Shortest Remaining Time First (SRTF)
The shortest job first (SJF) algorithm is preemptive or non-preemptive. You have learned about the non-preemptive SJF in the previous article. In this article, you… Read More »Shortest Remaining Time First (SRTF)
Multilevel Queue
A multilevel queue is suitable when the processes are classified in groups. The multilevel queue scheduling algorithm partition the queue into several separate queues. Each… Read More »Multilevel Queue
Fork-Join Concept
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
Concurrency Conditions
There are certain conditions for concurrency. Here we have listed them for you in this article. Conditions for Concurrency , the read set for ,… Read More »Concurrency Conditions
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