Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 11134 Views
- I also Faced
- E-Mail Answers
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 |
Is program files x86 64 bit?
How do I dual boot my pc?
What are the stipulations of C2 level security?
How do I know if my os is corrupted?
What are dynamic loading, dynamic linking and overlays?
How can I tell what devices are connected to my usb?
When the pipe is used?
What is the main cause of blue screen of death?
Does chkdsk delete files?
What is the unified memory architecture? Explain.
What are the steps of booting?
what are Demand paging, page faults, replacement algorithms, thrashing
Windows 
