CACHE AMICAILITY OF ADVANCED AMORTIZED PRIORITY

QUEUES

Student Name:
Venkatkumar S
REG NO:
2015207006
Name of the Guide:Dr.K.S.Easwarakumar

SIGNATURE

INTRODUCTION
The Dual-Pivot Quicksort by Vladimir Yaroslavskiy, Jon Bentley and Joshua Bloch
contrary to prior intuition, outperformed standard quicksort by a a signicant margin
under the Java JVM.Strong evidence that cache behavior is causing most of the
performance differences in these algorithms have been found.
This study can be extended to the most abundantly used data structure,priority queues.
Priority Queues,both amortized and non-amortized are widely used in almost all graph
and network algorithms. Amortized Data structures provide better performance
theoretically in contrast with their non-amortized counterparts.The prescence of cache
shall influence their performance similar to that of the Dual-Pivot Quicksort,2009.
Hence,it is discerning to perform cache profiling upon amortized priority queues.

LITERATURE SURVERY

Fibonacci Heaps Revisited,2014:Haim Kaplan, Robert Endre Tarjan, Uri Zwick.

The fibonacci heap is a classic data structure that supports all priority queue ADT
operations except Decreasekey in O(lgn) amortized cost.The amortized cost of
Decrease-key isO(1).
In this paper three major improvements over the original are proposed:
1)Each heap is represented by a single heap-orderd tree,instead of set of trees
2)Each decrease-key operation does only one cut and a cascade of rank changes,
instead of doing a cascade of cuts.
3)The outcomes of all comparisons done by the algorithm are explicitly represented
in the data structure, so none are wasted.
All these improvements fail to provide better theoretical bounds in amortized
scale.But there is a room for improvement in practical efficiency due to decrease
in pointer exchanges.
Hollow Heaps,2015:Thomas Dueholm Hansen,Haim Kaplan,Robert E. Tarjan
Uri Zwick
Hollow Heaps achieve same amortized efficiency as that of the classical
fibonacci heaps.There are three versions of Hollow heaps:
1)Single parent multiple root Hollow heaps
2)Single parent single root Hollow heaps
3)Two parent Hollow heaps
Hollow heaps use Directed Acyclic graphs (DAG) to maintain heap property
instead of maintaining forests.The deletion and decrease key operations
are performed lazily.

DETAILED BLOCK DIAGRAM

EVALUATION METRICS
Evaluation metrics are of two-fold in nature for data structures,viz,theoratical and
experimental.Theoretically amortized data structures are analysed using potential
method.Practically cache profiling is performed.These empirical results would provide
more insight into the performance and various influencing factors contributing
to their behaviour pactically.

TEST CASES

Insertion:

1,0,-78,547,36654,100007..

Deletion:

Key of node to be deleted

Decrease key:Key of node to be decreased

Meld:

Minimum pointers of two heaps

REFERENCES

1. Shrinu Kushagra, Alejandro Lpez-Ortiz, J. Ian Munro and Aurick Qiao.Multi-Pivot

Quicksort:Theory and Experiments. Proceedings of the 16th Meeting on Algorithm
Engineering and Experiments (ALENEX), pp. 47-60, 2014
2. J. Iacono and O. Ozkan. Why some heaps support constant-amortized-time
decrease-key operations, and others do not. In Proc. of 41 st ICALP, pages 637649,
2014
3.Naor, D.; Martel, C. U.; Matloff, N. S. (1991), "Performance of priority queue structures
in a virtual memory environment", Computer Journal, 34 (5): 428437
4. Introduction to Algorithms,CLRS,MIT press