FINO

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. A similar one is "FISH", for first in, still here.

For other uses, see FINO (disambiguation).

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.

A mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.[1]

See also

References
  1. ""Signetics 25120 Data Sheet"" (PDF). Archived from the original (PDF) on March 17, 2006. Retrieved 2012-03-16. (alternate copy)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.