Interested to Buy Any Domain ? << Click Here >> for more details...
Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 10854 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?
What is the most used operating system?
What is cache memory?
Explain the refresh operation in a dynamic ram?
How are the wait/signal operations for monitor different from those for semaphores?
What is called a page fault?
Is 64 bit excel faster?
How much ram can you have on a 64 bit system?
Explain arm-stickiness?
How much ram do I need for gaming?
Can my processor run 64 bit?
For a deadlock to occur what are the necessary conditions
Windows 
