An interprocessor memory access arbitrating scheme for the S-3800 vector supercomputer

T. Sakakibara, Katsuyoshi Kitai, T. Isobe, Shigeko Yazawa, Teruo Tanaka, Yoshiko Tamaki, Y. Inagami
{"title":"An interprocessor memory access arbitrating scheme for the S-3800 vector supercomputer","authors":"T. Sakakibara, Katsuyoshi Kitai, T. Isobe, Shigeko Yazawa, Teruo Tanaka, Yoshiko Tamaki, Y. Inagami","doi":"10.1109/ISPAN.1994.367140","DOIUrl":null,"url":null,"abstract":"Reports an instruction-based variable priority scheme which achieves high sustained memory throughput on a tightly coupled multiprocessor (TCMP) vector supercomputer. We analyze the two types of priority control for arbitrating interprocessor memory access conflict. In the case of request level priority control, mutual obstruction causes performance degradation, while in the case of fixed priority control, it is caused by memory bank occupation. Mutual obstruction is caused by requests of different instructions that interfere with each other, and memory bank occupation is caused by continuous accessing of the same memory bank by higher priority instructions. The instruction-based variable priority scheme works as follows: (1) the priority of each pipeline is usually changed at the end of an instruction. (2) The priority is changed more than once in the middle of an instruction, such as a stride multiple-of-8 or indirect access instruction which may occupy the same memory bank by itself. This strategy reduces mutual obstruction because the priority of each pipeline is stable in the middle of an instruction. It also reduces memory bank occupation because opportunity for memory access among different instructions is made equal by changing the priority at the end of on instruction. Moreover, it prevents memory bank occupation by stride multiple-of-8 or indirect access instruction, by changing the priority more frequently. Consequently, high sustained memory throughput can be achieved on TCMP vector supercomputers. We implemented this scheme in Hitachi's S-3800 supercomputer.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"18 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.367140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Reports an instruction-based variable priority scheme which achieves high sustained memory throughput on a tightly coupled multiprocessor (TCMP) vector supercomputer. We analyze the two types of priority control for arbitrating interprocessor memory access conflict. In the case of request level priority control, mutual obstruction causes performance degradation, while in the case of fixed priority control, it is caused by memory bank occupation. Mutual obstruction is caused by requests of different instructions that interfere with each other, and memory bank occupation is caused by continuous accessing of the same memory bank by higher priority instructions. The instruction-based variable priority scheme works as follows: (1) the priority of each pipeline is usually changed at the end of an instruction. (2) The priority is changed more than once in the middle of an instruction, such as a stride multiple-of-8 or indirect access instruction which may occupy the same memory bank by itself. This strategy reduces mutual obstruction because the priority of each pipeline is stable in the middle of an instruction. It also reduces memory bank occupation because opportunity for memory access among different instructions is made equal by changing the priority at the end of on instruction. Moreover, it prevents memory bank occupation by stride multiple-of-8 or indirect access instruction, by changing the priority more frequently. Consequently, high sustained memory throughput can be achieved on TCMP vector supercomputers. We implemented this scheme in Hitachi's S-3800 supercomputer.<>
S-3800矢量超级计算机的处理器间存储器访问仲裁方案
报告了一种在紧密耦合多处理器(TCMP)矢量超级计算机上实现高持续内存吞吐量的基于指令的可变优先级方案。我们分析了仲裁处理器间内存访问冲突的两种优先级控制。在请求级优先级控制的情况下,相互阻塞导致性能下降,而在固定优先级控制的情况下,相互阻塞是由占用内存库引起的。相互阻碍是由于不同指令的请求相互干扰造成的,占用内存库是由于高优先级指令不断访问同一内存库造成的。基于指令的可变优先级方案的工作原理如下:(1)每个管道的优先级通常在一条指令结束时改变。(2)优先级在一条指令的中间被改变了不止一次,比如一个跨步8的倍数或间接访问指令,它们可能自己占用同一个内存库。这种策略减少了相互阻碍,因为每个管道的优先级在指令中间是稳定的。它还减少了内存库占用,因为通过在指令结束时改变优先级,不同指令之间的内存访问机会是相等的。此外,它通过更频繁地改变优先级来防止跨步8的多访问指令或间接访问指令占用内存库。因此,在TCMP矢量超级计算机上可以实现高的持续内存吞吐量。我们在日立的S-3800超级计算机上实现了这个方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信