10 likes | 119 Views
. Erik D. Demaine MIT. Gerth Stølting Brodal Aarhus University. s ize- x input buffer. √ N. …. Upper level: at most x 1/2 /4 subboxes. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. √ x -box. N. …. s ize- x 3/2 middle buffer. √ N. ….
E N D
... Erik D. Demaine MIT GerthStølting Brodal Aarhus University size-xinput buffer √N … Upper level: at mostx1/2/4subboxes Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs √x-box N … size-x3/2middle buffer √N … Lower level: at mostx/4subboxes √x-box B Memory layout Slow memory 14 N √N size-x2output buffer Fast memory CPU 28 [Prokop 1999] Block 5 16 22 4 19 M/B 13 27 3 7 18 … … 2 input middle output 10 24 17 Subboxesstored contiguously in arbitrary order Unused (currently empty) subboxes are preallocated Binary search tree log2B log2N Recursive memory layout B … Search path [Brodal, Demaine, Iacono, Fineman, Langerrman, Munro 2010] x-box MADALGO – Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation