Article

Free access

Optimal schedules for parallel prefix computation with bounded resources

Authors:

Alexandru Nicolau,

Haigeng WangAuthors Info & Claims

PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming

Pages 1 - 10

https://doi.org/10.1145/109625.109627

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

Aho, A., Sethi, P#., Ullman, J., "Compilers- Principles, Techniques, and Tools", Addison Wesley, 1986.

Digital Library

Google Scholar

[2]

Aiken, A., Nicolau, A., "Perfect Pipelining: A New Loop Parallelization Technique", Proceedings of ESOP, France, Springer-Verlag, 1988.

Digital Library

Google Scholar

[3]

Chen, S. C., "Speedup of Iterative Programs in Multiprocessing Systems", Report No. UIUCDCS- R-75-694, January 1975.

Google Scholar

[4]

Cole, R., Vishkin, U., "Faster Optimal Parallel Prefix Sums and List Ranking", Information and Control, 81, pp. 334-352, 1989.

Digital Library

Google Scholar

[5]

Kruskal, C. P., Rudolph, L., Snir, M., "The Power of Parallel Prefix", IEEE Trans. on Computers, Vol., c-34, No. 10, October 1985.

Google Scholar

[6]

Kuck, D., "The Structure of Computers and Computations", Vol. 1, John Wiley & Sons, Inc., 1978.

Digital Library

Google Scholar

[7]

Ladner, R., Fischer, M., "Parallel Prefix Computation", JACM, Vol. 27, No.4, October 1980, pp. 831-838.

Digital Library

Google Scholar

[8]

Nicolau, A., "Optimal Loop Parallelization", Proceedings of the SIGPLAN '88 Conf. on Language Design and Implementation, Atlanta, Georgia, June 22-24, 1988.

Digital Library

Google Scholar

[9]

Nicolau, A., Wang, H. G., "Optimal Schedules for Parallel Prefix Computation with Bounded Resources", Teeh. Rep., Information and Computer Science, University of California Irvine, September 1990.

Google Scholar

[10]

Padua, D., Wolfe, M., "Advanced Compiler Optimizations for Supercomputers", CACM, Vol. 29, No. 12, December 1986.

Digital Library

Google Scholar

[11]

Snir, M., "Depth-size Trade-offs for Parallel Prefix Computation", Journal of Algorithms 7, 185-201, 1986.

Digital Library

Google Scholar

Cited By

View all

Bernard JRoch JTraore D(2008)Processor-Oblivious Parallel Stream ComputationsProceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)10.1109/PDP.2008.57(72-76)Online publication date: 13-Feb-2008
https://dl.acm.org/doi/10.1109/PDP.2008.57
Jana P(2004)Improved parallel prefix computation on optical multi-treesProceedings of the IEEE INDICON 2004. First India Annual Conference, 2004.10.1109/INDICO.2004.1497785(414-418)Online publication date: 2004
https://doi.org/10.1109/INDICO.2004.1497785
Lin YShih C(1999)A New Class of Depth-Size Optimal Parallel Prefix CircuitsThe Journal of Supercomputing10.1023/A:100814722996414:1(39-52)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1023/A%3A1008147229964
Show More Cited By

Index Terms

Optimal schedules for parallel prefix computation with bounded resources
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Concurrent programming structures
      2. Language types
        Parallel programming languages

Recommendations

Optimal schedules for parallel prefix computation with bounded resources
Faster optimal parallel prefix circuits: New algorithmic construction

Parallel prefix circuits are parallel prefix algorithms on the combinational circuit model. A prefix circuit with n inputs is depth-size optimal if its depth plus size equals 2n-2. Smaller depth implies faster computation, while smaller size implies ...
Tighter upper bound for sorting permutations with prefix transpositions

Permutations are sequences where each symbol in the given alphabet Σ appears exactly once. A transposition is an operation that exchanges two adjacent sublists in a permutation; if one of these sublists is restricted to be a prefix then one obtains a ...

Comments

Information & Contributors

Information

Published In

PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming

April 1991

223 pages

ISBN:0897913906

DOI:10.1145/109625

Chairman:
David S. Wise
Indiana Univ., Bloomington

ACM SIGPLAN Notices Volume 26, Issue 7
July 1991
223 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/109626
Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA
Issue’s Table of Contents

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 April 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PPoPP91

Sponsor:

SIGPLAN

PPoPP91: 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

April 21 - 24, 1991

Virginia, Williamsburg, USA

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
361
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bernard JRoch JTraore D(2008)Processor-Oblivious Parallel Stream ComputationsProceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)10.1109/PDP.2008.57(72-76)Online publication date: 13-Feb-2008
https://dl.acm.org/doi/10.1109/PDP.2008.57
Jana P(2004)Improved parallel prefix computation on optical multi-treesProceedings of the IEEE INDICON 2004. First India Annual Conference, 2004.10.1109/INDICO.2004.1497785(414-418)Online publication date: 2004
https://doi.org/10.1109/INDICO.2004.1497785
Lin YShih C(1999)A New Class of Depth-Size Optimal Parallel Prefix CircuitsThe Journal of Supercomputing10.1023/A:100814722996414:1(39-52)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1023/A%3A1008147229964
Yen-Chun Lin Lin C(1996)Efficient parallel prefix algorithms on fully connected message-passing computersProceedings of 3rd International Conference on High Performance Computing (HiPC)10.1109/HIPC.1996.565841(316-321)Online publication date: 1996
https://doi.org/10.1109/HIPC.1996.565841
Wang HNicolau AKeung SSiu K(1996)Computing Programs Containing Band Linear Recurrences on Vector SupercomputersIEEE Transactions on Parallel and Distributed Systems10.1109/71.5321097:8(769-782)Online publication date: 1-Aug-1996
https://dl.acm.org/doi/10.1109/71.532109
Wang HNicolau ASiu K(1996)The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource ConstraintsIEEE Transactions on Computers10.1109/12.54448245:11(1257-1271)Online publication date: 1-Nov-1996
https://dl.acm.org/doi/10.1109/12.544482
Wang DHu Y(1995)Multiprocessor implementation of real-time DSP algorithmsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/92.4069973:3(393-403)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1109/92.406997
Redon XFeautrier PGurd JJalby W(1994)Scheduling reductionsProceedings of the 8th international conference on Supercomputing10.1145/181181.181319(117-125)Online publication date: 16-Jul-1994
https://dl.acm.org/doi/10.1145/181181.181319
Haigeng Wang Nicolau AKeung SKai-Yeung Sunny Siu (1994)Scalable techniques for computing band linear recurrences on massively parallel and vector supercomputersProceedings of 8th International Parallel Processing Symposium10.1109/IPPS.1994.288256(502-508)Online publication date: 1994
https://doi.org/10.1109/IPPS.1994.288256
Conn HPodrazik L(1994)Parallel Recurrence Solvers for Vector and SIMD SupercomputersJournal of Parallel and Distributed Computing10.1006/jpdc.1994.115323:3(435-441)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.1006/jpdc.1994.1153
Show More Cited By

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

Optimal schedules for parallel prefix computation with bounded resources

Faster optimal parallel prefix circuits: New algorithmic construction

Tighter upper bound for sorting permutations with prefix transpositions