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
Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy

Medium term scheduling This is component of the swapping function. Usually the swapping in decision is based on the need to manage the degree of multiprogramming. At a system t

Invalid page fault :If a page fault happens for a reference to an address that's not part of the virtual address space, so that there could not be a page in memory corresponding

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

what do obelia eat and how do they feed

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p

What are the advantages of Indexed allocation? The benefits are a. No external-fragmentation problem b. Solves the size-declaration problems. c. Supports direct access

What is super block A partition control block have partitions details, such as the number of blocks in the partition, size of the blocks, free-blocks and free-block pointers an


File Organization     * Sequential     * Direct     * Indexed A file still if it is stored on a magnetic disk or CD-ROM disk may perhaps have a sequential file organiz