使用并行处理加速逻辑仿真

F. Hoppe
{"title":"使用并行处理加速逻辑仿真","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":"{\"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}","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

摘要

提出了一种改进的时间扭曲算法,用于电路划分的并行逻辑仿真。该算法允许处理器只使用输入队列将其模拟时间回滚到过去的任何给定点。可以节省用于状态队列和输出队列的内存空间以及处理它们的计算工作。建立了一个分布式系统的软件模型作为测试环境,将改进算法与链路时间算法进行了比较,并进行了序列仿真。结果表明,与链路时间法相比,时间扭曲法的加速对通信图中周期(测试电路中的反馈)的依赖性较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Accelerated logic simulation using parallel processing
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The automatic generation of graphical user interfaces Software engineering environments Computer-aided design of self-testable VLSI circuits An executable system specification to support the JSD methodology Guided synthesis and formal verification techniques for parameterized hardware modules
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1