FINO

{{short description|Humorous scheduling algorithm "First In, Nothing Out"}}

{{otheruses}}

{{Single source|date=November 2021}}

{{Additional citations|date=November 2021}}

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.{{Cite web|url=https://www.acronymfinder.com/First-In-Never-Out-(accounting)-(FINO).html|website=Acronym Finder|title=FINO - First In Never Out (accounting)|access-date=22 June 2022}}{{Cite web|url=https://www.geeksforgeeks.org/first-in-never-out-fino-scheduling-in-operating-system/|title=First In Never Out (FINO) scheduling in Operating System|website=GeeksforGeeks|access-date=22 June 2022}} 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.{{citation needed|date=November 2021}}

The first mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.{{cite web |url=http://www.national.com/rap/files/datasheet.pdf |title="Signetics 25120 Data Sheet" |accessdate=2012-03-16 |url-status=dead |archiveurl=https://web.archive.org/web/20060317085650/http://www.national.com/rap/files/datasheet.pdf |archivedate=March 17, 2006 }} (alternate copy)