Sciweavers

375 search results - page 19 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
81
Voted
IPPS
2007
IEEE
15 years 8 months ago
Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
Franck Butelle, Mourad Hakem, Lucian Finta
120
Voted
ICALP
2000
Springer
15 years 5 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
JSSPP
2009
Springer
15 years 8 months ago
The Gain of Overbooking
This paper analyzes the effect of overbooking for scheduling systems in a commercial environment. In this scenario each job is associated with a release time and a finishing deadl...
Georg Birkenheuer, André Brinkmann, Holger ...
124
Voted
IPPS
2002
IEEE
15 years 6 months ago
The Self-Tuning dynP Job-Scheduler
In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The perfor...
Achim Streit
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
15 years 6 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers