Skip to main navigation Skip to search Skip to main content

PARTI procedures for realistic loops

  • J. Saltz
  • , R. Das
  • , R. Ponnusamy
  • , D. Mavriplis
  • , H. Berryman
  • , J. Wu
  • NASA Langley Research Center

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured problems on distributed memory machines. These primitives have been incorporated into actual programs and kernels by hand. The development of the primitives were done such that the sequential code and the parallel code on each node would look identical. We have introduced a mechanism by which duplicate fetches of off-processor data between different loops are eliminated. This elimination of duplicate fetches appears to make a considerable impact on communications overheads.

Original languageEnglish
Title of host publication6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings
EditorsQuentin Stout, Michael Wolfe
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages67-74
Number of pages8
ISBN (Electronic)0818622903, 9780818622908
DOIs
StatePublished - 1991
Event6th Distributed Memory Computing Conference, DMCC 1991 - Portland, United States
Duration: Apr 28 1991May 1 1991

Publication series

Name6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings

Conference

Conference6th Distributed Memory Computing Conference, DMCC 1991
Country/TerritoryUnited States
CityPortland
Period04/28/9105/1/91

Fingerprint

Dive into the research topics of 'PARTI procedures for realistic loops'. Together they form a unique fingerprint.

Cite this