FINO
Template:Short description Script error: No such module "other uses".
Page Module:Message box/ambox.css has no content.
This article relies largely or entirely on a single source. (November 2021) |
Page Module:Message box/ambox.css has no content.
This article needs additional citations for verification. (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.[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.[3]
The first mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.[2][4]
See also
- Bit bucket
- Black hole (networking)
- Page Template:Mono/styles.css has no content./dev/null
- Write-only memory
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content."FINO - First In Never Out (accounting)". Acronym Finder. Retrieved 22 June 2022.
- ^ a b Page Module:Citation/CS1/styles.css has no content."First In Never Out (FINO) scheduling in Operating System". GeeksforGeeks. Retrieved 22 June 2022.
- ^ Page Module:Citation/CS1/styles.css has no content."First In Never Out (FINO) scheduling in Operating System". GeeksforGeeks. 2020-07-24. Retrieved 2025-12-03.
- ^ Page Module:Citation/CS1/styles.css has no content.""Signetics 25120 Data Sheet"" (PDF). Archived from the original (PDF) on March 17, 2006. Retrieved 2012-03-16. (alternate copy)
