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

1. Bosi, F., Milano, M.: Enhancing clp branch and bound techniques for scheduling problems. Software-Practice and Experience 31(1), 17–42 (2001)

   Article  MATH  Google Scholar 

2. Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)

   Chapter  Google Scholar 

3. Chao, H.-Y., Harper, M.P.: A tighter lower bound for optimal bin packing. Operations Research Letters 18, 133–138 (1995)

   Article  MATH  MathSciNet  Google Scholar 

4. Chen, G.-H., Yur, J.-S.: A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint. In: Proc. of the IEEE Int’l Conf. on Distributed Computing Systems, Paris, France, May 28-June 1, pp. 494–501 (1990)

   Google Scholar 

5. Chu, W.W., Lan, L.M.-T.: Task allocation and precedence relations for distributed real-time systems. IEEE Trans. on Computers 36(6), 667–679 (1987)

   Article  Google Scholar 

6. Ekelin, C., Jonsson, J.: A CLP framework for allocation and scheduling in embedded real-time systems. Tech. Rep. 01-12, Dept. of Computer Engineering, Chalmers University of Technology, S-412 96 Göteborg, Sweden (2001)

   Google Scholar 

7. Ekelin, C., Jonsson, J.: Evaluation of search heuristics for embedded system scheduling problems. In: Proc. of the Int’l Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, November 26-December 1, pp. 640–654 (2001)

   Google Scholar 

8. Ekelin, C., Jonsson, J.: A lower-bound algorithm for minimizing network communication in real-time systems. In: Proc. of the Int’l Conference on Parallel Processing, Vancouver, Canada, August 18-21, pp. 343–351 (2002)

   Google Scholar 

9. Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Proc. of the Int’l Conference on Principles and Practice of Constraint Programming, Ithaca, New York, September 2002, pp. 93–108 (2002)

   Google Scholar 

10. Johnson, D.S.: Near-Optimal Bin-Packing Algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1974)

    Google Scholar 

11. Korf, R.E.: A new algorithm for optimal bin packing. In: Proc. of the National Conference on Artificial Intelligence, Edmonton, Canada, July 2002, pp. 731–736 (2002)

    Google Scholar 

12. Kulanoot, A.: Algorithms for Some Hard Knapsack Problems. Ph.D. Thesis, School of Mathematics and Statistics, Curtin University of Technology, Perth, Australia (January 2000)

    Google Scholar 

13. Intelligent Systems Laboratory. SICStus Prolog User’s Manual. Swedish Institute of Computer Science (1995)

    Google Scholar 

14. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)

    MATH  Google Scholar 

15. Milano, M., van Hoeve, W.J.: Reduced cost-based ranking for generating promising subproblems. In: Proc. of the Int’l Conference on Principles and Practice of Constraint Programming, Ithaca, New York, September 2002, pp. 1–16 (2002)

    Google Scholar 

16. Wu, S.S., Sweeting, D.: Heuristic algorithms for task assignment and scheduling in a processor network. Parallel Computing 20(1), 1–14 (1994)

    Article  Google Scholar 

Download references