Document Type
Conference Proceeding
Publication Date
1-1-1997
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.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
601
Last Page
608
Recommended Citation
Kandemir, M., Ramanujam, J., & Choudhary, A. (1997). Optimization of out-of-core computations using chain vectors. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1300 LNCS, 601-608. https://doi.org/10.1007/bfb0002789
