Skip to search formSkip to main contentSkip to account menu

Gang scheduling

In computer science, gang scheduling is a scheduling algorithm for parallel systems that schedules related threads or processes to run simultaneously… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Central processing unitComputer scienceConnection MachineContext switch

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
A Survey On WSN OS Using Real-Time Scheduling Strategy
The Real time scheduling is Defined as a Systems whose correctness depends on their temporal aspects as well as their functional… 
2012
2012
Delay-stable communications in simultaneous multicast networks
To properly operate closed industrial control networks, it is required that communication with nearly constant delay bounds be… 
2011
2011
Service control with the preemptive parallel job scheduler Scojo-PECT
User satisfaction and scheduling on grids makes predictability of response times and quality-of-service highly desirable. However… 
2006
2006
LOMARC: Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides… 
2003
2003
Gang Scheduling Extensions for I/O Intensive Workloads
Scientific applications are becoming more complex and more I/O demanding than ever. For such applications, the system with… 
2003
2003
Gang scheduling in a distributed system under processor failures and time-varying gang size
  • H. Karatza
  • The Ninth IEEE Workshop on Future Trends of…
  • 2003
  • Corpus ID: 17140442
In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A… 
2002
2002
Response Time Analysis of Gang Scheduling for Real Time Systems
This paper investigates the application of gang scheduling-based algorithms for real time systems that contain multiple… 
1999
1999
Concurrent Gang: Towards a Flexible and Scalable Gang Scheduler
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a… 
1999
1999
The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling
Gang scheduling is an effective scheduling policy for multiprocessing workloads with significant interprocess synchronization and… 
1990
1990
Wasted resources in gang scheduling
Gang scheduling (the scheduling of a number of interacting threads to run simultaneously on distinct processors) can leave… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)