Algorithms for the parallel alternating direction access machine

Bogdan S. Chlebus, Artur Czumaj, Leszek Ga̧sieniec, Mirosław Kowaluk, Wojciech Plandowski

Research output: Contribution to journalArticle

Abstract

We describe a number of algorithms for the model for parallel computation called parallel alternating-direction access machine (PADAM). This model has the memory modules of the global memory arranged as a two-dimensional array, with each processor assigned to a row and a column, the processors can switch synchronously between row and column access modes. We study the issues of inter-processor communication and of efficient use of memory on the PADAM, and develop: an optimal routing scheme among memory modules, algorithms enhancing random access of processors to all memory blocks, and general simulations of shared memory machines. Finally, we present optimal algorithms for the problems of selection, merging, and sorting.

Original languageEnglish (US)
Pages (from-to)151-173
Number of pages23
JournalTheoretical Computer Science
Volume245
Issue number2
DOIs
StatePublished - Aug 28 2000
Externally publishedYes

Keywords

  • Algorithm
  • Parallel computation
  • Routing
  • Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithms for the parallel alternating direction access machine'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., Czumaj, A., Ga̧sieniec, L., Kowaluk, M., & Plandowski, W. (2000). Algorithms for the parallel alternating direction access machine. Theoretical Computer Science, 245(2), 151-173. https://doi.org/10.1016/S0304-3975(99)00280-7