Processing nested loop structure with data-flow dependence on a CAM-based processor HAPP

K. Lu, K. Tamaru
{"title":"Processing nested loop structure with data-flow dependence on a CAM-based processor HAPP","authors":"K. Lu, K. Tamaru","doi":"10.1109/ISPAN.1994.367156","DOIUrl":null,"url":null,"abstract":"We know that a significant advantage of content addressable memory (CAM) is that operations are performed locally, thus it can eliminate the problem of bottleneck between processor and memory. In this paper, we propose a CAM-based associative processing processor (HAPP) which is able to combine with a general processor to form an array-processor system, and besides retrieval operations, it can assist the general processor to manipulate nested loop structure with data-flow dependence for achieving high speedup in this system. We enumerate some problems of applying HAPP to a computer system to deal with nested loop structure, and the methods we used to resolve them. Also we compare HAPP with a parallel machine, BBN TC2000, to prove that HAPP gains a smaller communication penalty when the number of data items access of BBN TC2000 surpasses penalty plane.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We know that a significant advantage of content addressable memory (CAM) is that operations are performed locally, thus it can eliminate the problem of bottleneck between processor and memory. In this paper, we propose a CAM-based associative processing processor (HAPP) which is able to combine with a general processor to form an array-processor system, and besides retrieval operations, it can assist the general processor to manipulate nested loop structure with data-flow dependence for achieving high speedup in this system. We enumerate some problems of applying HAPP to a computer system to deal with nested loop structure, and the methods we used to resolve them. Also we compare HAPP with a parallel machine, BBN TC2000, to prove that HAPP gains a smaller communication penalty when the number of data items access of BBN TC2000 surpasses penalty plane.<>
处理数据流依赖于基于cam的处理器HAPP的嵌套循环结构
我们知道内容可寻址内存(CAM)的一个显著优点是操作是在本地执行的,因此它可以消除处理器和内存之间的瓶颈问题。本文提出了一种基于cam的关联处理处理器(HAPP),它可以与通用处理器结合组成一个阵列处理器系统,除了检索操作外,它还可以帮助通用处理器处理具有数据流依赖性的嵌套循环结构,从而实现系统的高加速。列举了在计算机系统中应用HAPP处理嵌套循环结构时遇到的一些问题,以及解决这些问题的方法。我们还将HAPP与一台并行机BBN TC2000进行了比较,证明当BBN TC2000的数据项访问数超过惩罚平面>时,HAPP获得的通信惩罚较小
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信