Skip to search formSkip to main contentSkip to account menu

FIFO (computing and electronics)

Known as: Last in, last out, FCFS (computing), First-in, first out 
FIFO is an acronym for first in, first out, a method for organizing and manipulating a data buffer, where the oldest (first) entry, or 'head' of the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
8250 UARTActor modelAmortized analysisAnonymous pipe

Broader (1)

Inter-process communication

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
Controlling high-bandwidth flows at the congested router
FIFO queueing is simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end… 
Highly Cited
2001
Highly Cited
2001
The war between mice and elephants
  • Liang GuoI. Matta
  • Proceedings Ninth International Conference on…
  • 2001
  • Corpus ID: 6150355
Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they… 
Highly Cited
1998
Highly Cited
1998
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for… 
Highly Cited
1997
Highly Cited
1997
The effects of asymmetry on TCP performance
In this paper, we study the effects of network asymmetry on end‐to‐end TCP performance and suggest techniques to improve it. The… 
Highly Cited
1994
Highly Cited
1994
Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants
The problem of reducing the mean and variance of cycle time in semiconductor manufacturing plants is addressed. Such plants… 
Highly Cited
1993
Highly Cited
1993
Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation
This paper presents snapshot algorithms for determining a consistent global state of a distributed system without significantly… 
Highly Cited
1988
Highly Cited
1988
Queueing in high-performance packet switching
The authors study the performance of four different approaches for providing the queuing necessary to smooth fluctuations in… 
Highly Cited
1988
Highly Cited
1988
High-performance multi-queue buffers for VLSI communications switches
Small nxn switches are key components of multistage interconnection networks used in multiprocessors as well as in the… 
Highly Cited
1987
Highly Cited
1987
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching
A new, high-performance packet-switching architecture, called the Knockout Switch, is proposed. The Knockout Switch uses a fully… 
Highly Cited
1987
Highly Cited
1987
OR Forum - Perspectives on Queues: Social Justice and the Psychology of Queueing
Queues involve waiting, to be sure, but one's attitudes toward queues may be influenced more strongly by other factors. For… 
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)