A Lower-Bound Algorithm for Load Balancing in Real-Time Systems
Paper i proceeding, 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.

Författare

Cecilia Ekelin

Chalmers, Institutionen för datorteknik

Jan Jonsson

Chalmers, Institutionen för datorteknik

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 3144 146-158

Ämneskategorier

Datorteknik

DOI

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

ISBN

3-540-22667-2

Mer information

Skapat

2017-10-07