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

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.

[1]  Wesley W. Chu,et al.  Task Allocation and Precedence Relations for Distributed Real-Time Systems , 1987, IEEE Transactions on Computers.

[2]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[3]  Jan Jonsson,et al.  A lower-bound algorithm for minimizing network communication in real-time systems , 2002, Proceedings International Conference on Parallel Processing.

[4]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[5]  Michela Milano,et al.  Enhancing CLP branch and bound techniques for scheduling problems , 2001 .

[6]  Jan Jonsson,et al.  Evaluation of Search Heuristics for Embedded System Scheduling Problems , 2001, CP.

[7]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .

[8]  Richard E. Korf,et al.  A new algorithm for optimal bin packing , 2002, AAAI/IAAI.

[9]  Shen Shen Wu,et al.  Heuristic Algorithms for Task Assignment and Scheduling in a Processor Network , 1994, Parallel Comput..

[10]  Araya Kulanoot,et al.  Algorithms for Some Hard Knapsack Problems , 2001 .

[11]  Pieter H. Hartel,et al.  Programming Languages: Implementations, Logics, and Programs , 1996, Lecture Notes in Computer Science.

[12]  Mary P. Harper,et al.  A tight lower bound for optimal bin packing , 1995, Oper. Res. Lett..

[13]  Toby Walsh,et al.  Global Constraints for Lexicographic Orderings , 2002, CP.

[14]  Mats Carlsson,et al.  An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.

[15]  Willem Jan van Hoeve,et al.  Reduced Cost-Based Ranking for Generating Promising Subproblems , 2002, CP.

[16]  Gen-Huey Chen,et al.  A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.