FINO

From Wikipedia, the free encyclopedia
Revision as of 20:34, 4 April 2025 by imported>Wikimpan (→See also: Removing duplicate (Null route is now a redirect to Black hole (networking)))
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Otheruses Template:Single source Template:Additional citations In computer science, FINO is a humorous scheduling algorithm. It is an acronym for first in, never out as opposed to traditional first in, first out (FIFO) and last in, first out (LIFO) algorithms.[1][2] A similar acronym is "FISH", for first in, still here.

FINO works by withholding all scheduled tasks permanently. No matter how many tasks are scheduled at any time, no task ever actually takes place.

A stateful FINO queue can be used to implement a memory leak.Script error: No such module "Unsubst".

The first mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.[2][3]

See also

References

Template:Reflist

Template:Asbox

  1. ↑ Script error: No such module "citation/CS1".
  2. ↑ a b Script error: No such module "citation/CS1".
  3. ↑ Script error: No such module "citation/CS1". (alternate copy)
Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=FINO&oldid=1449108"