Interested to Buy Any Domain ? << Click Here >> for more details...
Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 10878 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 |
Which one you will use to implement critical section?
What are the three conditions that must be present for deadlock to be possible?
What is 32 bit operating system?
What is an interrupt lattency?
What happens if we don’t override a run method?
What are different types of interprocess communication methods?
What are the problems can stack based management in recursive calling of functions?
Can ram cause blue screen?
What layer is http?
How do you tell if your os is corrupted?
Is gnome a shell?
What are the advantages of multiprocessor system?
Windows 
