next up previous
Up: Practical Parallel Algorithms Previous: Acknowledgements

References

1
S.G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1989.

2
R.H. Arpaci, D.E. Culler, A. Krishnamurthy, S.G. Steinberg, and K. Yelick. Empirical Evaluation of the CRAY-T3D: A Compiler Perspective. In ACM Press, editor, Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 320--331, Santa Margherita Ligure, Italy, June 1995.

3
D. A. Bader and J. JáJá. Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. Technical Report CS-TR-3384 and UMIACS-TR-94-133, UMIACS and Electrical Engineering, University of Maryland, College Park, MD, December 1994. To be presented at the Fifth ACM SIGPLAN Symposium of Principles and Practice of Parallel Programming, Santa Barbara, CA, July 1995.

4
D. A. Bader, J. JáJá, D. Harwood, and L.S. Davis. Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study. Technical Report CS-TR-3449 and UMIACS-TR-95-44, Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD, May 1995. Submitted to Journal of Supercomputing.

5
D. Bailey, E. Barszcz, J. Barton, D. Browning, R. Carter, L. Dagum, R. Fatoohi, S. Fineberg, P. Frederickson, T. Lasinski, R. Schreiber, H. Simon, V. Venkatakrishnan, and S. Weeratunga. The NAS Parallel Benchmarks. Technical Report RNR-94-007, Numerical Aerodynamic Simulation Facility, NASA Ames Research Center, Moffett Field, CA, March 1994.

6
D.H. Bailey, E. Barszcz, L. Dagum, and H.D. Simon. NAS Parallel Benchmark Results 10-94. Report NAS-94-001, Numerical Aerodynamic Simulation Facility, NASA Ames Research Center, Moffett Field, CA, October 1994.

7
C.F. Baillie and P.D. Coddington. Cluster Identification Algorithms for Spin Models - Sequential and Parallel. Concurrency: Practice and Experience, 3(2):129--144, 1991.

8
V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C.-T. Ho, S. Kipnis, and M. Snir. CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IEEE Transactions on Parallel and Distributed Systems, 6:154--164, 1995.

9
P. Berthomé, A. Ferreira, B.M. Maggs, S. Perennes, and C.G. Plaxton. Sorting-Based Selection Algorithms for Hypercubic Networks. In Proceedings of the 7th International Parallel Processing Symposium, pages 89--95, Newport Beach, CA, April 1993. IEEE Computer Society Press.

10
G.E. Blelloch. Prefix sums and their applications. Technical Report CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, November 1990.

11
J. Bruck, C.-T. Ho, S. Kipnis, and D. Weathersby. Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems. In 6th Annual ACM Symposium on Parallel Algorithms and Architectures, volume 6, pages 298--309, Cape May, NJ, June 1994. ACM Press.

12
W.W. Carlson and J.M. Draper. AC for the T3D. Technical Report SRC-TR-95-141, Supercomputing Research Center, Bowie, MD, February 1995.

13
A. Choudhary, G. Fox, S. Ranka, S. Hiranandani, K. Kennedy, C. Koelbel, and J. Saltz. Software Support for Irregular and Loosely Synchronous Problems. International Journal of Computing Systems in Engineering, 3(1-4), 1992.

14
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

15
Cray Research, Inc. SHMEM Technical Note for C, October 1994. Revision 2.3.

16
D.E. Culler, A. Dusseau, S.C. Goldstein, A. Krishnamurthy, S. Lumetta, S. Luna, T. von Eicken, and K. Yelick. Introduction to Split-C. Computer Science Division - EECS, University of California, Berkeley, version 1.0 edition, March 6, 1994.

17
D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.

18
L. Dagum. Three-Dimensional Direct Particle Simulation on the Connection Machine. RNR Technical Report RNR-91-022, NASA Ames, NAS Division, August 1991.

19
J. De Keyser and D. Roose. Load Balacing Data Parallel Programs on Distributed Memory Computers. Parallel Computing, 19:1199--1219, 1993.

20
K. Dincer. Particle-in-cell simulation codes in High Performance Fortran. Report SCCS-663, Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY, November 1994.

21
A.C. Dusseau. Modeling Parallel Sorts with LogP on the CM-5. Technical Report UCB//CSD-94-829, Computer Science Division, University of California, Berkeley, 1994.

22
S. Goil and S. Ranka. Dynamic Load Balancing for Raytraced Volume Rendering on Distributed Memory Machines. Report SCCS-693, Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY, February 1995.

23
E. Hao, P.D. MacLenzie, and Q.F. Stout. Selection on the Reconfigurable Mesh. In Proceedings of the 4th Symposium on the Frontiers of Massively Parallel Computation, pages 38--45, McLean, VA, October 1992. IEEE Computer Society Press.

24
Y.-S. Hwang, R. Das, J. Saltz, B. Brooks, and M. Hodoscek. Parallelizing Molecular Dynamics Programs for Distributed Memory Machines: An Application of the CHAOS Runtime Support Library. Technical Report CS-TR-3374 and UMIACS-TR-94-125, Department of Computer Science and UMIACS, Univ. of Maryland, 1994.

25
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992.

26
J. JáJá and K.W. Ryu. The Block Distributed Memory Model. Technical Report CS-TR-3207, Computer Science Department, University of Maryland, College Park, January 1994.

27
J.F. JáJá and K.W. Ryu. The Block Distributed Memory Model for Shared Memory Multiprocessors. In Proceedings of the 8th International Parallel Processing Symposium, pages 752--756, Cancún, Mexico, April 1994. (Extended Abstract).

28
K. Mehrotra, S. Ranka, and J.-C. Wang. A Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm. In Proceedings of the 7th International Parallel Processing Symposium, pages 369--373, Newport Beach, CA, April 1993. IEEE Computer Society Press.

29
Message Passing Interface Forum. A Message Passing Interface Standard. Technical Report CS-94-230, University of Tennessee, Knoxville, TN, May 1994.

30
C.-W. Ou and S. Ranka. Parallel Remapping Algorithms for Adaptive Problems. In Proceedings of the 5th Symposium on the Frontiers of Massively Parallel Computation, pages 367--374, McLean, VA, February 1995. IEEE Computer Society Press.

31
R. Sarnath and X. He. Efficient parallel algorithms for selection and searching on sorted matrices. In Proceedings of the 6th International Parallel Processing Symposium, pages 108--111, Beverly Hills, CA, March 1992. IEEE Computer Society Press.

32
R. Sedgewick. Algorithms. Addison-Wesley, Reading, MA, 1988.

33
C. Weems, E. Riseman, A. Hanson, and A. Rosenfeld. The DARPA Image Understanding Benchmark for Parallel Computers. Journal of Parallel and Distributed Computing, 11:1--24, 1991.

34
J. Woo and S. Sahni. Load Balancing on a Hypercube. In Proceedings of the 5th International Parallel Processing Symposium, pages 525--530, Anaheim, CA, April 1991. IEEE Computer Society Press.



next up previous
Up: Practical Parallel Algorithms Previous: Acknowledgements



David A. Bader
dbader@umiacs.umd.edu