Abstract
In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation 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.
| Original language | English |
|---|---|
| Title of host publication | 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
| Editors | Wanlei Zhou, Andrzej Goscinski, Michael Hobbs |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 389-396 |
| Number of pages | 8 |
| ISBN (Electronic) | 0780342291, 9780780342293 |
| DOIs | |
| Publication status | Published - 1997 Jan 1 |
| Event | 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 - Melbourne, Australia Duration: 1997 Dec 10 → 1997 Dec 12 |
Publication series
| Name | 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
|---|
Other
| Other | 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
|---|---|
| Country | Australia |
| City | Melbourne |
| Period | 97/12/10 → 97/12/12 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Hardware and Architecture
- Signal Processing
Cite this
}
An efficient local address generation for the block-cyclic distribution. / Kwon, Oh Young; Kim, Tae Geun; Han, Tack-Don; Yang, Sung-Bong; Kim, Shin-Dug.
1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997. ed. / Wanlei Zhou; Andrzej Goscinski; Michael Hobbs. Institute of Electrical and Electronics Engineers Inc., 1997. p. 389-396 651507 (1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - An efficient local address generation for the block-cyclic distribution
AU - Kwon, Oh Young
AU - Kim, Tae Geun
AU - Han, Tack-Don
AU - Yang, Sung-Bong
AU - Kim, Shin-Dug
PY - 1997/1/1
Y1 - 1997/1/1
N2 - In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation 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.
AB - In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation 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.
UR - http://www.scopus.com/inward/record.url?scp=2442654426&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2442654426&partnerID=8YFLogxK
U2 - 10.1109/ICAPP.1997.651507
DO - 10.1109/ICAPP.1997.651507
M3 - Conference contribution
AN - SCOPUS:2442654426
T3 - 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
SP - 389
EP - 396
BT - 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
A2 - Zhou, Wanlei
A2 - Goscinski, Andrzej
A2 - Hobbs, Michael
PB - Institute of Electrical and Electronics Engineers Inc.
ER -