Advertisement

Implementation of divide-and-conquer algorithms on multiprocessors

  • Renate Knecht
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 565)

Abstract

Algorithms with a divide-and-conquer structure are suitable candidates for parallelization. The idea of the divide-and-conquer paradigm is to fragment a problem into subproblems of the same kind, to solve the subproblems recursively, and, finally, to combine the solutions of the subproblems into a solution of the original problem.

Two algorithms of this structure namely an “approximation” algorithm for the Euclidean Traveling Salesman Problem and an algorithm to determine the convex hull of a two-dimensional point set have been implemented in FORTRAN on a CRAY X-MP using the CRAY multitasking facilities. For the parallel implementation of algorithms with a divide-and-conquer structure two methods are discussed. The goal was to find an implementation strategy which is independent of the available shared memory multiprocessor system and additionally independent of the number of processors which can be used to find the problem's solution.

Keywords

Multitasking macrotasking microtasking CRAY X-MP divide-and-conquer parallel algorithm Euclidean Traveling Salesman Problem convex hull 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, 1987).Google Scholar
  2. [2]
    J.L. Bentley, Multidimensional Divide-and-Conquer, Communications of the ACM 23 (1980) 214–229.Google Scholar
  3. [3]
    CRAY Y-MP, CRAY X-MP EA and CRAY X-MP Multitasking Programmer's Reference Manual (CRAY-Research Inc., SR-0222 F, 1989).Google Scholar
  4. [4]
    B. Golden, L. Bodin, T. Doyle, W. Stewart, jr., Approximate Traveling Salesman Algorithms, Operations Research 28 (1980) 694–711.Google Scholar
  5. [5]
    R. Gurke, Graphenalgorithmen für MIMD-Rechner (KFA Jülich, Jül-Spez-355, 1986).Google Scholar
  6. [6]
    R. Gurke, The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP, Parallel Computing 8 (1988) 177–183.Google Scholar
  7. [7]
    E. Horowitz, A. Zorat, Divide-and-Conquer for Parallel Processing, IEEE Transactions on Computers C-32 (1983) 582–585.Google Scholar
  8. [8]
    F. Hossfeld, R. Knecht, W.E. Nagel, Multitasking: Experiences with Applications on a CRAY X-MP, Parallel Computing, to appear.Google Scholar
  9. [9]
    R. Karp, Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane, Mathematics of Operations Research 2 (1977) 209–224.Google Scholar
  10. [10]
    E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, The Traveling Salesman Problem (Wiley, 1985).Google Scholar
  11. [11]
    F.P. Preparata, S.J. Hong, Convex Hulls of Finite Sets of Points in Two and Three Dimensions, Communications of the ACM 20 (1977) 87–93.Google Scholar
  12. [12]
    F.P. Preparata, M.I. Shamos, Computational Geometry — An Introduction (Springer, 1985).Google Scholar
  13. [13]
    R. Sedgewick, Algorithms (Addison-Wesley, 1988).Google Scholar
  14. [14]
    M.J. Quinn, The design and analysis of algorithms and data structures for the efficient solution of graph theoretic problems on MIMD computers, Ph.D. Thesis, Computer Science Dept., Washington State Univ., Pullman, Wash. (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Renate Knecht
    • 1
  1. 1.Zentralinstitut für Angewandte MathematikKernforschungsanlage Jülich GmbHJülichFed. Rep. Germany

Personalised recommendations