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
2007
Highly Cited
2007
A new framework to accelerate Virtex-II Pro dynamic partial self-reconfiguration
The Xilinx Virtex family of FPGAs provides the ability to perform partial run-time reconfiguration, also known as dynamic partial… 
2005
2005
On the effect of router buffer sizes on low-rate denial of service attacks
  • S. SaratA. Terzis
  • Proceedings. 14th International Conference on…
  • 2005
  • Corpus ID: 15655855
Router queues buffer packets during congestion epochs. A recent result by Appenzeller et al. showed that the size of FIFO queues… 
Highly Cited
2004
Highly Cited
2004
Applying scheduling techniques to minimize the number of late jobs in workflow systems
Ordering the cases in a workflow can result in significant decrease on the number of late jobs. But merging workflow and… 
Highly Cited
2001
Highly Cited
2001
Colif: A Design Representation for Application-Specific Multiprocessor SOCs
By separating component behavior and communication infrastructure and spanning multiple abstraction levels, Colif lets designers… 
Highly Cited
1998
Highly Cited
1998
A Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches
Highly Cited
1996
Highly Cited
1996
Packet network simulation: speedup and accuracy versus timing granularity
This paper describes a new technique that can speedup simulation of high-speed, wide-area packet networks by one to two orders of… 
Highly Cited
1993
Highly Cited
1993
Queuing spin lock algorithms to support timing predictability
  • Travis S. Craig
  • Proceedings Real-Time Systems Symposium
  • 1993
  • Corpus ID: 2059726
We introduce practical new algorithms for FIFO and priority-ordered spin locks on shared-memory multiprocessors with an atomic… 
Highly Cited
1989
Highly Cited
1989
Output-buffer switch architecture for asynchronous transfer mode
An asynchronous transfer mode (ATM) switch architecture for the broadband integrated services digital network (ISDN) is proposed… 
Highly Cited
1984
Highly Cited
1984
A Tool for Structured Functional Simulation
BLOSIM is a general purpose time-driven (as opposed to event-driven) simulation language. It is written in C language, and is… 
Highly Cited
1984
Highly Cited
1984
Synthesis of Communicating Finite-State Machines with Guaranteed Progress
We present a methodology to synthesize two communicating finite-state machines which exchange messages over two one-directional… 
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)