In computer science, FINO is a jocular 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.
FINO works by withholding all scheduled tasks permanently. No matter how many tasks are scheduled at any time, no task ever actually takes place. This makes FINO extremely simple to implement, but useless in practice. A stateful FINO queue can be used to implement a memory leak.
A mention of FINO appears in the Official Signetics 25120 write only memory datasheet.
/dev/null is an example of a (stateless) FINO.
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
