Worst-Case Optimal Tree Layout in External Memory
Name
Demaine_Worst-case.pdf
Size
229.46 KB
Format
Adobe PDF
Checksum (MD5)
2addff06a1d3df52fead07c13e9a31b2
Author(s)
Demaine, Erik D.
Iacono, John
Langerman, Stefan
Date Issued
January 2014
Journal
Algorithmica
Publisher
Springer-Verlag
Citation
Demaine, Erik D., John Iacono, and Stefan Langerman. “Worst-Case Optimal Tree Layout in External Memory.” Algorithmica (January 15, 2014).
Version
Author's final manuscript
Abstract
Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is Θ([D over lg(1+B))] when D = O(lgN), Θ([lgN over lg(1+[BlgN over D])]) when D=Ω(lgN) and D=O(BlgN), Θ([D over B]) ,when D=Ω(BlgN).
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00453-013-9856-2
