223 search results - page 5 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
CLUSTER
2004
IEEE
13 years 11 months ago
2004
IEEE
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in designing high performance routers. The SwitchMemory-Switch...
CCGRID
2005
IEEE
14 years 1 months ago
2005
IEEE
Large distributed Grid systems pose new challenges in job scheduling due to complex workload characteristics and system characteristics. Due to the numerous parameters that must b...
EUROPAR
1998
Springer
13 years 11 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
RTSS
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...