SSM-MP: more scalability in shared-memory multi-processor

Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors Pub Date : 1995-10-02 DOI:10.1109/ICCD.1995.528923

Shigeaki Iwasa, Shu Shing, Hisashi Mogi, Hiroshi Nozuwe, Hiroo Hayashi, Osamu Wakamori, Takashi Ohmizo, Kuninori Tanaka, H. Sakai, M. Saito

{"title":"SSM-MP: more scalability in shared-memory multi-processor","authors":"Shigeaki Iwasa, Shu Shing, Hisashi Mogi, Hiroshi Nozuwe, Hiroo Hayashi, Osamu Wakamori, Takashi Ohmizo, Kuninori Tanaka, H. Sakai, M. Saito","doi":"10.1109/ICCD.1995.528923","DOIUrl":null,"url":null,"abstract":"Bus-based shared-memory multi-processors (SM-MP) have successfully been used commercially, since implementation requires no drastic changes to the programming paradigm. In this paper we propose the memory structure called SSM-MP (Scalable shared-memory multi-processors), aimed to shorten the cache refill latency and to relax the bus bottle neck problem. In this machine, main memory consists of local memories dedicated to each of the processors and something called MTag. MTag is a small piece of hardware that filters out bus traffic headed to the system bus and maintains cache coherency. A popular UNIX (SVR4 ES/MP) was ported. Original OS code works well due to its natural locality. Furthermore, by allocating tasks to the local memory, we were able to reduce the system bus traffic to nearly a quarter. SSM-MP is an effective approach in building a multi-processor system with a medium number (4-32) of processors.","PeriodicalId":281907,"journal":{"name":"Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1995.528923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Bus-based shared-memory multi-processors (SM-MP) have successfully been used commercially, since implementation requires no drastic changes to the programming paradigm. In this paper we propose the memory structure called SSM-MP (Scalable shared-memory multi-processors), aimed to shorten the cache refill latency and to relax the bus bottle neck problem. In this machine, main memory consists of local memories dedicated to each of the processors and something called MTag. MTag is a small piece of hardware that filters out bus traffic headed to the system bus and maintains cache coherency. A popular UNIX (SVR4 ES/MP) was ported. Original OS code works well due to its natural locality. Furthermore, by allocating tasks to the local memory, we were able to reduce the system bus traffic to nearly a quarter. SSM-MP is an effective approach in building a multi-processor system with a medium number (4-32) of processors.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

SSM-MP:在共享内存多处理器中具有更高的可伸缩性

基于总线的共享内存多处理器(SM-MP)已经成功地用于商业，因为实现不需要对编程范例进行重大更改。本文提出了SSM-MP(可扩展共享内存多处理器)内存结构，旨在缩短缓存重新填充延迟和缓解总线瓶颈问题。在这台机器中，主存储器由专用于每个处理器的本地存储器和称为MTag的东西组成。MTag是一小块硬件，它过滤掉流向系统总线的总线流量并保持缓存一致性。移植了一个流行的UNIX (SVR4 ES/MP)。原始操作系统代码由于其自然位置而工作良好。此外，通过将任务分配到本地内存，我们能够将系统总线流量减少到近四分之一。SSM-MP是构建中等数量(4-32)处理器的多处理器系统的有效方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors

自引率

0.00%

发文量

期刊最新文献

Design and implementation of a 100 MHz centralized instruction window for a superscalar microprocessor Multiprocessor design verification for the PowerPC 620 microprocessor Connection-oriented net model and fuzzy clustering techniques for K-way circuit partitioning Dynamic minimization of OKFDDs Simple tree-construction heuristics for the fanout problem