First In Never Out (FINO) scheduling is funny technique for handling data structures whereby the primary component is not processed or we say that none of the component is processed and all are held back permanently.
In applied science, FINO may be humorous programming scheduling algorithm as contradictory to traditional first in, first out (FIFO) and last in, first out (LIFO) algorithms.
This scheduling algorithm works in such way that all the process entered are being held back permanently or being blocked. No matter how many tasks are scheduled or how many tasks are there in the queue at any time, no task ever actually takes place
FINO was first mentioned in the Signetics 25120 write-only memory joke datasheet, which was American electronics manufacturer founded in 1961 specifically established to make integrated circuits, as humorous scheduling algorithm whereby the requests once entered in the queue will never be able to get processed.
Implementation of FINO :
Where is FINO used?
- In operating system, memory leak is type of resource leak that occurs when operating system incorrectly manages memory allocations in such way that memory which is no longer needed is not released. And stateful FINO queue is used to implement such memory leak.
- In write only memory (WOM) –
Write-only memory (WOM) is fictional computer memory, just opposite of read-only memory (ROM).Technically, WOM is memory device which can be written but never read.
In the earlier stages, there were no practical use for memory circuit to which data could only be written and can not be read and concept was several times used as pun or funny joke for failed memory device. Until the first use of Write Only Memory was given by Signetics in 1972. The incorporation Signetics published some write-only memory (WOM) theories and literature because results of indoor antic, which is usually referenced within industry, staple of software engineering lexicons and included in collections of best hoaxes.
- Bit bucket is also related to First In Never Out buffer and Write Only Memory. In computing science and technology, bit bucket is where all lost computerized data has gone, being lost in transmission, computer crash. All these datas are said to have gone to bit bucket, mysterious place on computer where lost data goes.
- FINO queue is used in black hole in computer networks also. In computer science and networking, black holes refer to virtual places in computer network where incoming and/or outgoing traffic is silently thrown away or dropped, without informing source that data did not reach its intended recipient and all of this, idea and implementation of black hole is based on FINO.
- Difference between First Come First Served (FCFS) and Longest Job First (LJF) CPU scheduling algorithms
- Difference between Priority scheduling and Shortest Job First (SJF) CPU scheduling
- Lottery Process Scheduling in Operating System
- Multiple-Processor Scheduling in Operating System
- List scheduling in Operating System
- Linear Scheduling Method in Operating System
- First Come, First Serve – CPU Scheduling | (Non-preemptive)
- Difference between First Come First Served (FCFS) and Round Robin (RR) Scheduling Algorithm
- Difference between Multi Level Queue Scheduling (MLQ) and First Come First Served (FCFS)
- Multilevel Feedback Queue Scheduling (MLFQ) CPU Scheduling
- Difference between Priority Scheduling and Round Robin (RR) CPU scheduling
- Difference between Multi Level Queue Scheduling (MLQ) and Priority Scheduling
- System Protection in Operating System
- User View Vs Hardware View Vs System View of Operating System
- System Programs in Operating System
- File System Implementation in Operating System
- Xv6 Operating System -adding a new system call
- Traps and System Calls in Operating System (OS)
- CPU Scheduling in Operating Systems
- Operating Systems | CPU Scheduling | Question 1
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.