Sciweavers

191 search results - page 14 / 39
» Melding Priority Queues
Sort
View
IPCCC
2007
IEEE
15 years 4 months ago
Adaptive Probabilistic Scheduling for a Cellular Emergency Network
Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexi...
Jiazhen Zhou, C. Beard
PE
2011
Springer
321views Optimization» more  PE 2011»
14 years 4 months ago
Quasi-birth-and-death processes with restricted transitions and its applications
In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subs...
Juan F. Pérez, Benny Van Houdt
WSC
2007
15 years 6 days ago
Modeling the performance of low latency queueing for emergency telecommunications
Event simulation and analytic modeling are used to evaluate the performance of Low Latency Queueing (LLQ), a queueing discipline available in some Internet packet switching router...
Denise M. Bevilacqua Masi, Martin J. Fischer, Davi...
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
15 years 11 months ago
A Novel Deadline Driven Disk Scheduling Algorithm for Multi-Priority Multimedia Objects
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...
Ibrahim Kamel, T. Niranjan, Shahram Ghandeharizade...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 4 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch