Explain the popular multiprocessor thread-scheduling
strategies.
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 |
What are residence monitors?
what are LRU, LFU in the OS concepts? How they are useful in the scheduling?
What are different types of interprocess communication methods?
Describe the actions taken by the operating system when a page fault occurs?
Is there a 86 bit operating system?
Does chkdsk work for ssd?
How do I find the path to a file?
What is tras timing?
What is gang scheduling in operating system (os)?
Give the disadvantages of Havander's Strategies.
How does dynamic loading aid in better memory space utilization?
Can I upgrade my cpu from 32 to 64 bit?