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 is sin_addr?
Is Micro-kernel better than Macro-kernel at ‘cpu usage’ and ‘response time’ ?
Distinguish between PCS and SCS scheduling.
What do you understand by transaction atomicity?
What is live boot?
What is NOS?
What is an operating system on a computer?
How you can check whether a machine is 64 bit or 32 bit?
Which is better 32 bit or 64 bit?
What is context-switching in multi-threading?
What is a root program?
What is system unit?