Kernel

Mutual Exclusion with Busy Waiting
2099 views
Mutual Exclusion with Busy Waiting

In this section we will study various proposals for achieving mutual exclusion, so that while one process is busy updating shared memory in its critical region, no other process will go into its critical region and cause trouble.

SCHEDULING
1406 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
1577 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.

Page 0 of 1 Previous 1 Next