• DocumentCode
    2165466
  • Title

    An efficient local address generation for the block-cyclic distribution

  • Author

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

  • Author_Institution
    Distributed Comput. Lab., Syst. Eng. Res. Inst., Taejon, South Korea
  • fYear
    1997
  • fDate
    10-12 Dec 1997
  • Firstpage
    389
  • Lastpage
    396
  • 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
  • Keywords
    parallel programming; parallelising compilers; array elements; array section; block-cyclic distribution; compiling method; linear-time ΔM table construction; linear-time ΔM table generation method; local address generation; virtual-block scheme; Automata; Computer science; Distributed computing; Equations; Laboratories; Parallel languages; Parallel processing; Runtime; Systems engineering and theory; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
  • Conference_Location
    Melbourne, Vic.
  • Print_ISBN
    0-7803-4229-1
  • Type

    conf

  • DOI
    10.1109/ICAPP.1997.651507
  • Filename
    651507