223 search results - page 14 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
CCGRID
2002
IEEE
14 years 15 days ago
2002
IEEE
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
AIPS
2006
13 years 9 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
HPCC
2009
Springer
14 years 4 days ago
2009
Springer
—Grid computing has emerged as a way to share geographically and organizationally distributed resources that may belong to different institutions or administrative domains. In th...
CNSM
2010
13 years 5 months ago
2010
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...