Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Zombie process
Summary
On Unix and Unix-like computer operating systems, a zombie process or defunct process is a process that has completed execution (via the exit system call) but still has an entry in the process table: it is a process in the "Terminated state". This occurs for the child processes, where the entry is still needed to allow the parent process to read its child's exit status: once the exit status is read via the wait system call, the zombie's entry is removed from the process table and it is said to be "reaped". A child process always first becomes a zombie before being removed from the resource table. In most cases, under normal system operation zombies are immediately waited on by their parent and then reaped by the system – processes that stay zombies for a long time are generally an error and cause a resource leak, but the only resource they occupy is the process table entry – process ID.
The term zombie process derives from the common definition of zombie — an undead person. In the term's metaphor, the child process has "died" but has not yet been "reaped". Also, unlike normal processes, the kill command has no effect on a zombie process.
Zombie processes should not be confused with orphan processes: an orphan process is a process that is still executing, but whose parent has died. When the parent dies, the orphaned child process is adopted by init (process ID 1). When orphan processes die, they do not remain as zombie processes; instead, they are waited on by init. The result is that a process that is both a zombie and an orphan will be reaped automatically.
When a process ends via exit, all of the memory and resources associated with it are deallocated so they can be used by other processes. However, the process's entry in the process table remains. The parent can read the child's exit status by executing the wait system call, whereupon the zombie is removed. The wait call may be executed in sequential code, but it is commonly executed in a handler for the SIGCHLD signal, which the parent receives whenever a child has died.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (2)
PENS-315: SKIL Student Kreativity and Innovation Laboratory
This course will allow students to engage in hands-on projects defined by themselves, in a dedicated workshop environment. Students work together in small groups on their own ideas, with access to a w
CS-323: Introduction to operating systems
Introduction to basic concepts of operating systems.
Related lectures (12)
Processes: Overview and Management
Covers the basics of processes in operating systems, including creation, memory layout, state transitions, virtualization, APIs, and program execution.
Process Protection and Efficient Execution
Explores process execution, protection, and efficient OS mechanisms for secure and reliable multi-program environments.
Distributed Transactions: 2PC Principles and Replication Strategies
Explores 2PC principles, failure scenarios, and replication strategies in distributed transactions and discusses the transition from ACID to BASE properties in NoSQL systems.
Related publications (25)
Echoing Swiss Coloniality. Land, Archive and Visuality between Brazil and Switzerland.
Informed by longstanding artistic practice, this doctoral thesis approaches entanglements of Swiss coloniality in Brazil and Switzerland under the lens of land, archive, and visuality. The enduring legacies of imperial capitalism in the former Colonia Leop ...
EPFL2024Leibniz en Créateur. Un regard matériel sur sa machine à calculer
Simon François Dumas Primbault
Between 1671 and 1716, the German mathematician Gottfried Wilhelm Leibniz attempted to design a reckoning machine. Working closely with the Parisian clockmaker Monsieur Ollivier, Leibniz eventually failed at producing a working prototype. After the redisco ...
2022Related people (2)
Related concepts (7)
Process (computing)
In computing, a process is the instance of a computer program that is being executed by one or many threads. There are many different process models, some of which are light weight, but almost all processes (even entire virtual machines) are rooted in an operating system (OS) process which comprises the program code, assigned system resources, physical and logical access permissions, and data structures to initiate, control and coordinate execution activity.
Exit (system call)
On many computer operating systems, a computer process terminates its execution by making an exit system call. More generally, an exit in a multithreading environment means that a thread of execution has stopped running. For resource management, the operating system reclaims resources (memory, , etc.) that were used by the process. The process is said to be a dead process after it terminates. Under Unix and Unix-like operating systems, a process is started when its parent process executes a fork system call.
Wait (system call)
In computer operating systems, a process (or task) may wait for another process to complete its execution. In most systems, a parent process can create an independently executing child process. The parent process may then issue a wait system call, which suspends the execution of the parent process while the child executes. When the child process terminates, it returns an exit status to the operating system, which is then returned to the waiting parent process. The parent process then resumes execution.