Cache Oblivious Algorithms Piyush Kumar Department of Computer Science State University of New York at Stony Brook Stony Brook, NY 11790, USA [email protected]http://www.compgeom.com/co-chap/ Abstract. The cache oblivious model is a simple and elegant model to design algorithms that perform well in hierarchical memory models ubiquitous on current systems. This model was first formulated in [22] and has since been a topic of intense research. Analyzing and designing algorithms and data structures in this model involves not only an asymp- totic analysis of the number of steps executed in terms of the input size, but also the movement of data optimally among the different levels ofthe memory hierarchy. This chapter is aimed as an introduction to the “ideal-cache” model of [22] and techniques used to design cache obliv- ious algo rithms. The chap ter also pres ents some experi ment al insi ghts and results. Part of this work was done while the author was visiting MPI-Saarbr¨ uck en. The author is partially supported by NSF (CCR-9732220, CCR-0098172) and by a grant from Sandia National Labs.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.