{"title":"MIMD计算机上并行三角形解算器的任务划分","authors":"J. Qin, Tony Kai Yun Chan","doi":"10.1109/HPDC.1996.546207","DOIUrl":null,"url":null,"abstract":"Considers a parallel triangular solver on a distributed-memory MIMD computer. Three task partitioning methods are discussed, with both task assignment and task scheduling. Their estimated times are provided by using a performance model and a parallel performance evaluation methodology. The optimal task granularities are deduced by the analysis of their performance. Experiences on a transputer-based multicomputer are given.","PeriodicalId":267002,"journal":{"name":"Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Task partitionings for parallel triangular solver on a MIMD computer\",\"authors\":\"J. Qin, Tony Kai Yun Chan\",\"doi\":\"10.1109/HPDC.1996.546207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considers a parallel triangular solver on a distributed-memory MIMD computer. Three task partitioning methods are discussed, with both task assignment and task scheduling. Their estimated times are provided by using a performance model and a parallel performance evaluation methodology. The optimal task granularities are deduced by the analysis of their performance. Experiences on a transputer-based multicomputer are given.\",\"PeriodicalId\":267002,\"journal\":{\"name\":\"Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPDC.1996.546207\",\"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 of 5th IEEE International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.1996.546207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Task partitionings for parallel triangular solver on a MIMD computer
Considers a parallel triangular solver on a distributed-memory MIMD computer. Three task partitioning methods are discussed, with both task assignment and task scheduling. Their estimated times are provided by using a performance model and a parallel performance evaluation methodology. The optimal task granularities are deduced by the analysis of their performance. Experiences on a transputer-based multicomputer are given.