Skip to content

Process Composition

Composition of a process

A process is the basic execution unit in an operating system and consists of the following three main parts:

  1. Program code:
  2. Contains the instructions of the program, indicating the operations to be performed.

  3. Usually loaded from a disk or other storage device into memory for execution.

  4. Data segment:

  5. Contains data when the program is running, such as global variables, static variables, etc.

  6. Constantly updated and modified during program execution.

  7. Process Control Block (PCB):

  8. Each process has one and only one process control block
  9. Stores all relevant information about the process and is an important data structure for the operating system to manage and control the process.
  10. PCB contains the following main information:
  11. Process identifier (PID): used to uniquely identify the process.
  12. Process status: such as running, ready, blocked, etc.
  13. Program counter (PC): indicates the next instruction to be executed.
  14. Register content: saves the register status in the process context.
  15. Memory management information: such as the memory segments and page tables used by the process.
  16. I/O status information: including the files and device status used by the process.
  17. Scheduling information: scheduling parameters such as priority and time slice.

Process organization

The process organization is mainly reflected in the management of the process address space and the memory allocation method. Common organization methods include linear, linked, indexed, etc.

1. Linear organization:

  • Description: The address space of the process is stored continuously in the memory, and the data and instructions of the process are arranged in sequence.
  • Advantages: Simple structure and high access efficiency.
  • Disadvantages: Memory fragmentation is prone to occur and is not suitable for dynamic memory allocation.
  • Applicable scenarios: For small and simple programs.
  • Description: The process address space adopts a non-continuous allocation method, and each memory block is organized through a link list (linked list).
  • Advantages: It can effectively utilize memory and reduce memory fragmentation.
  • Disadvantages: The linked list has high maintenance overhead and slow access speed.
  • Applicable scenarios: Suitable for scenarios with high demand for dynamic memory allocation.

3. Index organization:

  • Description: The address space of the process is managed through the index table. Each entry in the index table points to the memory block where the data is actually stored.

  • Advantages: Supports random access and is suitable for large-scale data structures.

  • Disadvantages: The index table takes up additional memory space and increases overhead.

  • Applicable scenarios: Used in file systems or large-scale, non-linear data storage scenarios.

Summary

Organization method Advantages Disadvantages Applicable scenarios
Linear organization Simple structure, high access efficiency Easy to generate memory fragmentation Small programs, static memory allocation
Link organization Reduce memory fragmentation, high flexibility Complex maintenance, slow access speed Scenarios with high demand for dynamic memory allocation
Index organization Supports random access, suitable for large-scale data Occupies additional memory space File systems, large-scale data structures