The PMESC Programming Library for Distributed-Memory MIMD Computers

Journal of Parallel and Distributed Computing

Volumn 57, Issue 3, 1999, Pages 295-321

  Crivelli, S ^a   Jessup, E R ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038587314     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1539     Document Type: Article

References (53)

1. Arabe J., Beguelin A., Lowekamp B., Seligman E., Starkey M., Stephan P. Technical Report. 1995.
2. Arvindam S., Kumar V., Rao V. Floorplan optimization on multiprocessors. Proceedings of the 1989 International Conference on Computer Design. 1989;IEEE Comput. Soc. Los Alamitos. p. 307-314.
3. A. Baker, S. Crivelli, E. R. Jessup, Asynchronous mechanisms for terminating task-parallel problems on distributed-memory computers, 1999.
4. Banerjee P. Parallel Algorithms for VLSI Computer-Aided Design. 1994;Prentice-Hall, Englewood Cliffs.
5. Barlow R. H., Evans D. J. A parallel organization of the bisection algorithm. Comput. J. 22:1977;267-269.
6. Barth W., Martin R. S., Wilkinson J. H. Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection. Handbook for Automatic Computation: Linear Algebra. 1971;Springer-Verlag, New York/Berlin. p. 249-256.
7. Bernstein H. J., Goldstein M. Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices. Computing. 37:1986;85-91.
8. R. Buttler, E. Lusk, User's guide to the P4 parallel programming system, http://www.fp.mcs.anl.gov/lusk/p4/index.html , August 14, 1998.
9. Chakrabarti S., Deprit E., Im E.-J., Jones J., Krishnamurthy A., Wen C.-P., Yelick K. Multipol: a distributed data structure library. Technical Report. 1995.
10. Cheng D. Y. A survey of parallel programming languages and tools. Technical Report. 1993.
11. Crivelli S. A Programming Paradigm and Library for Distributed-Memory Computers. 1995;University of Colorado at BoulderDept. of Computer Science.
12. S. Crivelli, R. Byrd, E. Eskow, R. Schnabel, R. Yu, T. Phillips, T. Head-Gordon, A global optimization strategy for predicting protein tertiary structure:α, Proteins: Structure, Function, and Genetics.
13. Das S. K., Pinotti M. C., Sakar F. Corrections to optimal and load balanced mapping of parallel priority queues in hypercubes. IEEE Trans. Parallel Distrib. Systems. 7:1996.
14. Das S. K., Pinotti M. C., Sakar F. Optimal and load balanced mapping of parallel priority queues in hypercubes. IEEE Trans. Parallel Distrib. Systems. 7:1996.
15. de Doncker E., Gupta A. Distributed and adaptive integration: Algorithms and analysis. 1994;IOS PressProceedings of Transputers '94. p. 266-277.
16. de Doncker E., Kapenga J. A. Parallel systems and adaptive integration. Parallel Comput. 7:1988;211-225.
17. de Doncker E., Vakalis I. Convergence results and speedup of parallel numerical integration algorithms. Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. 1993;. p. 539-545.
18. Eager D. L., Lazowska D. L., Zahorjan J. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Performance Evaluation. 6:March 1986;53-68.
19. Eager D. L., Lazowska D. L., Zahorjan J. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Eng. SE-12:May 1986;662-675.
20. Express C User's Guide, Version 3.0. 1990;Parasoft Corp. Pasadena.
21. Finkel R. A. Large-grain parallelism-Three case studies. Gannon D., Jamieson L. H., Douglass R. J. The Characteristics of Parallel Algorithms. 1987;MIT Press, Cambridge.
22. High Perform. Comput. Appl. 12:1988;1-299.
23. Foster I., Kesselman C., Tuecke S. The Nexus approach to integrating multithreading and communication. J. Parallel Distrib. Comput. 37:1996;70.
24. Foster I., Taylor S. Strand: New Concepts in Parallel Programming. 1990;Prentice-Hall, Englewood Cliffs.
25. Givens W. Numerical computation of the characteristic values of a real symmetric matrix. Technical Report. 1954.
26. Grama A. Y., Kumar V., Pardalos Panos. Parallel Processing of Discrete Optimization Problems: A Survey. 1993;Wiley, New York.
27. Gropp W., Lusk E., Skjellum A. Using MPI Portable Parallel Programming with the Message-Pasing Interface. 1995;MIT Press.
28. Gursoy A., Kale V. Charm 4.3 Programming Language Manual. 1994;University of IllinoisDepartment of Computer Science, Urbana-Champaign.
29. Hac A. Performance analysis of the priority queues for the load-building algorithms. J. Systems and Software. 19:1992.
30. Hempel R., Hoppe H.-C., Keller U., Krotz W. PARMACS V6.0 Specification. Pallas Internal Report. November 1993.
31. Ipsen I., Jessup E. R. Solving the symmetric tridiagonal eigenvalue problem on the hypercube. SIAM J. Sci. Stat. Comput. 11:1990;203-229.
32. Kale L. V. A tutorial introduction to CHARM. Technical Report. 1992.
33. Kale V. The Charm++ (4.5) Programming Language Manual. 1999;University of IllinoisDepartment of Computer Science, Urbana-Champaign.
34. Kohn S. R., Baden S. B. Irregular coarse-grain data parallelism. Scientific Programming. 5:1996.
35. Kumar V., Grama A. Y., Rao V. N. Scalable load balancing techniques for parallel computers. J. Parallel and Distrib. Comp. 22:1994;60-79.
36. Liu R.-C., Wang S.-D. Performance modeling and analysis of load balancing policies with priority queueing. J. Systems and Software. 20:1993.
37. Lo S., Phillipe B., Sameh A. A multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem. SIAM J. Sci. Stat. Comput. 8:1987;s155-s165.
38. Pancake C. M. A collaborative effort in parallel tool design. Dongarra J. Environments and Tools for Parallel Scientific Computing. 1995;SIAM.
39. Rao V. N., Kumar V. Parallel depth-first search, Part I: Implementation. Intern. J. Parallel Progr. 16:1987;479-500.
40. Rao V. N., Kumar V. Parallel depth-first search, Part II: Analysis. Intern. J. Parallel Progr. 16:1987;501-519.
41. Rice J. R. A metalgorithm for adaptive quadrature. Assoc. Comput. Mach. 22:1975;61-82.
42. Rice J. R. Parallel algorithms for adaptive quadrature III. Program correctness. ACM Trans. Math. Software. 2:1976;1-30.
43. Shapiro H. D. Increasing robustness in global adaptive quadrature through interval selection heuristics. ACM Trans. Math. Software. 10:1984;117-139.
44. Sinha A. B., Kale L. V. A load balancing strategy for prioritized execution of tasks. Workshop on Dynamic Object Placement and Load Balancing. 1992;ECOOP '92, Utrecht.
45. Skjellum A., Leung A. P., Smith S. G., Falgout R. D., Still C. H., Baldwin C. H. The Multicomputer Toolbox - First-generation scalable libraries. Proceedings of HICSS-27. 1994;IEEE Computer Society Press. p. 644-654.
46. Smith B., Gropp W. The design of data-structure-neutral libraries for the iterative solution of sparse linear systems. Scientific Programming. 5:1996;329-336.
47. Smith S. L. Adaptive Asynchronous Parallel Algorithms in Distributed Computation. 1991;University of Colorado at BoulderDepartment of Computer Science.
48. Smith S. L. Performance analysis of dynamic scheduling techniques for irregularly structured computation. Software for Parallel Computation. 1993;Springer-Verlag in cooperation with NATO Scientific Affairs Division.
49. Snir M., Otto S., Huss-Lederman S., Walker D., Dongarra J. MPI: The Complete Reference. 1996;MIT Press.
50. The Parallel Tools Consortium, http://www.ptools.org , 1999.
51. Wah B. W., Eva Ma Y. W. MANIP - a multicomputer architecture for solving combinatorial extremum-search problems. IEEE Trans. Comp. c-33:1984;377-390.
52. Wen C.-P., Chakrabarti S., Deprit E., Krishnamurthy A., Yelick K. Runtime support for portable distributed data structures. Proceedings of the Workshop on Languages, Compilers and Runtime Systems for Scalable Computers. May 1995;Kluwer Academic Publishers.
53. Zhang Y. Parallel Algorithms for Combinatorial Search Problems. 1989;University of California at BerkeleyComputer Science Division (EECS).