Explain the popular multiprocessor thread-scheduling
strategies.
Answer / guest
Load Sharing: Processes are not assigned to a particular
processor. A global queue of threads is maintained. Each
processor, when idle, selects a thread from this queue.
Gang Scheduling: A set of related threads is scheduled to
run on a set of processors at the same time, on a 1-to-1
basis. Closely related threads or processes may be
scheduled this way to reduce synchronization blocking, and
minimize process switching. Group scheduling predated this
strategy.
Dedicated processor assignment: Provides implicit
scheduling defined by assignment of threads to processors.
For the duration of program execution, each program is
allocated a set of processors equal in number to the number
of threads in the program. Processors are chosen from the
available pool.
Dynamic scheduling: The number of thread in a program can
be altered during the course of execution.
| Is This Answer Correct ? | 9 Yes | 2 No |
Describe Banker’s algorithm
Is it possible to have a deadlock involving only one process?
How do I empty my mac cache?
What are the three main purposes of an operating system?
How do you kill pid?
How do I stop blue screen?
What is a long term scheduler & short term schedulers?
what is the place where microsoft outlook express's back up is taken ?
What is fragmentation? Different types of fragmentation?
Who was the discover Mouse & When.?
What is inaddr_any?
What are device drivers in os?