I/O-conscious tiling for disk-resident data sets

Mahmut Kandemir, Alok Choudhary, J. Ramanujam

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

2 Scopus citations


This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due to the particular characteristics of I/O operations, straightforward extension of the traditional tiling method to I/O-intensive programs may result in poor I/O performance. Therefore, the technique proposed in this paper customizes iteration space tiling for high I/O performance. The generated code results in huge savings in the number of I/O calls as well as the data volume transferred between the disk subsystem and main memory.

Original languageEnglish (US)
Title of host publicationEuro-Par 1999 - Parallel Processing
Subtitle of host publication5th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540664432, 9783540664437
StatePublished - 1999
Event5th International Conference on Parallel Processing, Euro-Par 1999 - Toulouse, France
Duration: Aug 31 1999Sep 3 1999

Publication series

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


Other5th International Conference on Parallel Processing, Euro-Par 1999

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'I/O-conscious tiling for disk-resident data sets'. Together they form a unique fingerprint.

Cite this