Gang scheduling , Operating System


Gang Scheduling: A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be scheduled that way to, minimize process switching and replace synchronization blocking. Group scheduling predated this strategy.

 

1872_Gang Scheduling.png

Posted Date: 8/20/2012 3:33:46 AM | Location : United States







Related Discussions:- Gang scheduling , Assignment Help, Ask Question on Gang scheduling , Get Answer, Expert's Help, Gang scheduling Discussions

Write discussion on Gang scheduling
Your posts are moderated
Related Questions
what do obelia eat and how do they feed

What problems arise if the directory structure is a general graph? Searching for a particular file may result in searching the similar directory many times. Deletion of the fil

Explain the Peterson's solution for the critical section problem? In Peterson's solution two variables a) flag and b) turn are used as shared variables. If the both shared vari

what are disadvantages of using single directory

Message passing system:- The function of message system is to permit processes to communicate with one another without the requirement to resort (option) to shared data. Commun

What is Single-level Directory All files are constrained in the similar directory, which is simple to support and understood. One limitation is when the number of files enhance

What are the benefits of thread pools:- The benefits of thread pools are 1. It is usually faster to service a request with an existing thread than waiting to make a thread.

When you run a program on your UNIX system, the system prepares a special environment for that program. This environment owns everything needed for the system to execute the progra

What are the features of Operation Research approach?