An efficient local address generation for the block-cyclic distribution

Oh Young Kwon; Tae Geun Kim; Tack Don Han; Sung Bong Yang; Shin Dug Kim

doi:10.1109/ICAPP.1997.651507

An efficient local address generation for the block-cyclic distribution

Oh Young Kwon, Tae Geun Kim, Tack Don Han, Sung Bong Yang, Shin Dug Kim

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

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	https://doi.org/10.1109/ICAPP.1997.651507
Publication status	Published - 1997
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/Territory	Australia
City	Melbourne
Period	97/12/10 → 97/12/12

Bibliographical note

Publisher Copyright:
© 1997 IEEE.

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Hardware and Architecture
Signal Processing

Access to Document

10.1109/ICAPP.1997.651507

Cite this

Kwon, O. Y., Kim, T. G., Han, T. D., Yang, S. B., & Kim, S. D. (1997). An efficient local address generation for the block-cyclic distribution. In W. Zhou, A. Goscinski, & M. Hobbs (Eds.), 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 (pp. 389-396). [651507] (1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICAPP.1997.651507

Kwon, Oh Young ; Kim, Tae Geun ; Han, Tack Don ; Yang, Sung Bong ; Kim, Shin Dug. / An efficient local address generation for the block-cyclic distribution. 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997. editor / Wanlei Zhou ; Andrzej Goscinski ; Michael Hobbs. Institute of Electrical and Electronics Engineers Inc., 1997. pp. 389-396 (1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997).

@inproceedings{8fc6858bce874492a5010ff0528ac455,

title = "An efficient local address generation for the block-cyclic distribution",

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.",

author = "Kwon, {Oh Young} and Kim, {Tae Geun} and Han, {Tack Don} and Yang, {Sung Bong} and Kim, {Shin Dug}",

note = "Publisher Copyright: {\textcopyright} 1997 IEEE.; 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 ; Conference date: 10-12-1997 Through 12-12-1997",

year = "1997",

doi = "10.1109/ICAPP.1997.651507",

language = "English",

series = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "389--396",

editor = "Wanlei Zhou and Andrzej Goscinski and Michael Hobbs",

booktitle = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",

address = "United States",

}

Kwon, OY, Kim, TG, Han, TD , Yang, SB & Kim, SD 1997, An efficient local address generation for the block-cyclic distribution. in W Zhou, A Goscinski & M Hobbs (eds), 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997., 651507, 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997, Institute of Electrical and Electronics Engineers Inc., pp. 389-396, 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997, Melbourne, Australia, 97/12/10. https://doi.org/10.1109/ICAPP.1997.651507

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

Y1 - 1997

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.

T2 - 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

Y2 - 10 December 1997 through 12 December 1997

ER -

Kwon OY, Kim TG, Han TD , Yang SB , Kim SD. An efficient local address generation for the block-cyclic distribution. In Zhou W, Goscinski A, Hobbs M, editors, 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997. 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). https://doi.org/10.1109/ICAPP.1997.651507

An efficient local address generation for the block-cyclic distribution

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this