Simulation of marked graphs on SIMD architectures using efficient memory management

Hatem Sellami, James D. Allen, D. Schimmel, S. Yalamanchili
{"title":"Simulation of marked graphs on SIMD architectures using efficient memory management","authors":"Hatem Sellami, James D. Allen, D. Schimmel, S. Yalamanchili","doi":"10.1109/MASCOT.1994.284401","DOIUrl":null,"url":null,"abstract":"This paper describes and evaluates the performance of an implementation of a parallel discrete event simulation of a class of Petri nets known as marked graphs on a single instruction stream multiple data stream (SIMD) architecture. The implementation uses an efficient, novel memory management technique for supporting abstract data types, where memory can be dynamically allocated/deallocated on an individual PE basis. Performance evaluations are reported for a number of \"real world\" applications.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper describes and evaluates the performance of an implementation of a parallel discrete event simulation of a class of Petri nets known as marked graphs on a single instruction stream multiple data stream (SIMD) architecture. The implementation uses an efficient, novel memory management technique for supporting abstract data types, where memory can be dynamically allocated/deallocated on an individual PE basis. Performance evaluations are reported for a number of "real world" applications.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用高效内存管理在SIMD架构上模拟标记图形
本文描述并评估了一类被称为标记图的Petri网在单指令流多数据流(SIMD)架构上的并行离散事件模拟的实现性能。该实现使用一种高效、新颖的内存管理技术来支持抽象数据类型,其中可以在单个PE的基础上动态地分配/释放内存。报告了许多“真实世界”应用程序的性能评估
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Time constrained message transmission in a LAN environment Approximate analysis of a multi-class open queueing network with class blocking and push-out Evaluating memory system performance of a large scale NUMA multiprocessor Efficient technique for performance analysis of locking protocols A maximum entropy analysis of the single server queue
×
引用
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