|
Published Articles >> Table of Contents >> Abstract
Design, Automation and Test in Europe Conference and Exhibition (DATE'03)
p. 10428
An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling
Antonio G. Lomena, Technical University of Madrid
Marisa Lopez-Vallejo, Technical University of Madrid
Yosinori Watanabe, Cadence Berkeley Laboratories
Alex Kondratyev, Cadence Berkeley Laboratories
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.2003.10187
Send link to a friend
| Abstract |
|
This paper presents an efficient hash table based method to optimally overcome a new variant of the state space explosion which appears during the quasi-static task scheduling of embedded, reactive systems. Our application domain is targeted to one-processor software synthesis, and the scheduling process is based on Petri net reachability analysis to ensure cyclic, bounded and undeadlocked programs. To achieve greater flexibility, we employ a dynamic, history based criterion to prune the search space. This makes our synthesis approach different from most existing code generation techniques. Our experimental results reveal a significant reduction in algorithmic complexity (both in memory storage and CPU time) obtained for medium and large size problems.
|
 Additional Information
|
Citation:
Antonio G. Lomena, Marisa Lopez-Vallejo, Yosinori Watanabe, Alex Kondratyev,
"An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling,"
date,
p. 10428,
Design, Automation and Test in Europe Conference and Exhibition (DATE'03),
2003
|
|
