
- Akl89 Akl, S. G., The Design and Analysis of Parallel Algorithms, Prentice Hall International (1989). Google Scholar
Digital Library
- Finkel83 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).Google Scholar
Digital Library
- Foster89 Foster, I. and S. Taylor, STRAND New Concepts in Parallel Programming, Prentice Hall International (1989). Google Scholar
Digital Library
- Foster89 Foster, I., "Automatics Generation of Self Scheduling Programs," MCSD Argonne National Laboratory, Aronne, IL. 60439, (1989).Google Scholar
- Ghafarian82 Ghafarian, A., "A Study of Parallel Algorithms for Multiprocossor Systems," Ph.D. Thesis, , Glasgow University-United Kingdom (January 1982).Google Scholar
- Ghafarian90 Ghafarian, A., "A Tool for DistributeA Backtrack Programming, TDBP," Technical Report #90-21, The University of Chicago --Chicago (August 1990).Google Scholar
- Halstead85 Halstead, Jr., R. H., "Multilisp: A Language for Concurrent Symbolic Computation," ACM TOPLAS 7 pp. 501-538 (October 1985). Google Scholar
Digital Library
- Imai79 Imai, M., T. Fukumura, and Y. Yoshida, "A Parallelized Branch-and-Bound Algorithm: Implementation and Efficiency," Systems, Computers, Controls 10(3) (1979).Google Scholar
- Kernighan87 Kemighan, B.W., The C Programming Language, Prentice Hall International (1978). Google Scholar
Digital Library
- Knuth75 Knuth, D. E. and R. W. Moore, "An Analysis of Alpha-Beta Pruning," Artificial Intelligence 6(4) pp. 293-326 (Winter 1975).Google Scholar
Cross Ref
- Lawler66 Lawler, E. L. and D. Wood, "Branch and Bound Methods: A Survey," Operations Research 14(4) pp. 699-719 (1966).Google Scholar
Digital Library
- Manber86 Manber, U., "On Maintaining Dynamic information in a Concurrent Environment," SIAM Journal of Computing 15(4)pp. 1130-1142 (November 1986). Google Scholar
Digital Library
- Scott85 Scott, M. L., "Design and Implementation of a Distributed Systems language," Ph. D. Thesis, Technical Report #596, University of Wisconsin-Madison (May 1985). Google Scholar
Digital Library
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 ...
A portable distributed implementation of the parallel multipole tree algorithm
HPDC '95: Proceedings of the 4th IEEE International Symposium on High Performance Distributed ComputingSeveral variants of parallel multipole-based algorithms have been implemented to further research in fields such as computational chemistry and astro-physics. We present a distributed parallel implementation of a multipole-based algorithm that is ...






Comments