Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1996: Mathematical Foundations of Computer Science 1996 pp 267–278Cite as

Parallel Alternating-Direction Access Machine

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

This paper presents a theoretical study of a model of parallel computations called Parallel Alternating-Direction Access Machine (Padam). Padam is an abstraction of the multiprocessor computers Adena /adenart and a prototype architecture usc/omp. The main feature of Padam is the organization of access to the global memory:

  1. (1)

    the memory modules are arranged as a 2-dimensional array,

  2. (2)

    each processor is assigned to a row and a column,

  3. (3)

    the processors switch synchronously between row and column access modes, and can access any of the assigned modules in each mode without conflicts.

Since the padam processors have such a restricted access to the partially shared memory, developing tools to enhance flexibility of access to the memory is important. The paper concentrates on these issues.

Work partially supported by EC Cooperative Action IC-1000 (project ALTEC: Algorithms for Future Technologies) and a research grant from Matsushita Electric Industrial Company Ltd.

Partially supported by DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik”, ME 872/4-1 and by DFG-Sonderforschungsbereich 376 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen”.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Dietzfelbinger and F. Meyer auf der Heide, Dynamic Hashing in Real Time, in Informatik: Festschrift zum 60. Geburtstag von Günter Hotz, ed. J. Buchmann, H. Ganzinger, and W. J. Paul, B. G. Teuber Verlagsgesellschaft, Leipzig, 1992, pp. 95–119.

    Google Scholar 

  2. A. Gibbons and W. Rytter, “Efficient Parallel Algorithms”, Cambridge University Press, 1988.

    Google Scholar 

  3. K. Hwang, P.-S. Tseng, and D. Kim, On Orthogonal Multiprocessor for Parallel Scientific Computations, IEEE Transactions on Computers 38 (1989) 47–61.

    Article  Google Scholar 

  4. J. JáJá, “An Introduction to Parallel Algorithms”, Addison Wesley, Reading, MA, 1992.

    Google Scholar 

  5. H. Kadota, K. Kaneko, I. Okabayashi, T. Okamoto, T. Mimura, Y. Nakakura, A. Wakatani, M. Nakajima, J. Nishikawa, K. Zaiki, and T. Nogi, Parallel Computer ADENART — its Architecture and Application, in Proceedings of the 5th ACM International Conference on Supercomputing, 1991, pp. 1–8.

    Google Scholar 

  6. H. Kadota, K. Kaneko, Y. Tanikawa, and T. Nogi, VLSI Parallel Computer with Data Transfer Network: ADENA, in Proceedings of the International Conference on Parallel Processing, Vol. I, 1989, pp. 319–322.

    Google Scholar 

  7. R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, in “Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity”, ed. J. van Leeuwen, Elsevier Science Publishers, 1990, pp. 870–941.

    Google Scholar 

  8. C. P. Kruskal, L. Rudolph, and M. Snir, A Complexity Theory of Efficient Parallel Algorithms, Theoretical Computer Science 71 (1990) 95–132.

    Article  Google Scholar 

  9. F. T. Leighton, “Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes”, Morgan Kaufman Publishers, San Mateo, California, 1991.

    Google Scholar 

  10. W. F. McColl, General Purpose Parallel Computing, in “Lectures on Parallel Computation”, ed. A. Gibbons and P. Spirakis, Cambridge University Press, 1993, pp. 337–391.

    Google Scholar 

  11. F. Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines, in Proceedings of the 1st Heinz Nixdorf Symposium “Parallel Architectures and their Efficient Use,” ed. F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, 1992, Lecture Notes on Computer Science 678, pp. 20–29.

    Google Scholar 

  12. L. G. Valiant, General Purpose Parallel Architectures, in “Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity”, ed. J. van Leeuwen, Elsevier Science Publishers, 1990, pp. 943–972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland

    Bogdan S. Chlebus, Leszek Gasieniec, Mirosław Kowaluk & Wojciech Plandowski

  2. Heinz Nixdorf Institute and Department of Mathematics & Computer Science, Universität-GH Paderborn, D-33095, Paderborn, Germany

    Artur Czumaj

  3. Max-Planck-Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken, Germany

    Leszek Gasieniec

Authors
  1. Bogdan S. Chlebus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leszek Gasieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mirosław Kowaluk
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wojciech Plandowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S., Czumaj, A., Gasieniec, L., Kowaluk, M., Plandowski, W. (1996). Parallel Alternating-Direction Access Machine. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_154

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61550-7

  • Online ISBN: 978-3-540-70597-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation