{"title":"多通道广播网络的分布式算法","authors":"Xiaojun Guan, M. Langston","doi":"10.1109/DMCC.1990.556387","DOIUrl":null,"url":null,"abstract":"A distributed algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space when the number of processors is fixed. In this brief paper, we outline a distributed algorithm for merging that, given a multi-channel broadcast network with k processors, merges two sorted lists of total length n in O(n/b+logk) time and O(k) extra space, and are thus time-space optimal for any fixed value of IC that satisfies n 2 klogk.","PeriodicalId":204431,"journal":{"name":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed Algorithms for Multi-Channel Broadcast Networks\",\"authors\":\"Xiaojun Guan, M. Langston\",\"doi\":\"10.1109/DMCC.1990.556387\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space when the number of processors is fixed. In this brief paper, we outline a distributed algorithm for merging that, given a multi-channel broadcast network with k processors, merges two sorted lists of total length n in O(n/b+logk) time and O(k) extra space, and are thus time-space optimal for any fixed value of IC that satisfies n 2 klogk.\",\"PeriodicalId\":204431,\"journal\":{\"name\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1990.556387\",\"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 the Fifth Distributed Memory Computing Conference, 1990.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1990.556387","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Algorithms for Multi-Channel Broadcast Networks
A distributed algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space when the number of processors is fixed. In this brief paper, we outline a distributed algorithm for merging that, given a multi-channel broadcast network with k processors, merges two sorted lists of total length n in O(n/b+logk) time and O(k) extra space, and are thus time-space optimal for any fixed value of IC that satisfies n 2 klogk.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
