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 Priority Queue and Graph Algorithm Applications
 

Summary: Cache-Oblivious Priority Queue and
Graph Algorithm Applications 
Lars Arge y Michael A. Bender z Erik D. Demaine x
Dept. of Computer Science Dept. of Computer Science Lab. for Computer Science
Duke University SUNY Stony Brook MIT
large@cs.duke.edu bender@cs.sunysb.edu edemaine@mit.edu
Bryan Holland-Minkley { J. Ian Munro k
Dept. of Computer Science Dept. of Computer Science
Duke University University of Waterloo
bhm@cs.duke.edu imunro@uwaterloo.ca
Submitted to SIAM Journal on Computing
May 16, 2003
Abstract
We develop an optimal cache-oblivious priority queue data structure, supporting insertion,
deletion, and deletemin operations in O( 1
B log M=B
N
B ) amortized memory transfers, where M
and B are the memory and block transfer sizes of any two consecutive levels of a multilevel
memory hierarchy. In a cache-oblivious data structure, M and B are not used in the description

  

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

 

Collections: Computer Technologies and Information Sciences