A Simple Architecture for Constant Time Sorting Machines Tsong-Chih Hsu and Sheng-De W a n g Dept. of Electrical Engineering EE Building, Rm. 441 National Taiwan University Taipei, Taiwan, R.O.C. A b s t r a c t - In this paper, we propose a constant time sorting algorithm on an array composed of comparators and single-pole-double-throw switches, which is far more feasible than other constant time sorting algorithms [21]-[23]. Our results shown that the algorithm uses time T =O(1) and area A = O ( N 3 ) . T h i s nearly matches the A T 2 = ~ ( N 2 log 2 N ) lower bound for sorting in the VLSI model. Keywords: constant time sorting, sorting by ranking, enumeration sort, parallel algorithm, mesh of trees. 1. I n t r o d u c t i o n Many exciting developments have made in the field of computerized sorting since publications of the special issues on this subject 31 years ago in C o m m u n i c a t i o n s o f the A C M and 9 years ago in I E E E T
End of preview. The entire article is 7 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-simple-architecture-for-constant-time-sorting-machines-RbycOMMvQk
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A simple architecture for constant time sorting machines
Hsu, Tsong-Chih; Wang, Sheng-De
Follow ACM SIGARCH Computer Architecture News
, Volume 23 (1)
Association for Computing Machinery – Mar 1, 1995
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
