{"title":"Efficient personalized communication on wormhole networks","authors":"F. Petrini, M. Vanneschi","doi":"10.1109/PACT.1997.644003","DOIUrl":null,"url":null,"abstract":"Bridging models, such as the BSP (bulk synchronous parallel) model, tend to abstract the characteristics of interconnection networks using a small set of parameters, by dividing the computation into supersteps and organizing the communication into global patterns called h-relations. In this paper, we evaluate (through experimental results conducted on a wormhole-routed 2D torus and a quaternary fat-tree with 256 processing nodes) the execution time of three families of h-relations with variable degree of imbalance. We also prove a strong result that links the communication performance of the fat-tree with the BSP abstraction of the interconnection network. Given a generic h-relation, we can provide a value of g (the gap) that, in the worst case, slightly overestimates the completion time and is very close to optimality.","PeriodicalId":177411,"journal":{"name":"Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques","volume":"417 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACT.1997.644003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Bridging models, such as the BSP (bulk synchronous parallel) model, tend to abstract the characteristics of interconnection networks using a small set of parameters, by dividing the computation into supersteps and organizing the communication into global patterns called h-relations. In this paper, we evaluate (through experimental results conducted on a wormhole-routed 2D torus and a quaternary fat-tree with 256 processing nodes) the execution time of three families of h-relations with variable degree of imbalance. We also prove a strong result that links the communication performance of the fat-tree with the BSP abstraction of the interconnection network. Given a generic h-relation, we can provide a value of g (the gap) that, in the worst case, slightly overestimates the completion time and is very close to optimality.