skip to main content
article
Free Access

Teaching parallel algorithm with process topologies

Authors Info & Claims
Published:01 March 2000Publication History
Skip Abstract Section

Abstract

Parallel algorithms are often introduced to students by describing the geometric topologies formed by communicating processes and often the geographic relationships between them. However, the two most common message passing environments used in teaching, PVM and MPI, each provide only rudimentary support for the specification and execution of process topologies. There is a strong need for better syntactic and semantic support for process topologies in these environments, so that students may concentrate on the algorithms being studied, and not have to wrestle with the environments' infrastructure. This paper first motivates, and then describes the use of additional support within PVM and MPI which addresses this need.

References

  1. 1 Cunha, J.C., and Lourenco, J. An Integrated Course on Parallel and Distributed Processing, in Proceedings of ACM Computer Science Education Technical Symposium'98, Atlanta, Georgia, Mar. 1998, pp217-221. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Jin, L., and Yang, L. A Laboratory for Teaching Parallel Computing on Parallel Structures, in Proceedings of ACM Computer Science Education Technical Symposium'95, Nashville, Tennessee, Mar. 1995, pp71-75. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 The Message Passing Interface Forum, MPh A Message- Passing Interface Standard, 1994, Available from http : //www. mcs. anl. gov/mpi.Google ScholarGoogle Scholar
  4. 4 The Message Passing Interface Forum, MPI-2: Extensions to the Message-Passing Interface, 1997, Available from http : //www. mpi- forum, org.Google ScholarGoogle Scholar
  5. 5 Geist A., Bequelin, A., Dongarra, J., Jiang, W., Mancheck, R., and Sunderam, V. PVM 3 User's Guide and Reference Manual, Available from http : //www. netl lb. org/pvm3 /ug3. ps, 1994.Google ScholarGoogle Scholar
  6. 6 Geist A., Bequelin, A., Dongarra, J., Jiang, W., Mancheck, R., and Sunderam, V. PVM: Parallel Virtual Machine, A User Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, Massachusetts, ISBN 0-262-57108-0, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Schaller, N.C., and Kitchen, A.T., Experiences in Teaching Parallel Computing - Five Years Later, SIGCSE Bulletin, Vol 27, No. 3, Sept. 1995, pp15-20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Tosten, R.S., and Tymann, P. Using and Teaching Workstation-Based Parallelism, Workshop presentation at ACM Computer Science Education Technical Symposium'96, Philadelphia, PA. Feb. 1996, abstract in SIGCSE Bulletin, Vol 28, No. 1, p423.Google ScholarGoogle Scholar

Index Terms

  1. Teaching parallel algorithm with process topologies

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGCSE Bulletin
                ACM SIGCSE Bulletin  Volume 32, Issue 1
                Mar. 2000
                429 pages
                ISSN:0097-8418
                DOI:10.1145/331795
                Issue’s Table of Contents

                Copyright © 2000 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 March 2000

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!