Sciweavers

874 search results - page 45 / 175
» On Advantages of Grid Computing for Parallel Job Scheduling
Sort
View
JSSPP
2009
Springer
14 years 2 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 ...
IPPS
1997
IEEE
13 years 12 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
EOR
2008
52views more  EOR 2008»
13 years 7 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
IPPS
2002
IEEE
14 years 19 days 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
IPPS
2006
IEEE
14 years 1 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