Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cache-Oblivious Data Structures Duke University
 

Summary: 38
Cache-Oblivious Data Structures
Lars Arge
Duke University
Gerth Stølting Brodal
University of Aarhus
Rolf Fagerberg
University of Southern Denmark
38.1 The Cache-Oblivious Model ......................... 38-1
38.2 Fundamental Primitives .............................. 38-3
Van Emde Boas Layout · k-Merger
38.3 Dynamic B-Trees . ..................................... 38-8
Density Based · Exponential Tree Based
38.4 Priority Queues........................................ 38-12
Merge Based Priority Queue: Funnel Heap ·
Exponential Level Based Priority Queue
38.5 2d Orthogonal Range Searching..................... 38-21
Cache-Oblivious kd-Tree · Cache-Oblivious Range Tree
38.1 The Cache-Oblivious Model
The memory system of most modern computers consists of a hierarchy of memory levels,

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences