1 / 21

Processes and Interprocess Communication

Learn about process creation, termination, scheduling, and interprocess communication in operating systems. Understand process state, control blocks, context switches, and cooperation between processes.

arivers
Download Presentation

Processes and Interprocess Communication

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Module 4: Processes • Process Concept • Process Scheduling • Operation on Processes • Cooperating Processes • Interprocess Communication Applied Operating System Concepts

  2. Diagram of Process State Applied Operating System Concepts

  3. Process Control Block (PCB) Applied Operating System Concepts

  4. CPU Switch From Process to Process Applied Operating System Concepts

  5. Process Scheduling Queues • (sdc:)See “How Processes Are Organized” section in Bovet’s chapter 3 for an introduction to: • The runqueue list: groups all processes in the TASK_RUNNING state. • Various wait_queue lists are used to hold sleeping processes that are waiting for a particular event to wake up. • Job queue – set of all processes in the system. • Ready queue – set of all processes residing in main memory,ready and waiting to execute. • Device queues – set of processes waiting for an I/O device. • Process migration between the various queues. Applied Operating System Concepts

  6. Context Switch • When CPU switches to another process, the system must save the state of the old process and load the saved state for the new process. • Context-switch time is overhead; the system does no useful work while switching. • Time dependent on hardware support. Applied Operating System Concepts

  7. Process Creation • Parent process creates children processes, which, in turn create other processes, forming a tree of processes. • Resource sharing • Parent and children share all resources. • Children share subset of parent’s resources. • Parent and child share no resources. • Execution • Parent and children execute concurrently. • Parent waits until children terminate. Applied Operating System Concepts

  8. Process Creation (Cont.) • Address space • Child duplicate of parent. • Child has a program loaded into it. • UNIX examples • fork system call creates new process • execve system call used after a fork to replace the process’ memory space with a new program. Applied Operating System Concepts

  9. A Tree of Processes On A Typical UNIX System Applied Operating System Concepts

  10. Process Termination • Process executes last statement and asks the operating system to decide it (exit). • Output data from child to parent (via wait). • Process’ resources are deallocated by operating system. • Parent may terminate execution of children processes (abort). • Child has exceeded allocated resources. • Task assigned to child is no longer required. • Parent is exiting. • Operating system does not allow child to continue if its parent terminates. • Cascading termination. Applied Operating System Concepts

  11. Cooperating Processes • Independent process cannot affect or be affected by the execution of another process. • Cooperating process can affect or be affected by the execution of another process • Advantages of process cooperation • Information sharing • Computation speed-up • Modularity • Convenience Applied Operating System Concepts

  12. Producer-Consumer Problem • Paradigm for cooperating processes, producer process produces information that is consumed by a consumer process. • unbounded-buffer places no practical limit on the size of the buffer. • bounded-buffer assumes that there is a fixed buffer size. Applied Operating System Concepts

  13. Bounded-Buffer – Shared-Memory Solution See Producer-Consumer solution coded in Java from AOS chapter 4. Applied Operating System Concepts

  14. PIPES • AOS page 630: “A pipe is essentially a queue of bytes between two processes.” • Unix kernels provide pipes as a service. There is a system call to create a pipe. • Unix shells call this system call and then create two separate processes to run a “shell pipeline” • Shell pipeline example: cat infile | less • The pipe SYNCHRONIZES • Producer: left hand command’s process writing to its own standard output file descriptor 1. • Consumer: right hand command’s process reading from its own standard input file descriptor 0. Applied Operating System Concepts

  15. Interprocess Communication (IPC) • Mechanism for processes to communicate and to synchronize their actions. • Message system – processes communicate with each other without resorting to shared variables. • IPC facility provides two operations: • send(message) – message size fixed or variable • receive(message) • If P and Q wish to communicate, they need to: • establish a communicationlink between them • exchange messages via send/receive • Implementation of communication link • physical (e.g., shared memory, hardware bus) • logical (e.g., logical properties) Applied Operating System Concepts

  16. Implementation Questions • How are links established? • Can a link be associated with more than two processes? • How many links can there be between every pair of communicating processes? • What is the capacity of a link? • Is the size of a message that the link can accommodate fixed or variable? • Is a link unidirectional or bi-directional? Applied Operating System Concepts

  17. Direct Communication • Processes must name each other explicitly: • send (P, message) – send a message to process P • receive(Q, message) – receive a message from process Q • Properties of communication link • Lilnks are established automatically. • A link is associated with exactly one pair of communicating processes. • Between each pair there exists exactly one link. • The link may be unidirectional, but is usually bi-directional. Applied Operating System Concepts

  18. Indirect Communication • Messages are directed and received from mailboxes (also referred to as ports). • Each mailbox has a unique id. • Processes can communicate only if they share a mailbox. • Properties of communication link • Link established only if processes share a common mailbox • A link may be associated with many processes. • Each pair of processes may share several communication links. • Link may be unidirectional or bi-directional. • Operations • create a new mailbox • send and receive messages through mailbox • destroy a mailbox Applied Operating System Concepts

  19. Indirect Communication (Continued) • Mailbox sharing • P1, P2, and P3 share mailbox A. • P1, sends; P2and P3 receive. • Who gets the message? • Solutions • Allow a link to be associated with at most two processes. • Allow only one process at a time to execute a receive operation. • Allow the system to select arbitrarily the receiver. Sender is notified who the receiver was. Applied Operating System Concepts

  20. Buffering • Queue of messages attached to the link; implemented in one of three ways. 1. Zero capacity – 0 messagesSender must wait for receiver (rendezvous). 2. Bounded capacity – finite length of n messagesSender must wait if link full. 3. Unbounded capacity – infinite length Sender never waits. Applied Operating System Concepts

  21. Exception Conditions – Error Recovery • Process terminates • Lost messages • Scrambled Messages Applied Operating System Concepts

More Related