{"title":"Accelerated logic simulation using parallel processing","authors":"F. Hoppe","doi":"10.1109/CMPEUR.1988.4948","DOIUrl":null,"url":null,"abstract":"The author presents a modified time-warp algorithm for parallel logic simulation using circuit partitioning. The algorithm allows a processor to roll back its simulation time to any given point in the past, only using the input queue. The memory space for the state queue and the output queue and the computing effort to handle them can be saved. A software model of a distributed system has been developed as test environment for the implementation of the modified algorithm, which is compared with the link time algorithm and with a sequential simulation. It is shown that the speedup of the time-warp method is less dependent on cycles in the communication graph (feedbacks in the test-circuit) than the link time method.<<ETX>>","PeriodicalId":415032,"journal":{"name":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1988.4948","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
The author presents a modified time-warp algorithm for parallel logic simulation using circuit partitioning. The algorithm allows a processor to roll back its simulation time to any given point in the past, only using the input queue. The memory space for the state queue and the output queue and the computing effort to handle them can be saved. A software model of a distributed system has been developed as test environment for the implementation of the modified algorithm, which is compared with the link time algorithm and with a sequential simulation. It is shown that the speedup of the time-warp method is less dependent on cycles in the communication graph (feedbacks in the test-circuit) than the link time method.<>