Sciweavers

474 search results - page 6 / 95
» Search-based Job Scheduling for Parallel Computer Workloads
Sort
View
ICPADS
2006
IEEE
14 years 1 months ago
Ensuring Fairness Among Participating Clusters During Multi-site Parallel Job Scheduling
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
William M. Jones, Walter B. Ligon III
JSSPP
2009
Springer
14 years 1 months ago
The Gain of Overbooking
This paper analyzes the effect of overbooking for scheduling systems in a commercial environment. In this scenario each job is associated with a release time and a finishing deadl...
Georg Birkenheuer, André Brinkmann, Holger ...
JSSPP
2007
Springer
14 years 1 months ago
Prospects of Collaboration between Compute Providers by Means of Job Interchange
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
Christian Grimme, Joachim Lepping, Alexander Papas...
JSSPP
2009
Springer
14 years 1 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
IPPS
2000
IEEE
13 years 11 months ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng