CHAP10 - Multiprocessor and Real-Time Scheduling Chapter 10...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Multiprocessor and Real-Time Scheduling Chapter 10
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Classifications of Multiprocessor Systems Loosely coupled multiprocessor Each processor has its own memory and I/O channels Functionally specialized processors Such as I/O processor Controlled by a master processor Tightly coupled multiprocessing Processors share main memory Controlled by operating system
Background image of page 2
Independent Parallelism Separate application or jog No synchronization More than one processor is available Average response time to users is less
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Coarse and Very Coarse- Grained Parallelism Synchronization among processes at a very gross level Good for concurrent processes running on a multiprogrammed uniprocessor Can by supported on a multiprocessor with little change
Background image of page 4
Medium-Grained Parallelism Parallel processing or multitasking within a single application Single application is a collection of threads Threads usually interact frequently
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Fine-Grained Parallelism Highly parallel applications Specialized and fragmented area
Background image of page 6
Scheduling Assignment of processes to processors Use of multiprogramming on individual processors Actual dispatching of a process
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Assignment of Processes to Processors Treat processors as a pooled resource and assign process to processors on demand Permanently assign process to a processor Dedicate short-term queue for each processor Less overhead Processor could be idle while another processor has a backlog
Background image of page 8
Assignment of Processes to Processors Global queue Schedule to any available processor Master/slave architecture Key kernel functions always run on a particular processor Master is responsible for scheduling Slave sends service request to the master Disadvantages Failure of master brings down whole system Master can become a performance bottleneck
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Assignment of Processes to Processors Peer architecture Operating system can execute on any
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 44

CHAP10 - Multiprocessor and Real-Time Scheduling Chapter 10...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online