FIFO

First In - First Out (English in order), often abbreviated as FIFO, synonymous with. " First come, first served" or FCFS (English First come, first served. ), Refers to any method of storage, at where those elements that were first saved, also first be removed from memory. Such a data structure is also referred to as (waiting ) queue. Other principles are the " last-in - first-out " method ( LIFO, stack ), the " Highest in - first out " method ( HIFO ), wherein the member is first removed, which has the highest value and "Lowest in - first out "method ( LOFO ), in which first the least significant element is removed.

In the context of accounting, there are also two other species in the consumption of inventory, namely the KIFO (Group In - First Out) and the KILO (Group In - Last Out ). They say that the knowledge acquired by Group companies Objects are first or last consumed or sold.

ERP

In the area of ​​inventory management FIFO is standard procedure because the - as seen from the perspective of period end - the oldest ( first stored ) stocks should also be consumed if possible first. During the storage of bulk materials, the FIFO principle is only approximately satisfied by a silo. Goods with a date of minimum durability or use-by date are usually after FEFO method ( First Expired - First Out) outsourced. For non-perishable bulk materials, however, the more cost-effective storage in Halden is applied, which can be removed only from the top again, and thus were considered according to the LIFO method. The difference between the two methods is particularly relevant for inventory valuation. Commercial law, both the FIFO and the LIFO method of accounting permitted ( § 256 sentence 1 HGB). However, since only LIFO may be used for tax purposes (§ 6 paragraph 1 No. 2 Income Tax Act), this method is used in practice.

Is distinguished from the ERP Managerial Accounting. Here FIFO means the recording of goods receipts at historical cost and the evaluation of the bearing value not based on average costs ( average cost × old stock actual cost × adventitious inventory / total stock ), but according to the actual cost of the oldest not yet used goods access.

Computer science

In computer science, called First In - First Out a special way to store and retrieve data again. The queue ( engl. queue) in computer science is based on the FIFO principle. Elements are accessed in exactly the order in which they were previously stored. In the area of operating systems, data links, which are organized according to the FIFO principle, called Pipes.

A practical range in computer science, in which a FIFO is used, are controllers, in particular the serial interface ( RS232 port) on the PC. The buffered chip provides by a FIFO method, that the first incoming byte of the serial interface is first processed by software in the computer. Byte protocols (such as by a mouse ) remain so for ' reader ' (driver) as ' scribe ' ( mouse ) are linearly equivalent. This also applies to the keyboard buffer.

See also: FIFO anomaly

Production Technology

In the production engineering / production control FIFO is used to link together two processes. Link here means the succession process controls the predecessor process, are required without any ERP tools (Enterprise Resource Planning). Background is, as already mentioned in the definition, that those goods that are first stored in the feed, is also consumed first.

The storage of the goods, however, relates only to short periods. In general, the security of supply of the follow-up processes is ensured so that they suffer no standstill. Applied this system, if the delivery process executes faster cycle times, as the succession process and this also can not be linked directly to each other or if the delivery process for multiple products is needed.

FIFO implementation

Ensure / / access the types used. import java.util.List; import java.util.LinkedList;   public class FIFO {      private elements;      public FIFO () {      elements = new LinkedList (Of T );    }      public void enqueue (T element ) {      Append / / new element to the end of list      elements.add (element);    }      public T dequeue () {      / / Copy reference to the first list item      T first = elements.first ();      / / First list item from list delete ( subsequent elements " move up " )      elements.removeAt (0);        return first;    } } see also

  • " Come, first served "
  • " Warenwälzung "

Swell

  • Digital technology
  • Data structure
  • Accountancy
  • Logistics
327876
de