{"title":"大规模并行数据流计算系统匹配单元的设计","authors":"E. Marques, C. Kirner","doi":"10.1109/MPCS.1994.367091","DOIUrl":null,"url":null,"abstract":"This paper describes a Massively Parallel Computing System, named Recursively Structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of each node. That machine, structured as a multicomputer based on hierarchical buses, can have thousands of nodes. Each node, acting as a dataflow processor, can execute a part of a dataflow program, cooperating to solve the overall problem. Several strategies for the matching store implementation are discussed and the analysis of the techniques for highly efficient memory search is presented.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"179 1","pages":"62-74"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design of the matching unit of a massively parallel dataflow computing system\",\"authors\":\"E. Marques, C. Kirner\",\"doi\":\"10.1109/MPCS.1994.367091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a Massively Parallel Computing System, named Recursively Structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of each node. That machine, structured as a multicomputer based on hierarchical buses, can have thousands of nodes. Each node, acting as a dataflow processor, can execute a part of a dataflow program, cooperating to solve the overall problem. Several strategies for the matching store implementation are discussed and the analysis of the techniques for highly efficient memory search is presented.<<ETX>>\",\"PeriodicalId\":64175,\"journal\":{\"name\":\"专用汽车\",\"volume\":\"179 1\",\"pages\":\"62-74\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"专用汽车\",\"FirstCategoryId\":\"1087\",\"ListUrlMain\":\"https://doi.org/10.1109/MPCS.1994.367091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"专用汽车","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.1109/MPCS.1994.367091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of the matching unit of a massively parallel dataflow computing system
This paper describes a Massively Parallel Computing System, named Recursively Structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of each node. That machine, structured as a multicomputer based on hierarchical buses, can have thousands of nodes. Each node, acting as a dataflow processor, can execute a part of a dataflow program, cooperating to solve the overall problem. Several strategies for the matching store implementation are discussed and the analysis of the techniques for highly efficient memory search is presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
