223 search results - page 29 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
HPDC
2006
IEEE
14 years 1 months ago
2006
IEEE
Using a large HPC platform, we investigate the effectiveness of symbiotic space-sharing, a technique that improves system throughput by executing parallel applications in comb...
JCIT
2007
13 years 7 months ago
2007
Grid computing systems utilize distributive owned and geographically dispersed resources for providing a wide variety of services for various applications. It is possible that the...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...