Parallel alternating-direction access machine

Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Mirostaw Kowaluk, Wojciech Plandowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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) the memory modules are arranged as a 2-dimensional array, (2) each processor is assigned to a row and a column, (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.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings
EditorsWojciech Penczek, Andrzej Szalas
PublisherSpringer Verlag
Pages267-278
Number of pages12
ISBN (Print)3540615504, 9783540615507
DOIs
StatePublished - 1996
Externally publishedYes
Event21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996 - Cracow, Poland
Duration: Sep 2 1996Sep 6 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1113
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996
CountryPoland
CityCracow
Period9/2/969/6/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel alternating-direction access machine'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., Czumaj, A., Gasieniec, L., Kowaluk, M., & Plandowski, W. (1996). Parallel alternating-direction access machine. In W. Penczek, & A. Szalas (Eds.), Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings (pp. 267-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113). Springer Verlag. https://doi.org/10.1007/3-540-61550-4_154