loading...
An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling
Munich, Germany March 03-March 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.2003.10187Design, Automation and Test in Europe ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Antonio G. Lomeña, Marisa López-Vallejo, Yosinori Watanabe, Alex Kondratyev, "An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling," Design, Automation and Test in Europe Conference and Exhibition, vol. 1, pp. 10428, Design, Automation and Test in Europe Conference and Exhibition (DATE'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/DATE.2003.10187,
author = {Antonio G. Lomeña and Marisa López-Vallejo and Yosinori Watanabe and Alex Kondratyev},
title = {An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling},
journal ={Design, Automation and Test in Europe Conference and Exhibition},
volume = {1},
year = {2003},
issn = {1530-1591},
pages = {10428},
doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.2003.10187},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Design, Automation and Test in Europe Conference and Exhibition
TI - An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling
SN - 1530-1591
SP
EP
A1 - Antonio G. Lomeña,
A1 - Marisa López-Vallejo,
A1 - Yosinori Watanabe,
A1 - Alex Kondratyev,
PY - 2003
KW - null
VL - 1
JA - Design, Automation and Test in Europe Conference and Exhibition
ER -
 
Antonio G. Lomeña, Technical University of Madrid
Marisa López-Vallejo, Technical University of Madrid
Yosinori Watanabe, Cadence Berkeley Laboratories
Alex Kondratyev, Cadence Berkeley Laboratories

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.

Citation:
Antonio G. Lomeña, Marisa López-Vallejo, Yosinori Watanabe, Alex Kondratyev, "An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling," date, vol. 1, pp.10428, Design, Automation and Test in Europe Conference and Exhibition (DATE'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.