Queue (abstract data type)

Known as: Amortized queue, Bounded queue, Real-time queue 
In computer science, a queue (/ˈkjuː/ KYEW) is a particular kind of abstract data type or collection in which the entities in the collection are kept… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its implementation requires that each node has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Concurrency libraries can facilitate the development of multi-threaded programs by providing concurrent implementations of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Find the secret to improve the quality of life by reading this markov chains gibbs fields monte carlo simulation and queues. This… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In shared-memory packet switches, buffer management schemes can improve overall loss performance, as well as fairness, by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Consider the following simple communication channel model: an error-free bit pipe leading to a buffer modeled by a single-server… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We define a new locking protocol that permits more concency than existing commutativity-based protocols. In addition, the… (More)
  • figure 4-2
  • figure 4-3
  • figure 4-5
  • figure 7.1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Consider a queue which serves traffic from a number of distinct sources and which is required to deliver a performance guarantee… (More)
Is this relevant?