State space compression in history driven quasi-static scheduling

被引：0
|
作者：
Lomeña, AG [1 ]
López-Vallejo, M [1 ]
Watanabe, Y [1 ]
Kondratyev, A [1 ]
机构：
[1] Univ Politecn Madrid, ETSI Telecomunicac, Dept Elect Engn, E-28040 Madrid, Spain
来源：
EMBEDDED SOFTWARE FOR SOC | 2003年
关键词：
hash table; state explosion; quasi-static scheduling;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents efficient compression techniques to avoid the state space explosion problem during 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 live programs. We suggest two complementary compression techniques that effectively reduce the size of the generated schedule and make the problem tractable for large specifications. Our experimental results reveal a significant reduction in algorithmic complexity (both in memory storage and CPU time) obtained for medium and large size problems.
引用
收藏
页码：261 / 274
页数：14
相关论文
共 50 条
  • [1] An efficient hash table based approach to avoid state space explosion in history driven quasi-static scheduling
    Lomeña, AG
    López-Vallejo, M
    Watanabe, Y
    Kondratyev, A
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, PROCEEDINGS, 2003, : 428 - 433
  • [2] Quasi-static scheduling of communicating tasks
    Darondeau, Philippe
    Genest, Blaise
    Thiagarajan, P. S.
    Yang, Shaofa
    CONCUR 2008 - CONCURRENCY THEORY, PROCEEDINGS, 2008, 5201 : 310 - +
  • [3] Quasi-static scheduling for concurrent architectures
    Cortadella, J
    Kondratyev, A
    Lavagno, L
    Taubin, A
    Watanabe, Y
    FUNDAMENTA INFORMATICAE, 2004, 62 (02) : 171 - 196
  • [4] Quasi-Static Scheduling for Safe Futures
    Navabi, Armand
    Zhang, Xiangyu
    Jagannathan, Suresh
    PPOPP'08: PROCEEDINGS OF THE 2008 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2008, : 23 - 32
  • [5] Quasi-static scheduling for concurrent architectures
    Cortadella, J
    Kondratyev, A
    Lavagno, L
    Watanabe, Y
    THIRD INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2003, : 29 - 40
  • [6] Quasi-static scheduling of communicating tasks
    Darondeau, Philippe
    Genest, Blaise
    Thiagarajan, P. S.
    Yang, Shaofa
    INFORMATION AND COMPUTATION, 2010, 208 (10) : 1154 - 1168
  • [7] QUASI-STATIC COMPRESSION OF A COMPACT TORUS
    MOLVIK, AW
    EDDLEMAN, JL
    HAMMER, JH
    HARTMAN, CW
    MCLEAN, HS
    PHYSICAL REVIEW LETTERS, 1991, 66 (02) : 165 - 168
  • [8] False path elimination in quasi-static scheduling
    Arrigoni, G
    Duchini, L
    Lavagno, L
    Passerone, C
    Watanabe, Y
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, 2002 PROCEEDINGS, 2002, : 964 - 970
  • [9] Quasi-static compression properties of graphene aerogel
    Niu, Lulu
    Xie, Jing
    Chen, Pengwan
    Li, Guangyong
    Zhang, Xuetong
    DIAMOND AND RELATED MATERIALS, 2021, 111
  • [10] Quasi-static load space qualification test
    Orefice, Martina
    Quaranta, Vincenzo
    Bruno, Giovanni
    Martinotti, Giuseppe
    Tartaglia, Carmine Carandente
    2021 IEEE 8TH INTERNATIONAL WORKSHOP ON METROLOGY FOR AEROSPACE (IEEE METROAEROSPACE), 2021, : 48 - 52
12345