Explain the popular multiprocessor thread-scheduling
strategies.
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
Explain the basic functions of process management.
Can you fix blue screen of death?
What is an operating system on a computer?
Can I upgrade from 32bit to 64bit?
Does 64bit mean 64bit?
What is a root program?
What are the different ram standards/versions?
What is a command interpreter?
Is 32 bit obsolete?
What is tty stand for?
What is the purpose of port forwarding?
Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs?
How long does it take to chkdsk 1tb?
What is starvation and aging?
What do you mean by a semaphore?