Sciweavers

191 search results - page 3 / 39
» Melding Priority Queues
Sort
View
PE
2002
Springer
207views Optimization» more  PE 2002»
14 years 9 months ago
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-tim...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
ICFP
2001
ACM
15 years 9 months ago
A Simple Implementation Technique for Priority Search Queues
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
Ralf Hinze
QUESTA
2006
115views more  QUESTA 2006»
14 years 9 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia
PAMI
2002
154views more  PAMI 2002»
14 years 9 months ago
A Comparison of Algorithms for Connected Set Openings and Closings
Arnold Meijster, Michael H. F. Wilkinson
TON
2010
176views more  TON 2010»
14 years 4 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten