{"title":"可重构网格的最优排序算法","authors":"Ju-wook Jang, V. Prasanna","doi":"10.1109/IPPS.1992.223059","DOIUrl":null,"url":null,"abstract":"An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1<or=T<or= square root n. Previously, the bound was achieved over log n<or=T<or= square root n.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"139","resultStr":"{\"title\":\"An optimal sorting algorithm on reconfigurable mesh\",\"authors\":\"Ju-wook Jang, V. Prasanna\",\"doi\":\"10.1109/IPPS.1992.223059\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1<or=T<or= square root n. Previously, the bound was achieved over log n<or=T<or= square root n.<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"2016 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"139\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.223059\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An optimal sorting algorithm on reconfigurable mesh
An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
