341 search results - page 32 / 69 » queue 2006 |
175
click to vote
JACM
2000
15 years 6 months ago
2000
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...
165
click to vote
NETWORK
2007
15 years 6 months ago
2007
— 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...
162
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
—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...
156
Voted
MICRO
2006
IEEE
16 years 14 days ago
2006
IEEE
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...
149
click to vote
QUESTA
2007
15 years 6 months ago
2007
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, ...