Efficient uniform run-time scheme for mixed regular-irregular applications

Dhruva R. Chakrabarti*, Nagaraj Shenoy, Alok Choudhary, Prithviraj Banerjee

*Corresponding author for this work

Research output: Contribution to conferencePaper

9 Scopus citations

Abstract

Almost all applications containing indirect array addressing (irregular accesses) have a substantial number of direct array accesses (regular accesses) too. A conspicuous percentage of these direct array accesses usually require interprocessor communication for the applications to run on a distributed memory multicomputer. This study highlights how lack of a uniform representation and lack of a uniform scheme to generate communication structures and parallel code for regular and irregular accesses in a mixed regular-irregular application prevent sophisticated optimizations. Furthermore, we also show that code generated for regular accesses using compile-time schemes are not always compatible to code generated for irregular accesses using run-time schemes. In our opinion, existing schemes handling mixed regular-irregular applications either incur unnecessary preprocessing costs or fail to perform the best communication optimization. This study presents a uniform scheme to handle both regular and irregular accesses in a mixed regular-irregular application. While this allows for sophisticated communication optimizations such as message coalescing, message aggregation to be made across regular and irregular accesses, the preprocessing costs incurred are likely to be minimum. Experimental comparisons for various benchmarks on a 16-processor IBM SP-2 show that our scheme is feasible and better than existing schemes.

Original languageEnglish (US)
Pages61-68
Number of pages8
StatePublished - Jan 1 1998
EventProceedings of the 1998 International Conference on Supercomputing - Melbourne, Aust
Duration: Jul 13 1998Jul 17 1998

Other

OtherProceedings of the 1998 International Conference on Supercomputing
CityMelbourne, Aust
Period7/13/987/17/98

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient uniform run-time scheme for mixed regular-irregular applications'. Together they form a unique fingerprint.

  • Cite this

    Chakrabarti, D. R., Shenoy, N., Choudhary, A., & Banerjee, P. (1998). Efficient uniform run-time scheme for mixed regular-irregular applications. 61-68. Paper presented at Proceedings of the 1998 International Conference on Supercomputing, Melbourne, Aust, .