Sciweavers

192 search results - page 2 / 39
» On priority queues with priority jumps
Sort
View
INFOCOM
1993
IEEE
14 years 3 months ago
Rate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
Hui Zhang, Domenico Ferrari
PE
2002
Springer
207views Optimization» more  PE 2002»
13 years 10 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
14 years 10 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»
13 years 10 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»
13 years 10 months ago
A Comparison of Algorithms for Connected Set Openings and Closings
Arnold Meijster, Michael H. F. Wilkinson