Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 10468 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 |
How does operating system kernel work?
What is deadlock? Explain.
Can I use chkdsk on ssd?
What is crpc in law?
Explain Marshalling?
How do you kill pid?
What is the main thread?
Explain the handheld systems. List the issues related to the handheld system.
Explain a heavy weight process?
In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?
Give a non-computer example of preemptive and non-preemptive scheduling?
Explain how a copying garbage collector works.
Windows 
