|
In computer science, FINO (Sometimes seen as "FISH", for First In, Still Here) 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. 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 Signetics 25120 write-only memory joke datasheet.〔 (alternate copy)〕 ==See also== * Bit bucket * Black hole (networking) * Null route * /dev/null * Write-only memory 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「FINO」の詳細全文を読む スポンサード リンク
|