Ritchie, G. and Levine, J. (2003) A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. In: Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group. UNSPECIFIED.
10.1.1.123.651_1_.pdf - Submitted Version
Download (69kB) | Preview
The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing. Finding optimal schedules for such an environment is (in general) an NP-hard problem, and so heuristic approaches must be used. Work with other NP-hard problems has shown that solutions found by heuristic algorithms can often be improved by applying local search procedures to the solution found. This paper describes a simple but effective local search procedure for scheduling independent jobs in HC environments which, when combined with fast construction heuristics, can find shorter schedules on benchmark problems than other solution techniques found in the literature, and in significantly less time.
|Item type:||Book Section|
|Keywords:||heterogeneous computing environments, grid computing, heuristic algorithms , solution techniques, Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||26 Jul 2011 09:10|
|Last modified:||27 Mar 2015 07:01|
Actions (login required)