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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1960-2017
010020019602017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this paper, we describe ZooKeeper, a service for coordinating processes of distributed applications. Since ZooKeeper is part… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
ÐWe consider the following natural model: Customers arrive as a Poisson stream of rate n, < 1, at a collection of n servers. Each… (More)
  • figure 1
  • table 2
  • table 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
h increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper examines the performance of TCP/IP, the Internet data transport protocol, over wide-area networks (WANs) in which data… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as non-adaptive… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract —It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present a simple algorithm for emulating an N processor CRCW PRAM on an N node butterfly. Each step of the PRAM is emulated in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Process scheduling in real-time systems has almost invariably used one or more of three algorithms: fixed priority, FIFO, or… (More)
  • figure 2-1
  • figure 2-2
  • figure 3.1
  • figure 3-3
  • figure 3-4
Is this relevant?
Highly Cited
1974
Highly Cited
1974
In this paper, we describe a simple language for parallel programming. Its semantics is studied thoroughly. The desirable… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?