173 search results - page 26 / 35 » Special Cases of Online Parallel Job Scheduling |
CONSTRAINTS
2007
13 years 7 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
HPDC
2003
IEEE
14 years 1 months ago
2003
IEEE
The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
ICPP
2009
IEEE
14 years 2 months ago
2009
IEEE
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
PARELEC
2002
IEEE
14 years 23 days ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...