{"title":"网格连接多广播计算机的广义旋转排序","authors":"Chin-Fu Lin, S. Horng, T. Kao","doi":"10.1142/S0129053395000282","DOIUrl":null,"url":null,"abstract":"In this paper, we first present an O(log n) time sorting algorithm on 3-D mesh-connected computers with multiple broadcasting (abbreviated to MCCMB) using n1/2×n1/2×n1/2 processors. Our algorithm is derived from rotate sort. Further, we also show that the result can be extended to k-dimensional MCCMB of size to sort n data items in O(7k−3 log n) time, for k≥3. The algorithm proposed is optimal speed-up while k is any constant. The contribution of this paper is to show that the proposed algorithm can be run in a higher dimensional MCCMB and using fewer processors but keeps the same time complexity as O(log n).","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized Rotate Sort on Mesh-Connected Computers with Multiple Broadcasting Using Fewer Processors\",\"authors\":\"Chin-Fu Lin, S. Horng, T. Kao\",\"doi\":\"10.1142/S0129053395000282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we first present an O(log n) time sorting algorithm on 3-D mesh-connected computers with multiple broadcasting (abbreviated to MCCMB) using n1/2×n1/2×n1/2 processors. Our algorithm is derived from rotate sort. Further, we also show that the result can be extended to k-dimensional MCCMB of size to sort n data items in O(7k−3 log n) time, for k≥3. The algorithm proposed is optimal speed-up while k is any constant. The contribution of this paper is to show that the proposed algorithm can be run in a higher dimensional MCCMB and using fewer processors but keeps the same time complexity as O(log n).\",\"PeriodicalId\":270006,\"journal\":{\"name\":\"Int. J. High Speed Comput.\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. High Speed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129053395000282\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. High Speed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129053395000282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized Rotate Sort on Mesh-Connected Computers with Multiple Broadcasting Using Fewer Processors
In this paper, we first present an O(log n) time sorting algorithm on 3-D mesh-connected computers with multiple broadcasting (abbreviated to MCCMB) using n1/2×n1/2×n1/2 processors. Our algorithm is derived from rotate sort. Further, we also show that the result can be extended to k-dimensional MCCMB of size to sort n data items in O(7k−3 log n) time, for k≥3. The algorithm proposed is optimal speed-up while k is any constant. The contribution of this paper is to show that the proposed algorithm can be run in a higher dimensional MCCMB and using fewer processors but keeps the same time complexity as O(log n).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
