نظم تشغيل 2- المحاضرة السادسة

Swapping:
? A process must be in memory to be executed.
? A process, however, can be swapped temporarily out of memory to a backing store and then
brought back into memory for continued execution.
? For example, assume a multiprogramming environment with a round-robin CPU-scheduling
algorithm. When a quantum expires, the memory manager will start to swap out the process that just
finished and to swap another process into the memory space that has been freed. In the meantime, the
CPU scheduler will allocate a time slice to some other process in memory. When each process finishes
its quantum, it will be swapped with another process. Ideally, the memory manager can swap
processes fast enough that some processes will be in memory, ready to execute, when the CPU
scheduler wants to reschedule the CPU. In addition, the quantum must be sufficiently large that
reasonable amounts of computing are done between swaps.
Swapping:
? A process must be in memory to be executed.
? A process, however, can be swapped temporarily out of memory to a backing store and then
brought back into memory for continued execution.
? For example, assume a multiprogramming environment with a round-robin CPU-scheduling
algorithm. When a quantum expires, the memory manager will start to swap out the process that just
finished and to swap another process into the memory space that has been freed. In the meantime, the
CPU scheduler will allocate a time slice to some other process in memory. When each process finishes
its quantum, it will be swapped with another process. Ideally, the memory manager can swap
processes fast enough that some processes will be in memory, ready to execute, when the CPU
scheduler wants to reschedule the CPU. In addition, the quantum must be sufficiently large that
reasonable amounts of computing are done between swaps.