Algorithms for the parallel alternating direction access machine

Document Type

Article

Publication Date

8-28-2000

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. © 2000 Elsevier Science B.V. All rights reserved.

Identifier

0347899652 (Scopus)

Publication Title

Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/S0304-3975(99)00280-7

ISSN

03043975

First Page

151

Last Page

173

Issue

2

Volume

245

Grant

20244

Fund Ref

Deutsche Forschungsgemeinschaft

This document is currently not available here.

Share

COinS