多核体系结构中具有可逆内存分配的零拷贝消息传递新方法

B. Swenson, G. Riley
{"title":"多核体系结构中具有可逆内存分配的零拷贝消息传递新方法","authors":"B. Swenson, G. Riley","doi":"10.1109/PADS.2012.3","DOIUrl":null,"url":null,"abstract":"We present a new Zero-Copy approach for message passing in a tightly coupled, multi - process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared - memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared - memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"160 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A New Approach to Zero-Copy Message Passing with Reversible Memory Allocation in Multi-core Architectures\",\"authors\":\"B. Swenson, G. Riley\",\"doi\":\"10.1109/PADS.2012.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new Zero-Copy approach for message passing in a tightly coupled, multi - process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared - memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared - memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.\",\"PeriodicalId\":299627,\"journal\":{\"name\":\"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation\",\"volume\":\"160 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PADS.2012.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADS.2012.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

我们提出了一种新的零拷贝方法,用于紧耦合、多进程并行离散事件仿真中的消息传递。我们的方法具有高度可扩展性,适合大规模分布式仿真。零复制方法从不复制消息内容。相反,消息最初是在共享内存区域中创建的,并且只有指向共享内存对象的智能指针被传递给消息接收者。智能指针可以正常解引用,并且具有引用计数语义,允许在没有引用时重用内存。与更传统的基于共享内存的消息传递相比,这种方法显著减少了进程之间复制的数据量,并显著提高了应用程序的整体性能。我们使用两个使用保守同步的分布式离散事件模拟器来证明我们方法的有效性。但是,我们还在内存管理算法中包含了全局虚拟时间和当前模拟时间的知识,从而允许回滚和回收过早释放的内存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Approach to Zero-Copy Message Passing with Reversible Memory Allocation in Multi-core Architectures
We present a new Zero-Copy approach for message passing in a tightly coupled, multi - process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared - memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared - memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信