CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Lower-Bound Algorithm for Load Balancing in Real-Time Systems

Cecilia Ekelin (Institutionen för datorteknik) ; Jan Jonsson (Institutionen för datorteknik)
Lecture Notes in Computer Science. 7th International Conference on Principles of Distributed Systems (OPODIS 2003), Martinique, 10-13 December 2003 (0302-9743). Vol. 3144 (2004), p. 146-158.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2013-03-13.
CPL Pubid: 174651


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)



Chalmers infrastruktur