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
Determine the reasons for Poor response time Process busy or High I/O rates or High paging rates

Describe when you run an unlink() operation to remove a file on the ext3 file system. Be specific about what disk blocks have to be written where in what order. State your assumpti

What are the three main activities of an operating system in regard to memory management? Keep track of which parts of memory are now being used and by whom. Decide which pr

What are the requirements for solution of critical section problems? Mutual exclusion : If process p is implementing in its critical section then no other processes can be exe

Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time

Q. Process migration in a heterogeneous network is typically impossible given the differences in architectures and operating systems. Explain a method for process migration across

SSTF stands for Abbreviation of SSTF is Shortest-Seek-time-first scheduling

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

i am just wondering if you have expert in nachos operating system thank you

Vyvtvtn8