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

Evaluation of Search Heuristics for Embedded System Scheduling Problems

Cecilia Ekelin (Institutionen för datorteknik) ; Jan Jonsson (Institutionen för datorteknik)
Proceedings of the 7th IEEE Int’l Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, November 26 – December 1, 2001 p. 640–654. (2001)
[Konferensbidrag, refereegranskat]

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.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-02-17. Senast ändrad 2011-02-17.
CPL Pubid: 136904


Institutioner (Chalmers)

Institutionen för datorteknik (1985-2001)


Informations- och kommunikationsteknik

Chalmers infrastruktur