skip to main content
article
Free Access

Integrating parallel algorithm design with parallel machine models

Authors Info & Claims
Published:15 March 1995Publication History
Skip Abstract Section

Abstract

In teaching of Parallel Algorithms, emphasis is usually placed on algorithms that are based on parallel random access machine (PRAM) model, but those algorithms may or may not be efficiently implementable on real parallel machines. In this paper we design parallel algorithms in relation with the actual parallel machine models and show the importance of integrating parallel algorithms with parallel machine models. We discuss this approach using traveling salesperson problem (TSP) as an example.

References

  1. 1 Brassard, G. and Bratley, P. 1988. Algorithmics: Theory and Practice. Prentice Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Hartman, J. and Sanders, D. 1993. Data Parallel Programming: A Transition from Sequential to Parallel Computing. Proceedings of the 1993 ACM Computer Science Education Conference, pp.96-100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Kumar, V. ~t. al. 1994. Introduction to Parallel Computing. The Benjamin/Cummings Publishing Co. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Jaja, J. 1992. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Co. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Jin, L. et. al. 1992. Parallel Solution of Hough Transform and Convolution Problems- A Novel Multimodal Approach. Proceedings of the 1992 A CM/SIGAPP Symposium on Applied Computing, pp775-781. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Stone, H. S. 1993. High-Performance Computer Architecture. Addison-Wesley Publishing Co. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Yang, L. et. al. 1993. Solution of Traveling Salesperson Problem (TSP) on Parallel Machine Models. Computer Science Department Technical Report TR1993-07, Cal Poly Pomona.Google ScholarGoogle Scholar

Index Terms

  1. Integrating parallel algorithm design with parallel machine models

                  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 27, Issue 1
                    March 1995
                    402 pages
                    ISSN:0097-8418
                    DOI:10.1145/199691
                    Issue’s Table of Contents
                    • cover image ACM Conferences
                      SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
                      March 1995
                      436 pages
                      ISBN:089791693X
                      DOI:10.1145/199688
                      • Chairman:
                      • Cary Laxer,
                      • Editors:
                      • Curt M. White,
                      • James E. Miller,
                      • Judy Gersting

                    Copyright © 1995 ACM

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 15 March 1995

                    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!