Results 1  10
of
16
A Data Structure for Manipulating Priority Queues
, 1978
"... A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority. ..."
Abstract

Cited by 88 (1 self)
 Add to MetaCart
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.
DiscreteEvent Simulation on the BulkSynchronous Parallel Model
, 1998
"... The bulksynchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be efficiently supported by the B ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The bulksynchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be efficiently supported by the BSP model in practice. In this
On the Pending Event Set and Binary Tournaments
"... this paper we study the performance of the very first tournament based complete binary tree. We focus on discreteevent simulation and our results show that this unknown predecessor of heaps can be a more efficient alternative to the fastest pending event set implementations reported in the literatu ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
this paper we study the performance of the very first tournament based complete binary tree. We focus on discreteevent simulation and our results show that this unknown predecessor of heaps can be a more efficient alternative to the fastest pending event set implementations reported in the literature. We also extend the idea of binary tournaments to a (2; L)tournament structure which exhibits the property of delaying the processing of events with larger timestamps whilst it keeps similar theoretical performance bounds to the native (2; 1)structure or CBT. This property can be certainly useful in systems where many pending events are expected to be deleted or rescheduled during the simulation. 2 Tournament trees
Analysis for some parameters for random nodes in priority trees
 Discrete Mathematics and Theoretical Computer Science
, 2008
"... received, revised, accepted. Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we study the following parameters in sizen trees: depth of a rando ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
received, revised, accepted. Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we study the following parameters in sizen trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.
A Comparative Performance Analysis Of RealTime Priority Queues
, 2001
"... I would like to express my deep appreciation to my advisor, Dr. Baker without whose constant support and encouragement, this project would not have seen completion. His original ideas, comments and suggestions were invaluable to me at all times. I also wish to thank my committee members, Dr. Lacher ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
I would like to express my deep appreciation to my advisor, Dr. Baker without whose constant support and encouragement, this project would not have seen completion. His original ideas, comments and suggestions were invaluable to me at all times. I also wish to thank my committee members, Dr. Lacher and Dr. Van Engelen for spending their time and effort reviewing this report. I am grateful to Mr. Gaitros, who has been very helpful to me by lending me the resources needed to complete this work. My sincerest gratitude goes to my friends, peers and colleagues, Bharath Allam, Nikhil Iyer, and Nikhil Patel, who were constantly with me with their suggestions and support. I wish to thank Smita Bhatia for her immense patience and inexhaustible support, and my parents, Shaila and Jayprakash for bearing with me through this considerable length of time Last but not the least, a special thanks goes to Douglas Adams for helping me understand the concept of the Babel fish.
Analysis of insertion costs in priority trees ∗
, 2006
"... Priority trees are a data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we give a detailed averagecase analysis of insertion cost measures: we study the recursion depth and the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Priority trees are a data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we give a detailed averagecase analysis of insertion cost measures: we study the recursion depth and the number of key comparisons when inserting an element into a random sizen priority tree. For inserting a random element we obtain exact and asymptotic results for the expectation and the variance and can further show a central limit law of the parameters studied and for inserting an element with specified priority we can show exact and asymptotic results for the expectation of these quantities. 1
Average CaseAnalysis Of Priority Trees: A Structure For Priority Queue Administration
"... . Priority trees (ptrees) are a certain variety of binary trees of size n constructed from permutations of the numbers 1; : : : ; n. In this paper we analyse several parameters depending on n (the size) and j (a number between 1 and n), such as the length of the left path (connecting the root and t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
. Priority trees (ptrees) are a certain variety of binary trees of size n constructed from permutations of the numbers 1; : : : ; n. In this paper we analyse several parameters depending on n (the size) and j (a number between 1 and n), such as the length of the left path (connecting the root and the leftmost leaf), the height of node j (= distance from the root), the number of left edges on the path from the root to the node j, the number of descendants of node j, the number of key comparisons when inserting an element between j and j + 1, the number of key comparisons when cutting the ptrees into two ptrees, the number of nodes with 0, 1 or 2 children. Methodologically, recursions are set up according to a fundamental decomposition of the family A of ptrees (using auxiliary quantities B and C); using generating functions, they lead to systems of differential equations that can be solved explicitly with some efforts. The quantities of interest can then be identified as coefficie...
Ptree Structures and Event Horizon: Efficient EventSet Implementations
"... 1 Introduction In a discrete event simulation system an event (or future event) is a collection of actions that are scheduled to be executed in a specific simulation time called event time. In such a system events are kept in objects known as event notices and maintained in a data structure known as ..."
Abstract
 Add to MetaCart
(Show Context)
1 Introduction In a discrete event simulation system an event (or future event) is a collection of actions that are scheduled to be executed in a specific simulation time called event time. In such a system events are kept in objects known as event notices and maintained in a data structure known as event set. An event notice is represented by a record with two fields, t and a, where t is the scheduled time for its occurrence, and a is the activity which is scheduled in time t [3, 9, 12].
Analysis of some parameters for random
, 2006
"... Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we study the following parameters in sizen trees: depth of a random node, number of right edges ..."
Abstract
 Add to MetaCart
(Show Context)
Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1,..., n are equally likely to construct a priority tree of size n we study the following parameters in sizen trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.