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 the disadvantages of context switching?
Hello this is gaurav garg I have completed BCA. plz TEll me how will ask question in interview.
Why are wait states used?
What is mutual exclusion and multithreading in OS?
Is atomic thread safe?
What is the purpose of port forwarding?
Describe main memory and secondary memory storage in brief.
Why is 64 bit called x86?
What is time- sharing system?
To ensure one pgm. doesnt corrupt other pgm. in a Multi-pgm. enviornment .what you should do?
How does reference counting manage memory allocated objects?
How do I know if my os is corrupted?