An experimental approach to a course on parallel and distributed algorithms
References
[1]
Akl, S. G., The Design and Analysis of Parallel Algorithms, Prentice Hall International (1989).
[2]
Finkel, R. A. and J. P. Fishbum, "Improved speedup bounds for pa~lel alpha-beta ~h," IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI.5(1) (January 1983).
[3]
Foster, I. and S. Taylor, STRAND New Concepts in Parallel Programming, Prentice Hall International (1989).
[4]
Foster, I., "Automatics Generation of Self Scheduling Programs," MCSD Argonne National Laboratory, Aronne, IL. 60439, (1989).
[5]
Ghafarian, A., "A Study of Parallel Algorithms for Multiprocossor Systems," Ph.D. Thesis, Glasgow University-United Kingdom (January 1982).
[6]
Ghafarian, A., "A Tool for DistributeA Backtrack Programming, TDBP," Technical Report #90-21, The University of Chicago --Chicago (August 1990).
[7]
Halstead, Jr., R. H., "Multilisp: A Language for Concurrent Symbolic Computation," ACM TOPLAS 7 pp. 501-538 (October 1985).
[8]
Imai, M., T. Fukumura, and Y. Yoshida, "A Parallelized Branch-and-Bound Algorithm: Implementation and Efficiency," Systems, Computers, Controls 10(3) (1979).
[9]
Kemighan, B.W., The C Programming Language, Prentice Hall International (1978).
[10]
Knuth, D. E. and R. W. Moore, "An Analysis of Alpha-Beta Pruning," Artificial Intelligence 6(4) pp. 293-326 (Winter 1975).
[11]
Lawler, E. L. and D. Wood, "Branch and Bound Methods: A Survey," Operations Research 14(4) pp. 699-719 (1966).
[12]
Manber, U., "On Maintaining Dynamic information in a Concurrent Environment," SIAM Journal of Computing 15(4)pp. 1130-1142 (November 1986).
[13]
Scott, M. L., "Design and Implementation of a Distributed Systems language," Ph. D. Thesis, Technical Report #596, University of Wisconsin-Madison (May 1985).
Index Terms
- An experimental approach to a course on parallel and distributed algorithms
Recommendations
High-Performance Radix-2, 3 and 5 Parallel 1-D Complex FFT Algorithms for Distributed-Memory Parallel Computers
In this paper, we propose high-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers. We use the four-step or six-step FFT algorithms to implement the radix-2, 3 and 5 parallel 1-D complex FFT ...
Comments
Information & Contributors
Information
Published In
Copyright © 1991 ACM.
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 March 1991
Published in SIGCSE Volume 23, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 238Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)2
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in