Efficient priority optimization in complex distributed embedded systems through search space adaptation

ABSTRACT

In this paper we present a framework for dynamic search space adaptation during evolutionary design space exploration. Compared to previous approaches our framework is capable of adapting the search space dynamically during exploration leading to better search space exploitation in the same exploration time. The application of our framework to priority optimization in complex distributed embedded systems shows that dynamic search space adaptation can significantly increase exploration efficiency, both in terms of exploration time and quality of achieved results.

REFERENCES

• 1: A. Hamann, R. Ernst. Dynamic Search Space Adaptation in Complex Distributed Embedded System, Technical Report TR-IDA-2007-01, Institute of Computer and Communication Network Engineering, Technical University of Braunschweig, Germany.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Performance attributes

General Terms:
Algorithms, Performance

Keywords:
dynamic search space adaptation, embedded systems, evolutionary algorithms, priority optimization