Skip to main content
SpringerLink
Log in

Evaluation of Search Heuristics for Embedded System Scheduling Problems

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2239))

Abstract

In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of complex constraints that typically appear in this type of systems. We therefore address this problem using constraint programming due to its expressive, yet powerful features. Our work includes an evaluation of different search heuristics, such as variable-value orderings and symmetry exclusion, for this particular problem domain. It is shown that by using search configurations appropriate for the problem, the average search complexity can be reduced by as much as an order of magnitude.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Trans. on Computers, 49(1): 81–87, 2000.

    Article  Google Scholar 

  2. I. Ahmad and Y.-K. Kwok. Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: Defying the high complexity using effective search techniques. In Proc. of the Int’l Conf. on Parallel Processing, pp. 424–431, Minneapolis, Minnesota, August 10-14, 1998.

    Google Scholar 

  3. J. A. Bannister and K. S. Trivedi. Task allocation in fault-tolerant distributed systems. Acta Informatica, 20: 261–281, 1983.

    Article  MathSciNet  Google Scholar 

  4. P. Brucker, M. R. Garey, and D. S. Johnson. Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Mathematics of Operations Research, 2(3): 275–284, August 1977.

    Article  MathSciNet  Google Scholar 

  5. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In H. Glaser et al.,editors, Proc. of the Int’l Symposium on Programming Languages: Implementations, Logics, and Programs, volume 1292 of Lecture Notes in Computer Science, pp. 191–206, Southampton, UK, September 3-5, 1997.

    Google Scholar 

  6. C. Ekelin and J. Jonsson. A modeling framework for constraints in real-time systems. Tech. Rep. 00-9, Dept. of Computer Engineering, Chalmers University of Technology, S-412 96 Göteborg, Sweden, May 2000.

    MATH  Google Scholar 

  7. C. Ekelin and J. Jonsson. Solving embedded system scheduling problems using constraint programming. Tech. Rep. 00-12, Dept. of Computer Engineering, Chalmers University of Technology, S-412 96 Göteborg, Sweden, April 2000.

    MATH  Google Scholar 

  8. J. Jonsson and K. G. Shin. A parametrized branch-and-bound strategy for scheduling precedence-constrained tasks on a multiprocessor system. In Proc. of the Int’l Conf. on Parallel Processing, pp. 158–165, Bloomingdale, Illinois, 1997.

    Google Scholar 

  9. Intelligent Systems Laboratory. SICStus Prolog User’s Manual. Swedish Institute of Computer Science, 1995. http://www.sics.se/isl/sicstus/

  10. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1): 46–61, January 1973.

    Article  MathSciNet  Google Scholar 

  11. K. Ramamritham. Allocation and scheduling of precedence-related periodic tasks. IEEE Trans. on Parallel and Distributed Systems, 6(4): 412–420, April 1995.

    Article  Google Scholar 

  12. K. Schild and J. Würtz. Scheduling of time-triggered real-time systems.Constraints, 5(4): 335–357, October 2000.

    Article  MathSciNet  Google Scholar 

  13. J. Slaney and S. Thiébaux. On the hardness of decision and optimisation problems. In Proc. of ECAI, pp. 244–248, Brighton, UK, 1998.

    Google Scholar 

  14. B. M. Smith and I. P. Gent. Symmetry breaking during search in constraint programming. In Proc. of ECAI, pp. 599–603, Berlin, Germany, 2000.

    Google Scholar 

  15. R. Szymanek, F. Gruian, and K. Kuchcinski. Digital systems design using constraint logic programming. In Proc. of the Practical Application of Constraint Technology and Logic Programming, Manchester, England, April 10-12, 2000.

    Google Scholar 

  16. K. W. Tindell, A. Burns, and A. J. Wellings. Allocating hard real-time tasks: An NP-hard problem made easy. Real-Time Systems, 4(2): 145–165, June 1992.

    Article  Google Scholar 

  17. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.

    Google Scholar 

  18. J. Xu. Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. on Software Engineering, 19(2): 139–154, February 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Chalmers University of Technology, SE-412 96, Göteborg, Sweden

    Cecilia Ekelin & Jan Jonsson

Authors
  1. Cecilia Ekelin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Jonsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ekelin, C., Jonsson, J. (2001). Evaluation of Search Heuristics for Embedded System Scheduling Problems. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation