A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
priority queues. ... The construction is very simple, essentially just placing a non-meldable priority queue at each node of a union-find data structure. ... We also presented a second transformation that speeds up the operations of meldable priority queues when the range of the possible keys is small. ...doi:10.1007/978-3-540-27810-8_20 fatcat:qv3yicinlrfxlmiombp5gmhkdm
priority queues. ... The construction is very simple, essentially just placing a non-meldable priority queue at each node of a union-find data structure. ... We also presented a second transformation that speeds up the operations of meldable priority queues when the range of the possible keys is small. ...doi:10.1145/1198513.1198517 fatcat:ox4auyefabcivepe4cnnoa33ma
The Annals of Mathematical Statistics
PRIORITY QUEUES 93 where W, is the Laplace-Stieltjes transform of Fy», . ... a priority item. ...
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. ... With the first transformation we obtain a double-ended priority queue which guarantees the worst-case cost of O(1) for find-min, find-max, insert, extract; and the worst-case cost of O(lg n) with at most ... Both our data-structural transformations require that the priority queues used support extract, which extracts an unspecified element from the given priority queue and returns a locator to that element ...doi:10.1007/s00607-008-0019-2 fatcat:tym6ges4yjgpzoa3a5wxtw5kdu
Kendall for the single class queue can be applied to derive the Laplace-Stieltjes transform of the steady state waiting time distribution for a priority item in a head-of-the-line priority queue (K = 2 ... In addition, Kesten and Runnenburg have derived a characterization for the transform of the steady state waiting time distribution of any type j item for a priority queue with general K. ...doi:10.1214/aoms/1177705990 fatcat:7bskztkquzce5mvhvtqhqx34mi
A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. ... We derive properties of this relation and use it to describe systems of priority queues in series. ... Consider a computation which transforms a into r with a priority queue of capacity k. Let j be any integer in 0,l , . . . , r and let p = ~~=, ti. ...doi:10.1016/s0304-3975(96)00149-1 fatcat:jngk62k4dbfh3o2czhasokeoru
Reference to this paper should be made as follows: Toke, I.M. (2014) 'On completion times in a two-class priority queue with impatience', Int. ... In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave ... his priority queue. ...doi:10.1504/ijmor.2014.060855 fatcat:v5zdtpr5yfgxjnromqbchkkqse
running time offindMintoO(1) by adding a global root to hold the minimum element; and finally, we reduce the running time ofmeldtoO(1) by allowing priority queues to contain other priority queues. ... These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt Brodal's data structure to a purely functional setting. ... Then, to meld two priority queues, we simply insert one priority queue into the other. As in the previous section, we describe bootstrapping as a modulelevel transformation on priority queues. ...doi:10.1017/s095679680000201x fatcat:bcluocodrrcmhn6j255l7egave
BRICS Report Series
the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain other<br />priority ... These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt<br />Brodal's data structure to a purely functional setting. ... Then, to meld two priority queues, we simply insert one priority queue into the other. As in the previous section, we describe bootstrapping as a modulelevel transformation on priority queues. ...doi:10.7146/brics.v3i37.20019 fatcat:ebvsdo4zxngnhbhooruumouffe
Some allowable sets with small bases are considered including the one defined by a priority queue machine. ... For more complex machines defined by two or more priority queues in series or parallel, the basis is proved to be infinite. ... Now, by induction, there is a sequence of priority queue operations that can transform 1 2 into 1 2 . ...doi:10.1016/j.tcs.2005.07.039 fatcat:6j63fa5f7vfvfcjll6fjdbcx6m
IBM Systems Journal
Queues in series with feedback Multiple queues® First-come first- served; priority queues (polling messages have higher priority) Priority queues (output mes- sages have a higher priority) Industry operation ... priority queuing system or in a cascaded queuing system (queues in series). ...doi:10.1147/sj.91.0036 fatcat:57kdsnuhhzhurkqv26ryxjqlxi
To address this limitation, we propose a systematic approach to construct priority-aware analytical performance models using micro-architecture specifications and input traffic. ... Our approach decomposes the given NoC into individual queues with modified service time to enable accurate and scalable latency computations. ... Hence, there is a need for a new transformation that can address the split at the low-priority queue. ...arXiv:1908.02408v2 fatcat:3jyhnksu2vcc3inpfel3a7nt3y
The busy period in a priority queue. J. Math. Sci. 9 (1974), 57-62 (1976). Authors’ summary: “We consider the queue with two classes of customers called the priority and nonpriority customers. ... Finally the busy period density function for an ordinary queue (without priority) is obtained as a particular case.” GeSev, A. A.; Rohas, V. ...
The authors consider a priority queueing system whose arrivals form r mutually independent Poisson priority flows. ... They obtain expressions for the Laplace transform of the generating function of the joint probability distribution of the number of priority and non-priority units in the queue at time ¢, and the number ...
The latter expression is used to give a new derivation of the transform of the limiting waiting time distribution in the Gi/G/i queue. ... The Laplace transform (with respect to time) of the joint generating function of the numbers of priority and non- priority customers in the system is determined together with the Laplace transforms of ...
« Previous Showing results 1 — 15 out of 33,496 results