Presentation 1999/6/18
RMLS : A metaheuristic method for the multiprocessorr scheduling problem
Takahumi TANAKA, Satoshi FUJITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose a new metaheuristic method RMLS (Romdomized Multiple Local Search) for obtaining a near-optimal solution to multipocessor scheduling problem that has been recognized as a key problem for realizing efficient parallelizing compilers. As a result of computational experiments we show that if the given instance has enough parallelism with respect to the given number of processors, then RMLS outputs a better solution than conventional list scheduling algorithms. In particular, when the density of edges is around 20% and the number of procssors is 2, RMLS gives 14% better solution than the (currently) best list scheduling algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) multiprocessor scheduling problem / metaheuristic
Paper # COMP99-20
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/6/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) RMLS : A metaheuristic method for the multiprocessorr scheduling problem
Sub Title (in English)
Keyword(1) multiprocessor scheduling problem
Keyword(2) metaheuristic
1st Author's Name Takahumi TANAKA
1st Author's Affiliation Graduate School of Information Engineering, Hiroshima University()
2nd Author's Name Satoshi FUJITA
2nd Author's Affiliation Electrical Engineering, Faculty of Engineering, Hiroshima University
Date 1999/6/18
Paper # COMP99-20
Volume (vol) vol.99
Number (no) 130
Page pp.pp.-
#Pages 8
Date of Issue