{"title":"异构集群上矩阵-矩阵乘法的可扩展性分析","authors":"A. Kalinov","doi":"10.1109/ISPDC.2004.45","DOIUrl":null,"url":null,"abstract":"The paper is devoted to scalability analysis of a typical linear algebra algorithm on heterogeneous clusters. We proof that traditional scalability metrics proposed for analysis of linear algebra algorithms is applicable on heterogeneous platform and investigate influence of three heterogeneous strategies of computation distribution to scalable universal matrix multiplication algorithm (SUMMA) scalability.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"18 1","pages":"303-309"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Scalability analysis of matrix-matrix multiplication on heterogeneous clusters\",\"authors\":\"A. Kalinov\",\"doi\":\"10.1109/ISPDC.2004.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper is devoted to scalability analysis of a typical linear algebra algorithm on heterogeneous clusters. We proof that traditional scalability metrics proposed for analysis of linear algebra algorithms is applicable on heterogeneous platform and investigate influence of three heterogeneous strategies of computation distribution to scalable universal matrix multiplication algorithm (SUMMA) scalability.\",\"PeriodicalId\":62714,\"journal\":{\"name\":\"骈文研究\",\"volume\":\"18 1\",\"pages\":\"303-309\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"骈文研究\",\"FirstCategoryId\":\"1092\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPDC.2004.45\",\"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":"1092","ListUrlMain":"https://doi.org/10.1109/ISPDC.2004.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scalability analysis of matrix-matrix multiplication on heterogeneous clusters
The paper is devoted to scalability analysis of a typical linear algebra algorithm on heterogeneous clusters. We proof that traditional scalability metrics proposed for analysis of linear algebra algorithms is applicable on heterogeneous platform and investigate influence of three heterogeneous strategies of computation distribution to scalable universal matrix multiplication algorithm (SUMMA) scalability.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
