Document Type
Conference Proceeding
Publication Date
1-1-1999
Abstract
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. © Springer-Verlag Berlin Heidelberg 1999.
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
430
Last Page
439
Recommended Citation
Kandemir, M., Choudhary, A., & Ramanujam, J. (1999). I/O-conscious tiling for disk-resident data sets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1685 LNCS, 430-439. https://doi.org/10.1007/3-540-48311-x_57