Fork system call in unix, Operating System

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 its input from stdin, and gives its output to stdout. A pipeline of these instructions can be strung together by a shell to make new commands. i.e:, one may string together the output of thefind(1) instruction and the input of the wc(1) instruction to prepare a new command that will give a count of files ending in ".cpp" found in the current file system and any subdirectories, as follows:

$ find . -name "*.cpp" -print | wc -l

More usually, forking is also operated by the shell each time a user issues an instruction. A child process is prepared by forking the shell, and the child process is shown, once again by exec, with the code included with the program to be run.

 

 

2444_Fork system call in unix.png

Posted Date: 7/28/2012 8:27:25 AM | Location : United States







Related Discussions:- Fork system call in unix, Assignment Help, Ask Question on Fork system call in unix, Get Answer, Expert's Help, Fork system call in unix Discussions

Write discussion on Fork system call in unix
Your posts are moderated
Related Questions
What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.

What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and

Define properties of Time sharing operating system Time sharing:- T his systems uses CPU scheduling and multiprogramming to provide economical interactive use of a system. The

File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a

What is a client server system? Centralized systems proceed as server systems to satisfy request generated by client systems Server system is able to be broadly div

how response times are reduced by allowing time sharing on top of multiprogramming

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p


KERNEL-LEVEL THREADS (KLT) In this level every thread management is done by kernel .No thread library except an API system calls to the kernel thread facility exists. The kern

Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation