Explain the popular multiprocessor thread-scheduling
strategies.
- 1 Answers
- 10070 Views
- I also Faced
- E-Mail Answers
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
What is starvation os?
What are the reasons for process termination?
Which is the best operating system for pc?
Explain the meaning of kernal.
What is raid? What are the different raid levels?
What are the advantages of multiprocessor system?
What are the steps involved in following a particular instruction given by the cpu?
What is a 64 bit operating system?
What is starvation and aging?
Explain the resident set and working set of a process?
When designing the file structure for an operating system, what attributes are considered?
What are the 7 c's of communication?
What are the functions of operating system?
What are the three conditions that must be present for deadlock to be possible?
Throw some light on internal process memory.
