Sciweavers

375 search results - page 41 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
ICA3PP
2005
Springer
14 years 1 months ago
A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
Srikumar Venugopal, Rajkumar Buyya
JSSPP
2005
Springer
14 years 1 months ago
Modeling User Runtime Estimates
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson
IPPS
2007
IEEE
14 years 2 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
2003
IEEE
14 years 1 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
GRID
2008
Springer
13 years 8 months ago
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...
Marco Aurélio Stelmar Netto, Rajkumar Buyya