Skip to main content
Springer Nature Link
Log in

Implementation of a parallel and distributed mapping kernel for PARIX

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 919))

Included in the following conference series:

Abstract

This paper describes the mapping kernel of the virtual topology library for the commercial run-time system PARIX. The mapping kernel is composed of a collection of injective embedding functions for special interconnection structures of process graphs (virtual topologies) onto a 2-dimensional grid architecture of parallel machines of the MIMD type. Each of these functions realizes a concrete virtual topology by placing each process on a different processor and establishing the communication channels as virtual links with communication primitives of PARIX. The implemented functions were selected under the criteria of fast distributed computation, universal applicability, and small dilation, a well-known cost measure for graph embedding. The virtual topology library supports the implementation of parallel applications and leads to a portable programming and an efficient usage of MIMD-systems.

This work was partly supported by the EU ESPRIT Basic Research Action No. 7141 (ALCOM II) and the EU Human Capital and Mobility project: ”Efficient Use of Parallel Computers: Architecture, Mapping and Communication”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Abbreviations

axb:

2-dimensional grid/torus

a×b×c:

3-dimensional grid/torus

Q(n)/DB(n):

binary hypercube/deBruijn network of dimension n

Tk(n):

complete k-ary tree of height n

P(n):

pipe (1-dimensional grid) with n nodes

R(n):

ring (1-dimensional torus) with n nodes

ST(n):

star network (one node is connected to each other) with n nodes

CL(n):

clique network (each node is connected to each other) with n nodes

D(G):

dilation of the embedding of the grid G into the x × y grid

References

  1. R. Aleliunas, A. Rosenberg: On Embedding Rectangular Grids in Square Grids, IEEE Transactions on Computers, Vol. C-31, No. 9, 1982.

    Google Scholar 

  2. F.S. Annexstein: Parallel Implementations of Graph Embeddings, Parallel Architectures and their efficient use, Springer LNCS, Vol. 678, 1992.

    Google Scholar 

  3. K.E. Batcher: Sorting networks and their applications, Proceedings of the AFIPS Spring Joint Computing Conference, Vol. 32, pp. 307–314, 1968.

    Google Scholar 

  4. M.Y. Chan, F.Y.L. Chin: Parallized simulation of grids by hypercubes, Technical Report, University of Hong Kong, October 1990.

    Google Scholar 

  5. R. Heckmann, R. Klasing, B. Monien, W. Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids, Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG91).

    Google Scholar 

  6. F.T. Leighton: Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, Inc., 1992.

    Google Scholar 

  7. E. Ma, D.G. Shea: The Embedding Kernel on the IBM Victor Multiprocessor for Program Mapping and Network Reconfiguration, Proc. of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990.

    Google Scholar 

  8. B. Monien, I.H. Sudborough: Embedding one Interconnection Network in Another, Computing Supplement 7, pp. 257–282, 1990.

    MathSciNet  Google Scholar 

  9. J. Philbin: Virtual Topologies: A New Concurrency Abstraction for High-Level Parallel Languages, DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994.

    Google Scholar 

  10. M. Röttger, U.-P. Schroeder, J. Simon: Virtual Topology Library for PARIX, Technical Report No. 148, University of Paderborn, June 1994.

    Google Scholar 

  11. F.C. Sang, I.H. Sudborough: Embedding Large Meshes into Small Ones, Dept. of Computer Science, University of Texas at Dallas, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Germany

    Markus Röttger & Ulf-Peter Schroeder

  2. Paderborn Center for Parallel Computing (PC2), D-33095, Paderborn, Germany

    Jens Simon

Authors
  1. Markus Röttger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulf-Peter Schroeder
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jens Simon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob Hertzberger Giuseppe Serazzi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röttger, M., Schroeder, UP., Simon, J. (1995). Implementation of a parallel and distributed mapping kernel for PARIX. In: Hertzberger, B., Serazzi, G. (eds) High-Performance Computing and Networking. HPCN-Europe 1995. Lecture Notes in Computer Science, vol 919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046714

Download citation

  • DOI: https://doi.org/10.1007/BFb0046714

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59393-5

  • Online ISBN: 978-3-540-49242-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics