Treffer: Cache-oblivious algorithms and data structures

Title:
Cache-oblivious algorithms and data structures
Authors:
BRODAL, Gerth Stølting
Source:
Algorithms theorye (Humlebaek, 8-10 July 2004)Lecture notes in computer science. :3-13
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 73 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithmique, Algorithmics, Algorítmica, Antémémoire, Cache memory, Antememoria, Hiérarchie mémoire, Memory hierarchy, Jerarquía memoria, Mémoire accès direct, Random access memory, Memoria acceso directo, Remplacement, Replacement, Reemplazo, Spécification formelle, Formal specification, Especificación formal, Structure donnée, Data structure, Estructura datos, Terminologie, Terminology, Terminología
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
BRICS** Department of Computer Science, University of Aarhus, IT-parken, Abogade 34, 8200 Arhus, Denmark
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15993246
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15993246
Database:
PASCAL Archive

Weitere Informationen

Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms, Cache-oblivious algorithms are described as standard RAM algorithms with only one memory level, i.e. without any knowledge about memory hierarchies, but are analyzed in the two-level I/O model of Aggarwal and Vitter for an arbitrary memory and block size and an optimal off-line cache replacement strategy. The result are algorithms that automatically apply to multi-level memory hierarchies. This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al.