J. Cheung, S. Dhall, S. Lakshmivarahan, L. Miller, B. Walker
{"title":"一类新的两阶段并行排序方案","authors":"J. Cheung, S. Dhall, S. Lakshmivarahan, L. Miller, B. Walker","doi":"10.1145/800174.809751","DOIUrl":null,"url":null,"abstract":"A two stage parallel sorting scheme is presented in which in the first stage the input file is divided into a number of subfiles and sorted in parallel using the conventional heap sort algorithm. The second stage then merges the sorted sub-files in parallel. It is shown that a given input file of size n can be sorted in 0(n) time using 0(log n) processors. The speed-up ratio, which is a measure of the effectiveness of parallel processing, with respect to the best sequential algorithm, is asymptotically proportional to log n, which is optimal in the number of processors used.","PeriodicalId":321698,"journal":{"name":"ACM '82","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new class of two stage parallel sorting schemes\",\"authors\":\"J. Cheung, S. Dhall, S. Lakshmivarahan, L. Miller, B. Walker\",\"doi\":\"10.1145/800174.809751\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A two stage parallel sorting scheme is presented in which in the first stage the input file is divided into a number of subfiles and sorted in parallel using the conventional heap sort algorithm. The second stage then merges the sorted sub-files in parallel. It is shown that a given input file of size n can be sorted in 0(n) time using 0(log n) processors. The speed-up ratio, which is a measure of the effectiveness of parallel processing, with respect to the best sequential algorithm, is asymptotically proportional to log n, which is optimal in the number of processors used.\",\"PeriodicalId\":321698,\"journal\":{\"name\":\"ACM '82\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '82\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800174.809751\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '82","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800174.809751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A two stage parallel sorting scheme is presented in which in the first stage the input file is divided into a number of subfiles and sorted in parallel using the conventional heap sort algorithm. The second stage then merges the sorted sub-files in parallel. It is shown that a given input file of size n can be sorted in 0(n) time using 0(log n) processors. The speed-up ratio, which is a measure of the effectiveness of parallel processing, with respect to the best sequential algorithm, is asymptotically proportional to log n, which is optimal in the number of processors used.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
