Performance of 4-dimensional PANDORA networks

R. F. Holt, A. B. Ruighaver
{"title":"Performance of 4-dimensional PANDORA networks","authors":"R. F. Holt, A. B. Ruighaver","doi":"10.1109/ISPAN.1994.367161","DOIUrl":null,"url":null,"abstract":"The Melbourne University Optoelectronic Multicomputer Project is investigating dense optical interconnection networks capable of providing low latency data transfers of small data items. Such capabilities are useful in the exploitation of small grain parallelism. In many cases, reducing the grain size of tasks increases the amount of parallelism which can be found in the program. Our networks use an organization of data transfers called PANDORA (PArallel Newscasts on a Dense Optical Reconfigurable Array). The communication patterns on a PANDORA network are pre-determined, removing the overhead of sending and decoding addressing information. Instead the data is recognized by the time of arrival and the channel on which it arrives. Previous efforts have focused on 2-dimensional multiple broadcasting networks where each node may broadcast a different data item on the row and columns of the network. For large processor arrays, we have to reduce the density of the interconnection network as full interconnection on each row becomes too expensive. This paper discusses a 4-dimensional network which achieves a significant reduction in density with only a small increase in data transfer delays.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"66 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","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.367161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The Melbourne University Optoelectronic Multicomputer Project is investigating dense optical interconnection networks capable of providing low latency data transfers of small data items. Such capabilities are useful in the exploitation of small grain parallelism. In many cases, reducing the grain size of tasks increases the amount of parallelism which can be found in the program. Our networks use an organization of data transfers called PANDORA (PArallel Newscasts on a Dense Optical Reconfigurable Array). The communication patterns on a PANDORA network are pre-determined, removing the overhead of sending and decoding addressing information. Instead the data is recognized by the time of arrival and the channel on which it arrives. Previous efforts have focused on 2-dimensional multiple broadcasting networks where each node may broadcast a different data item on the row and columns of the network. For large processor arrays, we have to reduce the density of the interconnection network as full interconnection on each row becomes too expensive. This paper discusses a 4-dimensional network which achieves a significant reduction in density with only a small increase in data transfer delays.<>
4维PANDORA网络的性能
墨尔本大学光电多计算机项目正在研究能够提供小数据项的低延迟数据传输的密集光互连网络。这种能力在利用小粒度并行性方面很有用。在许多情况下,减少任务的粒度可以增加程序中可以找到的并行性。我们的网络使用一种称为PANDORA(密集光可重构阵列并行新闻广播)的数据传输组织。潘多拉网络上的通信模式是预先确定的,消除了发送和解码地址信息的开销。相反,数据是通过到达时间和到达的信道来识别的。以前的工作主要集中在二维多广播网络上,其中每个节点可以在网络的行和列上广播不同的数据项。对于大型处理器阵列,我们必须降低互连网络的密度,因为每一行的完全互连变得过于昂贵。本文讨论了一种四维网络,它实现了密度的显著降低,而数据传输延迟只增加了一点点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信