Memory Map

SCHEDULING
1256 views
SCHEDULING

When a computer is multiprogrammed, it often has multiple processes or threads competing for the CPU simultaneously. This situation happens whenever two or more of them are in the ready state at the same time. If only one CPU is available, a choice has to be made which

Thread Scheduling
1416 views
Thread Scheduling

When many processes each have multiple threads, we have two levels of parallelism present: processes and threads. Scheduling in such systems differs considerably depending on whether user-level threads or kernel-level threads (or both) are supported.

Cleaning Policy / Virtual Memory Interface
1241 views
Cleaning Policy / Virtual Memory Interface

Paging works best when there are lots of free page frames that can be claimed as page faults take place. If every page frame is full, and moreover customized, before a new page can be brought in, an old page must first be written to disk. To make sure a plentiful supply of free

Page 0 of 1 Previous 1 Next