Scalable software latency hiding schemes: Evaluation of the poststore and prefetch options

Chaitanya Tumuluri, Alok N. Choudhary

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Most latency hiding studies for Distributed Shared Memory (DSM) systems use prefetching, while few explore use of poststoring. This study develops, and compares performance gains obtained using, a runtime poststoring scheme (PST) and an application-specific prefetching scheme (PFH). The PST and PFH schemes produced scalable reductions in loop execution times.

Original languageEnglish (US)
Title of host publicationEuro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings
EditorsLuc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert
PublisherSpringer Verlag
Pages486-491
Number of pages6
ISBN (Print)3540616276, 9783540616276
StatePublished - Jan 1 1996
Event2nd International Euro-Par Conference on Parallel Processing, Euro-Par 1996 - Lyon, France
Duration: Aug 26 1996Aug 29 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1124
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Euro-Par Conference on Parallel Processing, Euro-Par 1996
CountryFrance
CityLyon
Period8/26/968/29/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Scalable software latency hiding schemes: Evaluation of the poststore and prefetch options'. Together they form a unique fingerprint.

Cite this