Article

Free access

Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

Author:

Hussein M. AlnuweiriAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 732 - 739

https://doi.org/10.1145/125826.126169

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

M. Ajtai,1. Konllos, E. Szemeredi, "An O(n Iogn) Sorting Network", Proc. 15th Annual Sympe,sium on Theory of Computing, 198:t.

Digital Library

Google Scholar

[2]

1I. M. Alnuweiri, "A New Class of ()ptireal VI~SI Networks for Multidimensional Transforms", Proc. International (~onfercnce on Parallel Processing, 1990.

Google Scholar

[3]

G. Bilardi anti F. P. Preparata, "A MiniltlUnl Area VLST Network for O(log n) Time Starting", IEEE Transactions on (7ornpT~,lers, c-3},1, April 1985, pp. 336-3,13.

Digital Library

Google Scholar

[4]

G. Bilardi and F. I). Preparata, "The VI,S! Oplitnality of thc AKS Sorting Network", Informs, lion Processin.q Letters, 1985.

Digital Library

Google Scholar

[5]

G.Bilardi and M. Sarrafzadeh, "Optimal VI~SI Circuits for Discrete Fourier Transform in VI~SI", in Advances in Compv, ting Research, Ed. 1". I). Prepara, ta, JA{ Press, Greenwich, CT, 1987, pp. 87-101.

Google Scholar

[6]

D. Kleitman, F. T. Leighton, M. Lepley, (}. 1~. MiLler, "New l~ryouts for the Shuflle.Exchang;c Graph" Proc. ACM Syrup. on Theory of (;olnputaion, pp. 278-292, 1981.

Digital Library

Google Scholar

[7]

F. T. Leighton, "New Lowt,r Bound Techniques for VLSI", Mathematical Systems Theory, 17, 1984, pp. 47-40.

Crossref

Google Scholar

[8]

F. T. I~eighton, "Tight Bounds on the Complexity of Parallel Sorting", IEEE Transactions on Computers, c-34, 4, April 1985, pp. 344-354.

Digital Library

Google Scholar

[9]

J. M. Marberg and E. Gafni, "Sorting in a Constant Number of Row and Column Phases on a Mesh", Al#orithmica, vol. 3, pp. 561-572, 1988.

Digital Library

Google Scholar

[10]

I). E. Muller and F. P. Preparata, "Bounds to Complexities of Networks for Sorting and for Switching", .lournal of the ACM, 22, April 1975, pp. 195-201.

Digital Library

Google Scholar

[11]

I). D. Nath, S. N. Maheshwari, P. C. P. Bhatt, "Emclent VLSI Networks for Parallel Processing Based on Orthogonal Trees", IEEE Transactions on Computers, c-32, 6, June 1983.

Google Scholar

[12]

N. Pippenger, "Sorting and Selecting in Rounds", SIAM Journal on Computing, }6, 6, December 1987', pp. 1032-1038.

Digital Library

Google Scholar

[13]

{. I). Scherson and S. Sen, "Parallel Sorting on Two l)imensional VLSI Models of Computation", IEEE Transactions on Cor.~pulers, c-38, February 1989, pp. 238-249.

Digital Library

Google Scholar

[14]

C. l). Thomson,"Area-Time Complexity for VLSI," Proc. ACM Symposium on Theory of Computation, May 1979.

Digital Library

Google Scholar

[15]

C. D. Thompson, "The VI+St Complexity of Sorting", IEEE Transactions on Computers, c-32, }2, December 1983.

Digital Library

Google Scholar

[16]

J. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984.

Digital Library

Google Scholar

[17]

L. G. Valiant and G. Brebner, "Universal Schemes for Parallel Communication", Proc. 13th Annual A CM Symposium on Theory of Computing, 1981.

Digital Library

Google Scholar

Cited By

View all

Alnuweiri H(1993)A New Class of Optimal Bounded-Degree VLSI Sorting NetworksIEEE Transactions on Computers10.1109/12.27729942:6(746-752)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1109/12.277299
Alnuweiri H(1992)Routing BPS Permutations in VLSIProceedings of the 6th International Parallel Processing Symposium10.1109/IPPS.1992.223061(116-119)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1109/IPPS.1992.223061

Index Terms

Recommendations

Pram simulations on bounded-degree networks
A New Class of Optimal Bounded-Degree VLSI Sorting Networks

Minimum-area very large scale integration (VLSI) networks have been proposed for sorting N elements in O(log,N) time. However, most of such networks proposed have complex structures, and no explicit network construction is given in others. New designs ...
Fast and feasible periodic sorting networks of constant depth
SFCS '94: Proceedings of the 35th Annual Symposium on Foundations of Computer Science

A periodic comparator network has depth (or period) k, if for every t>k, the compare-exchange operations performed at step t are executed between exactly the same registers as at step t-k. We introduce a general method that converts an arbitrary ...

Comments

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
148
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alnuweiri H(1993)A New Class of Optimal Bounded-Degree VLSI Sorting NetworksIEEE Transactions on Computers10.1109/12.27729942:6(746-752)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1109/12.277299
Alnuweiri H(1992)Routing BPS Permutations in VLSIProceedings of the 6th International Parallel Processing Symposium10.1109/IPPS.1992.223061(116-119)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1109/IPPS.1992.223061

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pram simulations on bounded-degree networks

A New Class of Optimal Bounded-Degree VLSI Sorting Networks

Fast and feasible periodic sorting networks of constant depth

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Pram simulations on bounded-degree networks

A New Class of Optimal Bounded-Degree VLSI Sorting Networks

Fast and feasible periodic sorting networks of constant depth

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations