Sciweavers

8 search results - page 2 / 2
» Scheduling jobs with varying parallelizability to reduce var...
Sort
View
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
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
SOSP
2009
ACM
14 years 2 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...