Reference no: EM1379694
Assume when a child process is fork()ed, a parent may wait for the successful completion of the child via the wait() service (or one of its variants) so that the return result of that application can be read from the process descriptor block.
If the parent does not perform a wait() operation on the child process after it terminates, Unix will keep the process descriptor block active for this application in hopes that eventually the parent will wait() or that the parent will itself terminate.
If you perform the ps command in this scenario, you may find a number of "zombie" processes - these are processes marked with a Z in the output of ps that are children of a currently running parent that hasn't yet waited upon their completion. Normally, this isn't much of a problem, as eventually, the parent will terminate and cause the zombie tasks to be deallocated.
However, in a server application such as the email database server above, this becomes a problem, as the server generally never terminates, and as a result, the system list of process descriptor blocks becomes cluttered by zombies (processes that have properly terminated by haven't been waited upon by the parent).
To avoid this problem, Unix ensures that a terminating child application can send a signal to the parent indicating that it has terminated (SIG_CHILD). The parent should catch this signal, and issue a wait() or one of its variants to clean up the zombied process descriptor block.
For this question, describe the concept of a signal, and indicate how the parent application can be configured to act upon the SIG_CHILD signal from each child as they terminate to avoid the zombie issue.
In your answer, discuss the OS services that Unix provides to support signal processing.
|
Fundamental stages of an enterprise system life cycle
: Discuss why is this important to the success of the implementation project? Determine the fundamental stages of an enterprise system life cycle?
|
|
Election algorithm for bidirectional rings
: The ring algorithm supposes that the links are unidirectional and that every procedure sends its message to the neighbor on the right. The main data structure used through the algorithm is the active list,
|
|
Process customer order history from a file
: Required help creating a document that Develop an application that will read and procedure customer history order information from a document.
|
|
Determine a source code control system
: Determine a source code control system and discuss why is such a system necessary when multiple programmers build a program or system?
|
|
Describe the concept of a signal
: Assume when a child process is forked, a parent may wait for the successful completion of the child via the wait service so that return result of that application can be read from the procedure descriptor block.
|
|
Discuss mitigation strategies
: It is determined that 3-out of 5-businesses that experience downtime of forty-eight hours or more will be out of business within three years.
|
|
Overview of multiprogramming mode
: Member of coordinating a computer's activities is handling failure. This is called fault tolerance. Briefly explain about how a computer handles loss of power to limit the loss of all work
|
|
Write a very basic doubly-linked list
: CptS 122 Lab #2: Linked Lists , Along with vectors, linked lists are one of the fundamental data structures in computer science. Unlike vectors, which store information in a contiguous block of computer memory, linked lists have the potential to sto..
|
|
Compute the net expected value for the project
: You are considering to make modifications to an existing application. Compute the net expected value for the project risks and opportunities
|