Sciweavers

8 search results - page 1 / 2
» Scheduling jobs with varying parallelizability to reduce var...
Sort
View
SPAA
2010
ACM
13 years 8 months ago
Scheduling jobs with varying parallelizability to reduce variance
Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy...
COR
2007
81views more  COR 2007»
13 years 4 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu
SPAA
2009
ACM
14 years 5 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
IPPS
2006
IEEE
13 years 10 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
IPPS
2000
IEEE
13 years 9 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg