Fino
From Handwiki Short description: Humorous scheduling algorithm "First In, Nothing Out"
 | This article needs additional citations for verification. (November 2021) (Learn how and when to remove this template message) |
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.[citation needed]
The first mention of FINO appears in the Signetics 25120 write-only memory joke datasheet.[2][3]
See also
- Bit bucket
- Black hole (networking)
- Null route
- /dev/null
- Write-only memory
References
- ↑ "FINO - First In Never Out (accounting)". https://www.acronymfinder.com/First-In-Never-Out-(accounting)-(FINO).html.
- ↑ 2.0 2.1 "First In Never Out (FINO) scheduling in Operating System". https://www.geeksforgeeks.org/first-in-never-out-fino-scheduling-in-operating-system/.
- ↑ ""Signetics 25120 Data Sheet"". Archived from the original on March 17, 2006. https://web.archive.org/web/20060317085650/http://www.national.com/rap/files/datasheet.pdf. Retrieved 2012-03-16. (alternate copy)
 |  |
Categories: [Scheduling algorithms]
↧ Download as ZWI file | Last modified: 03/14/2024 07:56:43 | 3 views
☰ Source: https://handwiki.org/wiki/FINO | License: CC BY-SA 3.0
✘
ZWI is not signed. [what is this?]
ZWI viewer
by the 
KSF
KSF