First-in-first-out (fifo), Operating System

FIFO is named as 'named pipes'. FIFO (first-in-first-out) is a special file which is laid to be data transient. Once data is load from named pipe, it cannot be load again. Also, data can be load only in the order written. It is used in interprocess interaction where a program writes to one end of the producer and the other loads from the consumer.

Make special files like device files and named pipes

The system call mknod makes special files in the giving sequence.

1.   kernel give new inode,

2.   sets the file type to locate that the file is a directory, pipe or special file,

3.   If it is a machine file, it creates the other entries like minor, major device numbers.

 

2268_FIFO.png

Posted Date: 7/28/2012 8:16:46 AM | Location : United States







Related Discussions:- First-in-first-out (fifo), Assignment Help, Ask Question on First-in-first-out (fifo), Get Answer, Expert's Help, First-in-first-out (fifo) Discussions

Write discussion on First-in-first-out (fifo)
Your posts are moderated
Related Questions
Write a short note on PCB? Every process is represented in the operating system by a process control block also called a task control block. It contains more information regard

Write pseudo code to implement the pthread_create wrapper of the Tern memoizer. Note you need to describe your data structure for maintaining deterministic thread IDs. In addition,

Explain the Real Time Operating System A real-time operating system comprises definite, fixed time constraints. Processing should be done in the defined constraints, or the sys

Now, let us discuss two related algorithms for deciding which pages to evict. The clock algorithm is one of the most popular choices. It works by keeping frames in a circular struc

Forking is an important phase of Unix, critical to the support of its design strategies, which encourages the implementation of filters. In Unix, a filter is a process that reads i

please help us to write a code in c for tree directory structures.

Operating Systems have evolved tremendously in the last few decades. The first approach for building Operating Systems, taken during the 40s through early 60s, was to allow only on

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Q. Consider a system that holds 5000 users. Presume that you want to allow 4990 of these users to be able to access one file. a. How would you denote this protection scheme in

The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re