Show simple item record

An Interprocedural Framework for Placement of Asychronous I/O Operations

dc.contributor.authorAgrawal, Gaganen_US
dc.contributor.authorAcharya, Anuragen_US
dc.contributor.authorSaltz, Joelen_US
dc.date.accessioned2004-05-31T22:36:12Z
dc.date.available2004-05-31T22:36:12Z
dc.date.created1995-11en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/778
dc.description.abstractOverlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler technique for overlapping accesses to secondary memory (disks) with computation. We have developed an Interprocedural Balanced Code Placement (IBCP) framework, which performs analysis on arbitrary recursive procedures and arbitrary control flow and replaces synchronous I/O operations with a balanced pair of asynchronous operations. We demonstrate how this analysis is useful for applications which perform frequent and large accesses to secondary memory, including applications which snapshot or checkpoint their computations or out-of-core applications. (Also cross-referenced as UMIACS-TR-95-114)en_US
dc.format.extent299400 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3563en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-114en_US
dc.titleAn Interprocedural Framework for Placement of Asychronous I/O Operationsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record