M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin
{"title":"当“颗粒大小”不重要时","authors":"M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin","doi":"10.1109/DMCC.1991.633317","DOIUrl":null,"url":null,"abstract":"We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"When \\\"Grain Size\\\" Doesn't Matter\",\"authors\":\"M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin\",\"doi\":\"10.1109/DMCC.1991.633317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.\",\"PeriodicalId\":313314,\"journal\":{\"name\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1991.633317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.