Explain the popular multiprocessor thread-scheduling
strategies.
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
How to stop a long running thread?
What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?
What is Real Time Operating System (RTOS)? What are the advantages of RTOS?
Tell me what are the rings in windows nt?
Which is the best page replacement algorithm and Why? How
How do I update in terminal?
What is the sequence of the three way handshake?
How much ram do I need 2019?
Differentiate between logical and physical address.
Can I delete programs x86?
What are placement and replacement algorithms in the context of memory management?
List advantages and disadvantages of dynamic memory allocation vs. static memory allocation.?
What is the limit of ram capacity in a 32bit os?
What are the different types of kernel?
What do you mean by ram?