A hierarchical memory structure for the 3D shelling technique

L. Shen, M.F.A. Deprettere
{"title":"A hierarchical memory structure for the 3D shelling technique","authors":"L. Shen, M.F.A. Deprettere","doi":"10.1109/CMPEUR.1992.218502","DOIUrl":null,"url":null,"abstract":"The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
三维炮击技术的分层存储结构
作者早先提出了一种新的空间划分方法,用于将辐射方法的计算映射到高度流水线的并行架构上(L.S. Shen等人,1990;1991)。这种剥壳技术可以减轻共享内存架构中主机和处理器之间的通信负载,但是随着处理器数量的增加,系统性能可能会下降。提出了一种由驻留集、缓存和主存组成的层次结构。它可以减少一个补丁的平均访问时间,从而在处理吞吐量和内存带宽之间提供更好的平衡,以增强计算的流水线性。描述了一种选择驻留集的方法,并研究了缓存设计中的不同策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural clustering algorithms for classification and pre-placement of VLSI cells General-to-specific learning of Horn clauses from positive examples Minimization of NAND circuits by rewriting-rules heuristic A generalized stochastic Petri net model of Multibus II Activation of connections to accelerate the learning in recurrent back-propagation
×
引用
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