基于表动态寻址的矩形多模块存储系统

Jinbo Xu, Y. Dou, Jie Zhou
{"title":"基于表动态寻址的矩形多模块存储系统","authors":"Jinbo Xu, Y. Dou, Jie Zhou","doi":"10.1109/NAS.2008.42","DOIUrl":null,"url":null,"abstract":"Many researchers have been interested in the processor-memory bottleneck problem. Quite a few image applications are only interested in one or more partial regions in the images. This paper proposes an efficient multi-access memory scheme for these image applications with multiple interested regions. A multi-module memory structure is presented between the main memory and the processing units, which achieves conflict-free parallel access of randomly aligned rectangular blocks of data in the interested regions. To increase the accessing efficiency, only interested regions are transmitted from main memory to secondary multi-module memory structure, and overlapped data between different regions are reused without retransfer. The addressing scheme of secondary multi-module memory is not based on predetermined addressing function, but based on a table structure mapping virtual addresses of required data to physical addresses of secondary memory modules, which increases data reusability without losing addressing consistency. The table content is updated for addressing consistency every time processing a new region. The proposed twin-table structure and block-rescheduling scheme reduce the addressing latency. Synthesis results on FPGA indicate small hardware costs for a range of access pattern dimensions. Significant transfer speedups in our experiments are achieved when compared with the scheme that accesses main memory directly.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rectangularly Multi-Module Memory System with Table-Based Dynamic Addressing Scheme\",\"authors\":\"Jinbo Xu, Y. Dou, Jie Zhou\",\"doi\":\"10.1109/NAS.2008.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many researchers have been interested in the processor-memory bottleneck problem. Quite a few image applications are only interested in one or more partial regions in the images. This paper proposes an efficient multi-access memory scheme for these image applications with multiple interested regions. A multi-module memory structure is presented between the main memory and the processing units, which achieves conflict-free parallel access of randomly aligned rectangular blocks of data in the interested regions. To increase the accessing efficiency, only interested regions are transmitted from main memory to secondary multi-module memory structure, and overlapped data between different regions are reused without retransfer. The addressing scheme of secondary multi-module memory is not based on predetermined addressing function, but based on a table structure mapping virtual addresses of required data to physical addresses of secondary memory modules, which increases data reusability without losing addressing consistency. The table content is updated for addressing consistency every time processing a new region. The proposed twin-table structure and block-rescheduling scheme reduce the addressing latency. Synthesis results on FPGA indicate small hardware costs for a range of access pattern dimensions. Significant transfer speedups in our experiments are achieved when compared with the scheme that accesses main memory directly.\",\"PeriodicalId\":153238,\"journal\":{\"name\":\"2008 International Conference on Networking, Architecture, and Storage\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Networking, Architecture, and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2008.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Networking, Architecture, and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2008.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

许多研究者对处理器-内存瓶颈问题很感兴趣。相当多的图像应用只对图像中的一个或多个局部区域感兴趣。针对具有多个感兴趣区域的图像应用,本文提出了一种高效的多访问存储方案。在主存储器和处理单元之间提出了一种多模块存储结构,实现了对感兴趣区域内随机排列的矩形数据块的无冲突并行访问。为了提高访问效率,只将感兴趣的区域从主存储器传输到辅助多模块存储器结构,不同区域之间的重叠数据被重用而不重传。辅助多模块内存的寻址方案不是基于预定的寻址功能,而是基于一种表结构,将所需数据的虚拟地址映射到辅助内存模块的物理地址,在保证寻址一致性的前提下提高了数据的可重用性。每次处理一个新区域时,都会更新表内容以解决一致性问题。提出的双表结构和块重调度方案降低了寻址延迟。FPGA上的综合结果表明,在一系列访问模式维度下,硬件成本较小。与直接访问主存的方案相比,我们的实验取得了显著的传输速度提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rectangularly Multi-Module Memory System with Table-Based Dynamic Addressing Scheme
Many researchers have been interested in the processor-memory bottleneck problem. Quite a few image applications are only interested in one or more partial regions in the images. This paper proposes an efficient multi-access memory scheme for these image applications with multiple interested regions. A multi-module memory structure is presented between the main memory and the processing units, which achieves conflict-free parallel access of randomly aligned rectangular blocks of data in the interested regions. To increase the accessing efficiency, only interested regions are transmitted from main memory to secondary multi-module memory structure, and overlapped data between different regions are reused without retransfer. The addressing scheme of secondary multi-module memory is not based on predetermined addressing function, but based on a table structure mapping virtual addresses of required data to physical addresses of secondary memory modules, which increases data reusability without losing addressing consistency. The table content is updated for addressing consistency every time processing a new region. The proposed twin-table structure and block-rescheduling scheme reduce the addressing latency. Synthesis results on FPGA indicate small hardware costs for a range of access pattern dimensions. Significant transfer speedups in our experiments are achieved when compared with the scheme that accesses main memory directly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信