First In Never Out (FINO) scheduling in Operating System

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 :



filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to demonstrate working of FINO
// using Queue interface in C++
  
#include <bits/stdc++.h>
using namespace std;
int main()
{
    queue<int> q;
    int t
            cin
        >> t;
    for (int x = 0; x < t; x++)
        q.push(x);
    return 0;
}

chevron_right


Where is FINO used?