Sciweavers

375 search results - page 9 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
14 years 10 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle
IPPS
2009
IEEE
15 years 9 months ago
Performance evaluation of gang scheduling in a two-cluster system with migrations
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
Zafeirios C. Papazachos, Helen D. Karatza
GCC
2004
Springer
15 years 8 months ago
Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, X...