Sciweavers

26 search results - page 2 / 6
» Job scheduling methods for reducing waiting time variance
Sort
View
PPOPP
2006
ACM
13 years 11 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
PVLDB
2008
124views more  PVLDB 2008»
13 years 4 months ago
Scheduling shared scans of large data files
We study how best to schedule scans of large data files, in the presence of many simultaneous requests to a common set of files. The objective is to maximize the overall rate of p...
Parag Agrawal, Daniel Kifer, Christopher Olston
HPCA
2004
IEEE
14 years 5 months ago
Reducing the Scheduling Critical Cycle Using Wakeup Prediction
For highest performance, a modern microprocessor must be able to determine if an instruction is ready in the same cycle in which it is to be selected for execution. This creates a...
Todd E. Ehrhart, Sanjay J. Patel
IPPS
2007
IEEE
13 years 11 months ago
Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making a...
Luís Nogueira, Luís Miguel Pinho
IPPS
2006
IEEE
13 years 11 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan