{"title":"格林童话集","authors":"T. Blank, J. Nickolls","doi":"10.1109/FMPC.1992.234881","DOIUrl":null,"url":null,"abstract":"The authors present two tales about massively parallel processors: 'Who is Fairest of Us All?' and 'The SPMD Path.' With a twist of humor, the tales discuss single-instruction multiple-data systems (SIMD), multiple-instruction multiple-data (MIMD) systems, differences, and the single program multiple data (SPMD) programming model. The first tale introduces autonomous SIMD (ASIMD), and then looks at the flexibility, programmability, cost, and effectiveness of MIMD and ASIMD systems. It is shown that ASIMD systems have the flexibility to solve real applications cost-effectively. The second tale describes the simple path that SPMD provides for programming, and why an ASIMD machine works well.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"57 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"A Grimm collection of MIMD fairy tales\",\"authors\":\"T. Blank, J. Nickolls\",\"doi\":\"10.1109/FMPC.1992.234881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present two tales about massively parallel processors: 'Who is Fairest of Us All?' and 'The SPMD Path.' With a twist of humor, the tales discuss single-instruction multiple-data systems (SIMD), multiple-instruction multiple-data (MIMD) systems, differences, and the single program multiple data (SPMD) programming model. The first tale introduces autonomous SIMD (ASIMD), and then looks at the flexibility, programmability, cost, and effectiveness of MIMD and ASIMD systems. It is shown that ASIMD systems have the flexibility to solve real applications cost-effectively. The second tale describes the simple path that SPMD provides for programming, and why an ASIMD machine works well.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"57 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234881\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors present two tales about massively parallel processors: 'Who is Fairest of Us All?' and 'The SPMD Path.' With a twist of humor, the tales discuss single-instruction multiple-data systems (SIMD), multiple-instruction multiple-data (MIMD) systems, differences, and the single program multiple data (SPMD) programming model. The first tale introduces autonomous SIMD (ASIMD), and then looks at the flexibility, programmability, cost, and effectiveness of MIMD and ASIMD systems. It is shown that ASIMD systems have the flexibility to solve real applications cost-effectively. The second tale describes the simple path that SPMD provides for programming, and why an ASIMD machine works well.<>
![[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
