If we talk of queuing system of operating system you might have given some thought to it some time but queuing system follows following phases–
• First-in, First-out (FIFO): Service is provided on the first come, first served basis.
• Random: Arrivals of customers is completely random but at a certain arrival rate.
• Steady state: The queuing system is at a steady state condition.
The above conditions are very ideal conditions for any queuing system and assumptions are made to model the situation mathematically.
First condition only means irrespective of customer, one who comes first is attended first and no priority is given to anyone.
Second conditions says that arrival of a customer is random and is expected anytime after the elapse of first mean time of interval (τ say). In a given interval of time (called mean time of arrival τ, between two customers) only one customer is expected to come. This is equivalent to saying that the number of arrivals per unit time is a random variable with a Poisson’s distribution.
This distribution is used when chances of occurrence of an event out of a large sample is small.
Click here for government certification in Information Technology
7 Comments. Leave new
Well explained!!!
Good work 😉
Good explanation.. easy to understand for those who are out of technology studies.. well done
Very well explained 😀
It refreshed my FIFO LIFO concept while I studied DATA structures and the concept of queue and stack 😀
OS also work in this way 😀
very well explained 😀
You should have explained more 😀 as its a bit interesting and informative for everyone 😀
Good work 😀
well explained
Nice work!
These are some of the basicsthat one has to learn for programming in C. Great work