Sciweavers

396 search results - page 7 / 80
» Meld Scheduling: A Technique for Relaxing Scheduling Constra...
Sort
View
ICPP
2009
IEEE
14 years 2 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— 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...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...
COR
2011
13 years 2 months ago
On the application of graph colouring techniques in round-robin sports scheduling
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
R. Lewis, J. Thompson
AAAI
1997
13 years 9 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
ECAI
1994
Springer
14 years 1 days ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
W. P. M. Nuijten, Emile H. L. Aarts
CGO
2003
IEEE
14 years 1 months ago
Predicate-Aware Scheduling: A Technique for Reducing Resource Constraints
Predicated execution enables the removal of branches wherein segments of branching code are converted into straight-line segments of conditional operations. An important, but gene...
Mikhail Smelyanskiy, Scott A. Mahlke, Edward S. Da...