G. Francon Jr., G. Viennot and J. Vuillemin, `Description and analysis of an efficient priority queue representation', 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, IEEE, Piscataway, N.J., 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....have a natural left to right order, corresponding to that on the d elements of D. The concept of representing a heap ordered linear list of items by exploiting the induced left to right order of the leaves in a normal heap ordered tree arises in the pagodas of Francon, Viennot, and Vuillemin [FVV78] Similar data structures are the Cartesian tree [Vui80] and the treap [AS89] These maintain one tree under both symmetric and heap orders (on two distinct keys per node) If the symmetrically ordered key represents the position of the node in a linear list, the data structure supports ....

J. Francon, G. Viennot, and J. Vuillemin. Description and analysis of an efficient priority queue representation. In Proc. 19th IEEE Symp. on Foundations of Computer Science, pages 1--7, 1978.

....the experiments here because Brown [11] has shown that heaps are slightly faster than binomial queues on the average and considerably faster in the worst case. These results were reopened and questioned in [6] where it was claimed that binomial queues are nearly optimal. 2. 8 Pagodas Pagodas [12], like leftist trees, are based on heap ordered binary trees. However, unlike leftist trees, in a Pagoda the primary pointers lead from the leaves of the tree towards the root. A secondary pointer in each item of the tree points downwards from that item to its otherwise unreachable leftmost or ....

Francon, J., G. Vienot, and J. Vuillemin. Description and Analysis of an Efficient Priority Queue Representation. in 19th Annual Symposium on Foundations of Computer Science. 1978. Ann Arbor, Michigan: IEEE, Piscataway, New Jersey.

....only referential since there are PQs which do not fit in one or other group) Some of the PQs suggested in the literature are the following, E mail: Mauricio.Marin comlab.oxford.ac. uk y Wolson Building, Parks Road, Oxford OX1 3QD, England, UK Trees: implicit heap [2, 6, 17, 16, 42] pagodas [10, 17], skew heap [36] pairing heap [13, 37] relaxed heap [9] fibonacci heap [14] binomial queue [4, 17, 41] binary priority queue [17] leftist tree [17, 24] splay tree [38] priority tree [17, 20] 2 3 tree [1] and binary search tree [17, 24] Lists: linear list [17, 24] two level structure ....

....a global priority queue is used to synchronise the logical processes being simulated in the physical processor) The two list method reduces this cost to O(N 0:5 ) 3] and its performance is good for N 200. Most of the tree based PQ implementations run with O(log 2 N) time per hold operation [4, 10, 21, 22, 29, 31, 36, 37, 38]. Structures as the skew heap, splay tree and pairing heap have O(log 2 N) amortised cost, whereas the binary search tree and pagoda have an O(N) worst case. Structures as the binomial queue, implicit heap and leftist tree have an O(log 2 N) worst case per hold operation [21] However, the ....

J. Francon, G. Viennot, and J. Vuillemin. "Description and analysis of an efficient priority queue representation". In 19th Annual Symposium on Foundations of Computer Science, pages 1--7, Ann Arbor, Mich., Oct. 78. IEEE Piscataway N.J.

....of Figure 1 uses an infinite number of buckets with 100 events. The simulation of Figure 2 uses the optimal bucket width for N = 1; 000 for the infinite bucket calendar queue, then varying the number of buckets. 1. 3 Related Results There are a large number of implementations of priorities queues [1, 5, 7, 9, 10, 11]. An interesting empirical comparison of eleven popular implementations is provided by Jones [6] Most of the popular implementations have expected time per event performance O(logN ) which can be excessive for discrete event simulation with very large N and a large number of simulation steps. ....

J. Francon, G Viennot, and J. Vuillemin. Description and Analysis of an efficient priority queue representation. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 1-7, 1978.

....calendar queue to achieve optimal or near optimal performance. In addition, a technique is given to calibrate a specific calendar queue implementation so that the formulas can be applied in a practical setting. 1. 1 Related Results There are a large number of implementations of priorities queues [1, 6, 8, 11, 12, 13]. An interesting empirical comparison of eleven popular implementations is provided by Jones [7] Most of the popular implementations have O(log N) expected time per event performance, which can be excessive for discrete event simulation with very large N and a large number of simulation steps. As ....

J. Francon, G Viennot, and J. Vuillemin. Description and Analysis of an efficient priority queue representation. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 1-7, 1978.

No context found.

G. Francon Jr., G. Viennot and J. Vuillemin, `Description and analysis of an efficient priority queue representation', 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, IEEE, Piscataway, N.J., 1978.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC