A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Algorithms for the parallel alternating direction access machine
2000
Theoretical Computer Science
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 e cient use of memory on the PADAM, and develop: an optimal routing scheme among
doi:10.1016/s0304-3975(99)00280-7
fatcat:ihxdlp7mobg3nkuij3lwszh3c4