Sciweavers

191 search results - page 6 / 39
» Melding Priority Queues
Sort
View
QUESTA
2007
88views more  QUESTA 2007»
15 years 5 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
ORL
2006
55views more  ORL 2006»
15 years 5 months ago
Who should be given priority in a queue?
We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service disc...
Refael Hassin, Moshe Haviv
DM
1999
122views more  DM 1999»
15 years 5 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
INFOCOM
2000
IEEE
15 years 10 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
Ranjita Bhagwan, Bill Lin
163
Voted
ICALP
2007
Springer
15 years 12 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor