Optimization of out-of-core computations using chain vectors

M. Kandemir, J. Ramanujam, A. Choudhary

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

Abstract

Over the last decade, processor speed has become significantly higher than memory and disk speeds. Therefore, exploiting the memory hierarchy has emerged as a key problem in parallel computing. An out-of-core computation is one which operates on disk-resident data. This paper uses the concept of chain vectors for tiling out-of-core codes. The theory of chain vectors is discussed and extended, and their relation to reuse vectors is established. Then, chain vectors are used to optimize the tile size, shape, allocation and scheduling for out-of-core codes.

Original languageEnglish (US)
Title of host publicationEuro-Par 1997 Parallel Processing - Third International Conference, Proceedings
PublisherSpringer Verlag
Pages601-608
Number of pages8
ISBN (Print)9783540634409
DOIs
StatePublished - 1997
Event3rd International Conference on Parallel Processing, Euro-Par 1997 - Passau, Germany
Duration: Aug 26 1997Aug 29 1997

Publication series

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

Other

Other3rd International Conference on Parallel Processing, Euro-Par 1997
Country/TerritoryGermany
CityPassau
Period8/26/978/29/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Optimization of out-of-core computations using chain vectors'. Together they form a unique fingerprint.

Cite this