Sciweavers

341 search results - page 32 / 69
» queue 2006
Sort
View
JACM
2000
131views more  JACM 2000»
14 years 11 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
NETWORK
2007
145views more  NETWORK 2007»
14 years 10 months ago
Analysis of Shared Memory Priority Queues with Two Discard Levels
— Two rate SLAs become increasingly popular in today’s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additio...
Shlomi Bergida, Yuval Shavitt
INFOCOM
2006
IEEE
15 years 5 months ago
Oscillations with TCP-Like Flow Control in Networks of Queues
—We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the se...
Matthew Andrews, Aleksandrs Slivkins
MICRO
2006
IEEE
103views Hardware» more  MICRO 2006»
15 years 5 months ago
NoSQ: Store-Load Communication without a Store Queue
This paper presents NoSQ (short for No Store Queue), a microarchitecture that performs store-load communication without a store queue and without executing stores in the outof-ord...
Tingting Sha, Milo M. K. Martin, Amir Roth
QUESTA
2007
91views more  QUESTA 2007»
14 years 10 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands