Matches in DBpedia 2014 for { <http://dbpedia.org/resource/FINO> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- FINO abstract "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.".
- FINO wikiPageID "2005111".
- FINO wikiPageRevisionID "544035465".
- FINO hasPhotoCollection FINO.
- FINO subject Category:Computer_humor.
- FINO subject Category:Scheduling_algorithms.
- FINO type Abstraction100002137.
- FINO type Act100030358.
- FINO type Activity100407535.
- FINO type Algorithm105847438.
- FINO type Event100029378.
- FINO type Procedure101023820.
- FINO type PsychologicalFeature100023100.
- FINO type Rule105846932.
- FINO type SchedulingAlgorithms.
- FINO type YagoPermanentlyLocatedEntity.
- FINO comment "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.".
- FINO label "FINO".
- FINO label "First in, never out".
- FINO sameAs First_in,_never_out.
- FINO sameAs m.06df0p.
- FINO sameAs Q5425837.
- FINO sameAs Q5425837.
- FINO sameAs FINO.
- FINO wasDerivedFrom FINO?oldid=544035465.
- FINO isPrimaryTopicOf FINO.