Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 10474 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What are the three main purposes of an operating system?
What resources are used when a thread created?
Do I install 32 bit or 64 bit office?
What layer is http?
What is memory-management unit (mmu)?
Can a 64 bit run a 32bit program?
Explain ddks?
How can the speed of interrupt driven input output systems be improved?
Can you access a variable within a worker thread from the main thread?
Is 32 bit obsolete?
What do you mean by semaphore?
Why is 32 bit called x86 and not x32?
what's the latest ram lunch?
What is load sharing in operating system (os)?
What is the full form of os?
