Process destruction, Operating System

Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "poison pill" where the process is sent a command to kill itself, and the other where the system itself kills the process, not permitting the process to execute further at all. What actions need to be taken when a program terminates or a process is killed? What if that process destruction is not the consequence of normal process termination, but rather is the consequence of software failure?

Posted Date: 2/22/2013 1:31:27 AM | Location : United States







Related Discussions:- Process destruction, Assignment Help, Ask Question on Process destruction, Get Answer, Expert's Help, Process destruction Discussions

Write discussion on Process destruction
Your posts are moderated
Related Questions

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

SCAN o Go from the outside to the inside servicing requests and after that back from the outside to the inside servicing requests. o Replicate this over and over. o Diminish

What is paging? Name the different paging techniques. Paging is a memory management method that permits the physical-address space of a process to be noncontiguous. Paging evad

Explain the BeginThread Function used in the NetWare example code BeginThread(MyThread Function, stack,size, arg) BeginThread creates a thread and places it on the NetWar

Question: a) What do you understand by Active directory domain in Windows Server 2008? Support your answer with a diagram. b) Distinguish between active directory trees

Several schemes available are as follows: Pipes : One-way communication process through which different process can interact. The problem is that the two processes could have

Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

Describe the following allocation algorithms: a. First fit b. Best fit c. Worst fit   a. First-fit: search the list of available memory and all

What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.