Gang scheduling

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Cloud Computing refers to the notion of outsourcing on-site available services, computational facilities, or data storage to an… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Conventional gang scheduling has the disadvantage that whe n processes perform I/O or blocking communication, their processors… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Two different approaches have been commonly used to address problems associated with space sharing scheduling strategies: (a… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Almost all previous research on gang-scheduling has ignored the impact of real job memory requirements on the performance of the… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
1998
1998
A new and more highly efficient gang scheduling implementation technique is the basis for this paper. Network preemption,in which… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1997
1997
In this paper we explore the performance of various aspects of gang scheduling designs. We developed an event-driven simulator of… (More)
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Jobs that do not require all processors in the system can be packed together for gang scheduling. We examine accounting traces… (More)
  • figure 4
Is this relevant?
1996
1996
The goal of this paper is to determine how e ciently we can implement an adequate parallel programming environment on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?