[go: up one dir, main page]
Scribd
Upload
448 views1 page

Multiprocessor Scheduling

Multiprocessor scheduling in operating systems involves distributing processes across multiple CPUs to allow for simultaneous execution. There are two main approaches: asymmetric multiprocessing where one CPU handles scheduling and I/O while others run user processes, and symmetric multiprocessing where each CPU independently schedules from a common ready queue or private queues. Symmetric multiprocessing is more complex as it requires coordinating access to shared memory and I/O devices between independent schedulers.

Uploaded by

Rajkumar Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
448 views1 page

Multiprocessor Scheduling

Multiprocessor scheduling in operating systems involves distributing processes across multiple CPUs to allow for simultaneous execution. There are two main approaches: asymmetric multiprocessing where one CPU handles scheduling and I/O while others run user processes, and symmetric multiprocessing where each CPU independently schedules from a common ready queue or private queues. Symmetric multiprocessing is more complex as it requires coordinating access to shared memory and I/O devices between independent schedulers.

Uploaded by

Rajkumar Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Multiprocessor scheduling in operating system

In the multiprocessor scheduling, there are multiple CPU’s which share the load so that various
processes run simultaneously. In general, the multiprocessor scheduling is complex as compared
to single processor scheduling. In the multiprocessor scheduling, there are many processors and
they are identical and we can run any process at any time.

Approaches to Multiple-Processor Scheduling –:

1. Asymmetric multiprocessing-:

One approach is when all the scheduling decisions and I/O processing are handled by a single
processor which is called the Master Server and the other processors executes only the user
code. This is simple and reduces the need of data sharing. The master server runs the operating
system process and the slave server run the user processes. The memory and input-output
devices are shared among all the processors and all the processor are connected to a common
bus. This system is simple and reduces the data sharing so this system is called Asymmetric
multiprocessing.

2. Symmetric multiprocessing-:

A second approach uses Symmetric Multiprocessing where each processor is self scheduling.
All processes may be in a common ready queue or each processor may have its own private
queue for ready processes. The scheduling proceeds further by having the scheduler for each
processor examine the ready queue and select a process to execute.

You might also like