Sciweavers

192 search results - page 18 / 39
» On priority queues with priority jumps
Sort
View
SPIN
2007
Springer
15 years 3 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
SIGCSE
1999
ACM
179views Education» more  SIGCSE 1999»
15 years 2 months ago
Hospital emergency room simulation: object oriented design issues for CS2
This paper describes a project suitable for students in CS2 that combines the classical implementation of basic data structures (priority queues, lists, arrays) with the design an...
Viera K. Proulx
INFOCOM
1997
IEEE
15 years 1 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
73
Voted
IFIP
1997
Springer
15 years 1 months ago
Waiting time distributions in a two-queue model with mixed exhaustive and gated-type K-limited services
We deal with a two-queue model with mixed exhaustive and gated-type K-limited services. This model can achieve various degrees of priority in each queue by varying the value of K....
Toshihisa Ozawa
IRI
2008
IEEE
15 years 4 months ago
AMSQM: Adaptive multiple super-page queue management
Super-Pages have been wandering around for more than a decade. There are some particular operating systems that support Super-Paging and there are some recent research papers that...
Moshe Itshak, Yair Wiseman