DocumentCode :
659068
Title :
Conquering the scheduling alternative explosion problem of SystemC symbolic simulation
Author :
Chun-Nan Chou ; Chen-Kai Chu ; Huang, Chung-Yang Ric
Author_Institution :
Grad. Inst. of Electron. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear :
2013
fDate :
18-21 Nov. 2013
Firstpage :
685
Lastpage :
690
Abstract :
Due to the non-determinism of the SystemC scheduler, SystemC symbolic simulation faces a scalability issue. The issue stems from enumerating all scheduling alternatives such that all design behaviors can be captured assuredly. To conquer the scheduling alternative explosion problem, we first adopt symbolic partial order reduction to reduce the equivalent scheduling alternatives for exploration. Moreover, for those scheduling alternatives that cannot be reduced by partial order reduction, we merge their execution paths (and also states) into fewer ones to prevent the number of paths from explosion. The experimental results show that we achieve a tremendous scalability improvement by combining these two techniques together.
Keywords :
C++ language; discrete event simulation; scheduling; SystemC scheduler; SystemC symbolic simulation; design behaviors; execution paths; scheduling alternative explosion problem; symbolic partial order reduction; Engines; Explosions; Job shop scheduling; Merging; Optimal scheduling; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design (ICCAD), 2013 IEEE/ACM International Conference on
Conference_Location :
San Jose, CA
ISSN :
1092-3152
Type :
conf
DOI :
10.1109/ICCAD.2013.6691189
Filename :
6691189
Link To Document :
بازگشت