Top Qs
Timeline
Chat
Perspective
FINO
Humorous scheduling algorithm "First In, Nothing Out" From Wikipedia, the free encyclopedia
Remove ads
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.
 | This article relies largely or entirely on a single source. (November 2021) |
| This article needs additional citations for verification. (November 2021) |
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]
The first mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.[2][3]
Remove ads
See also
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads