Abstract

Introduction Priority Queues are widely used in many fields of computer science, i.e. in Dijkstra's algorithm, for time forward processing, job scheduling, event simulation and others. In internal memory there exist many priority queue implementations, i.e. k--ary heaps, Fibonacci heaps, radix heaps and many more. As the data input size is growing it becomes more and more important to study data structures in an external memory setting. In reality main memory is limited and the input range often exploits this limit. This leads to bad running times for internal memory priority queues due to bad paging behavior. The cost model for external memory algorithms is the I/O model of [9, 10]. In this model, B is used as the amount of block transfer between internal and external memory, M specifies the size of the internal memory, Previous Work In external memory, there are also many priority queue implementations like buffer tr

Citations