A Lower-Bound Algorithm for Load Balancing in Real-Time Systems
Paper in proceedings, 2004

We study the problem of finding a safe and tight lower-bound on the load-balancing objective often found in real-time systems. Our approach involves the formulation of the Multiple Bounded Change-Making Problem which we efficiently solve by using a new symmetry-breaking algorithm. An experimental evaluation shows that the computed lower-bound is optimal in more than 70% of the cases and is able to find more than four times as many decidedly optimal solutions.

Author

Cecilia Ekelin

Chalmers, Department of Computer Engineering

Jan Jonsson

Chalmers, Department of Computer Engineering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 3144 146-158

Subject Categories

Computer Engineering

DOI

10.1007/978-3-540-27860-3_15

ISBN

3-540-22667-2

More information

Created

10/7/2017