This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources. Find sources: "FINO" – news · newspapers · books · scholar · JSTOR (November 2021)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "FINO" – news · newspapers · books · scholar · JSTOR (November 2021) (Learn how and when to remove this 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]

• Bit bucket
• Black hole (networking)
• Null route
• /dev/null
• Write-only memory

This computer science article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e