{"title":"关于一种广义广播的并行实现","authors":"C. Wedler, C. Lengauer","doi":"10.1080/01495730108935266","DOIUrl":null,"url":null,"abstract":"We prove the correctness of optimized parallel implementations of a generalized broadcast, in which a value b is distributed to a sequence of processors, indexed from 0 upwards, such that processor i receives gib (i.e., some function g applied i times to b). Its straight-forward implementation is of linear time complexity in the number of processors. This type of broadcast occurs when combining scans with an ordinary broadcast. The optimized parallel implementations we describe is based on an odd-even tree and has logarithmic time complexity.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST\",\"authors\":\"C. Wedler, C. Lengauer\",\"doi\":\"10.1080/01495730108935266\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove the correctness of optimized parallel implementations of a generalized broadcast, in which a value b is distributed to a sequence of processors, indexed from 0 upwards, such that processor i receives gib (i.e., some function g applied i times to b). Its straight-forward implementation is of linear time complexity in the number of processors. This type of broadcast occurs when combining scans with an ordinary broadcast. The optimized parallel implementations we describe is based on an odd-even tree and has logarithmic time complexity.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/01495730108935266\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01495730108935266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
We prove the correctness of optimized parallel implementations of a generalized broadcast, in which a value b is distributed to a sequence of processors, indexed from 0 upwards, such that processor i receives gib (i.e., some function g applied i times to b). Its straight-forward implementation is of linear time complexity in the number of processors. This type of broadcast occurs when combining scans with an ordinary broadcast. The optimized parallel implementations we describe is based on an odd-even tree and has logarithmic time complexity.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
