Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract data typeAmortized analysisBareMetalBitstream

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Optimal energy management policies for energy harvesting sensor nodes
We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node… 
Highly Cited
2006
Highly Cited
2006
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a… 
Highly Cited
2002
Highly Cited
2002
An Informal Management Model for Diffserv Routers
This document proposes an informal management model of Differentiated Services (Diffserv) routers for use in their management and… 
Highly Cited
1999
Highly Cited
1999
The Effects of Trailer Scheduling on the Layout of Freight Terminals
Supervisors in a less-than-truckload freight terminal establish material flows inside the terminal by assigning incoming trailers… 
Highly Cited
1994
Highly Cited
1994
Stability, queue length, and delay of deterministic and stochastic queueing networks
We present two types of stability problems: 1) conditions for queueing networks that render bounded queue lengths and bounded… 
Highly Cited
1994
Highly Cited
1994
An Efficient Method for Computing Synaptic Conductances Based on a Kinetic Model of Receptor Binding
where gsyn is the synaptic conductance and to is the time of transmitter release. This function peaks at a value of l / e at t… 
Review
1987
Review
1987
Processor-sharing queues: Some progress in analysis
This paper reviews some recent results based on new techniques used in the analysis of main processor-sharing queueing systems… 
Highly Cited
1986
Highly Cited
1986
Deciding Which Queue to Join: Some Counterexamples
Consider a queueing system with two or more servers, each with its own queue with infinite capacity. Customers arrive according… 
Highly Cited
1985
Highly Cited
1985
Exact Results for Nonsymmetric Token Ring Systems
This paper derives exact results for a token ring system with exhaustive or gated service. There are N nodes on the ring and… 
Highly Cited
1975
Highly Cited
1975
Approximate Analysis of General Queuing Networks
An approximate iterative technique for the analysis of complex queuing networks with general service times is presented. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)