Distrbuted Processing and Generating Ial Addresses for Block-Cyclic Distributed Array


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2835-2844, Nov. 1998
10.3745/KIPSTE.1998.5.11.2835,   PDF Download:

Abstract

Most data parallel languages provide the block-cyclic distribution (cyclic(k)) that is one of the most general regular distributions. In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, efficient compiling methods or run-time methods are required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple scan method that is modified from the virtual-block scheme. The other is a linear-time M table that contains the local memory access information construction method. This method is simpler than other algorithms for generating a M table. Experimental results show that a simple can method has poor performance but a linear-time M table generation method is faster than other algorithms in M table generation time and access time for 10,000 array elements.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. O. Young, K. T. Geun, H. T. Don, K. S. Dug, "Distrbuted Processing and Generating Ial Addresses for Block-Cyclic Distributed Array," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2835-2844, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2835.

[ACM Style]
Kwon Oh Young, Kim Tae Geun, Han Tack Don, and Kim Shin Dug. 1998. Distrbuted Processing and Generating Ial Addresses for Block-Cyclic Distributed Array. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2835-2844. DOI: 10.3745/KIPSTE.1998.5.11.2835.