1. Silberschatz, Galvin and Gagne  2002 4.1 Applied Operating System Concepts Chapter 4: Processes Process Concept Process Scheduling Operation on Processes Cooperating Processes Interprocess Communication

2. Silberschatz, Galvin and Gagne  2002 4.2 Applied Operating System Concepts Multi-user System -- multiple shells Second terminal -- power on Kernel creates sh for this terminal kernel a.out 탐색기 hwp or CLI kernel boot

3. Silberschatz, Galvin and Gagne  2002 4.3 Applied Operating System Concepts sh a.out sh a.out User A: User B: Multi-user System -- multiple shells Second terminal -- power on Kernel creates sh for this terminal as child process kernel a.out 탐색기 hwp web or CLI

4. Silberschatz, Galvin and Gagne  2002 4.4 Applied Operating System Concepts CPU PCB memdisk PCB tty Process 1Process 2Process 3 CPUmemdisk tty User a.out Kernel a.out Hardware

5. Silberschatz, Galvin and Gagne  2002 4.5 Applied Operating System Concepts sh a.out sh a.out User A: User B: Multi-user System -- multiple shells Second terminal -- power on Kernel creates sh for this terminal as child process PCB B PCB A kernel 탐색기 hwp web or CLI

6. Silberschatz, Galvin and Gagne  2002 4.6 Applied Operating System Concepts Process Concept An operating system executes a variety of programs:  Batch system – jobs  Time-shared systems – user programs or tasks Textbook uses the terms job and process almost interchangeably. Process – a program in execution; process execution must progress in sequential fashion. A process includes:  program counter  stack  data section  Text (code) section

7. Silberschatz, Galvin and Gagne  2002 4.7 Applied Operating System Concepts Process State As a process executes, it changes state  new: The process is being created.  running: This process’s Instructions are being executed.  Waiting(blocked): The process is waiting for some event to occur.  (blocked)  Cannot run on CPU  ready: The process is waiting for CPU.  (residing in memory)  terminated: The process has finished execution.

8. Silberschatz, Galvin and Gagne  2002 4.8 Applied Operating System Concepts Diagram of Process State (blocked) (usually Timer) (into Memory)

9. Silberschatz, Galvin and Gagne  2002 4.9 Applied Operating System Concepts Process Control Block (PCB) Information associated with each process. Process state Program counter CPU registers CPU scheduling information Memory-management information Accounting information I/O status information

10. Silberschatz, Galvin and Gagne  2002 4.10 Applied Operating System Concepts CPU PCB memdisk PCB tty Process 1Process 2Process 3 CPUmemdisk tty User a.out Kernel a.out Hardware

11. Silberschatz, Galvin and Gagne  2002 4.11 Applied Operating System Concepts Process Control Block (PCB)

12. Silberschatz, Galvin and Gagne  2002 4.12 Applied Operating System Concepts CPU Switch From Process to Process

13. Silberschatz, Galvin and Gagne  2002 4.13 Applied Operating System Concepts Process Scheduling Queues 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.

14. Silberschatz, Galvin and Gagne  2002 4.14 Applied Operating System Concepts CPU PCB memdisk PCB tty Process 1Process 2Process 3 CPUmemdisk tty User a.out Kernel a.out Hardware

15. Silberschatz, Galvin and Gagne  2002 4.15 Applied Operating System Concepts Ready Queue And Various I/O Device Queues

16. Silberschatz, Galvin and Gagne  2002 4.16 Applied Operating System Concepts Representation of Process Scheduling

17. Silberschatz, Galvin and Gagne  2002 4.17 Applied Operating System Concepts Schedulers Long-term scheduler (or job scheduler) – selects which processes should be brought into the ready queue.  Giving Memory Short-term scheduler (or CPU scheduler) – selects which process should be executed next and allocates CPU.   Giving CPU

18. Silberschatz, Galvin and Gagne  2002 4.18 Applied Operating System Concepts Addition of Medium Term Scheduling From memory ( 여유공간 만들기 ) To disk

19. Silberschatz, Galvin and Gagne  2002 4.19 Applied Operating System Concepts Schedulers (Cont.) Short-term scheduler is invoked very frequently (milliseconds)  (must be fast). Long-term scheduler is invoked very infrequently (seconds, minutes)  (may be slow). The long-term scheduler controls the degree of Multiprogramming. Processes can be described as either:  I/O-bound process – spends more time doing I/O than computations,  many short CPU bursts. (Fig. 6-1)  CPU-bound process – spends more time doing computations;  few very long CPU bursts.

20. Silberschatz, Galvin and Gagne  2002 4.20 Applied Operating System Concepts 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.

21. Silberschatz, Galvin and Gagne  2002 4.21 Applied Operating System Concepts Process Creation Parent process creates children processes, which, in turn create other processes, forming a tree of processes. Need resource may come from  OS gives  Parent shares Resource sharing can be either  Parent and children share all resources.  Children share subset of parent’s resources.  Parent and child share no resources. Execution ---– parent vs child  Parent and children execute concurrently.  Parent waits until children terminate.  Egparent – web browser  child ---- print (web page) 

22. Silberschatz, Galvin and Gagne  2002 4.22 Applied Operating System Concepts Process Creation (Cont.) Process creation 의 4 단계  Create PCB within OS kernel  Allocate memory space  Load binary program  Initialization of program UNIX examples  fork system call creates new process  duplicate parent (PCB)  allocate space  execve system call used after a fork  load binary program from disk  initialization

23. Silberschatz, Galvin and Gagne  2002 4.23 Applied Operating System Concepts A Tree of Processes On A Typical UNIX System

24. Silberschatz, Galvin and Gagne  2002 4.24 Applied Operating System Concepts Process Termination System call (exit).  last statement of a process  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. –OS does not allow child to continue if its parent terminates. –Cascading termination.

25. Silberschatz, Galvin and Gagne  2002 4.25 Applied Operating System Concepts Cooperating Processes Independent processes  cannot affect execution of another process. Cooperating processes  can affect execution of another process Advantages of process cooperation  Information sharing  Computation speed-up  Modularity  Convenience

26. Silberschatz, Galvin and Gagne  2002 4.26 Applied Operating System Concepts Producer-Consumer Problem Paradigm for cooperating processes, producer process produces information that is consumed by a consumer process.  unbounded-buffer -- no limit on the size of the buffer.  bounded-buffer ------- fixed buffer size.

27. Silberschatz, Galvin and Gagne  2002 4.27 Applied Operating System Concepts Bounded-Buffer Shared-Memory Solution Shared data var n; type item = … ; var buffer array [0..n–1] of item; in, out: 0..n–1; Producer process repeat … produce an item in nextp … while in+1 mod n = out do no-op; buffer [in] :=nextp; in :=in+1 mod n; until false; Producer in Buffer In shared memory

28. Silberschatz, Galvin and Gagne  2002 4.28 Applied Operating System Concepts Bounded-Buffer (Cont.) Consumer process repeat while in = out do no-op; nextc := buffer [out]; out := out+1 mod n; … consume the item in nextc … until false; Solution is correct, but can only fill up n–1 buffer.

29. Silberschatz, Galvin and Gagne  2002 4.29 Applied Operating System Concepts Interprocess Communication (IPC) Mechanism for processes to communicate and to synchronize their actions 두가지 방식 :Message Shared memory IPC provides two operations for message :  send(message) – message size can be fixed or variable  receive(message) If P and Q wish to communicate, they need to:  establish a communication link between them (like dial-up)  exchange messages via send/receive (like 통화 ) Implementation of communication link  physical (e.g., shared memory, hardware bus)  logical (e.g., logical properties)

30. Silberschatz, Galvin and Gagne  2002 4.30 Applied Operating System Concepts 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?

31. Silberschatz, Galvin and Gagne  2002 4.31 Applied Operating System Concepts 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  Links are established automatically.  A link is associated with exactly one pair of communicating processes.  Between each pair there exists exactly one link.  문제 :  Compile time 에 name 을 알 수가 있는가 ?  상대방의 name 이 달라지면 ? – send (P, M) 특히 remote process 인 경우 (process migration)  해결책 : mailbox ( 우편 사서함 )

32. Silberschatz, Galvin and Gagne  2002 4.32 Applied Operating System Concepts 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. Operations  Create, destroy a new mailbox  Send/receive messages through mailbox  send (PBOX, M)  전세계적 통일된 mailbox – web, ftp, telnet, ….

33. Silberschatz, Galvin and Gagne  2002 4.33 Applied Operating System Concepts Indirect Communication (Continued) Mailbox sharing  P 1, P 2, P 3 share mailbox A.  P 1, sends;  P 2, P 3 receive.  Who gets the message (if P 2, P 3 tries)? 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.

34. Silberschatz, Galvin and Gagne  2002 4.34 Applied Operating System Concepts Buffering Queue of messages attached to the link; implemented in one of three ways. 1.Zero capacity – 0 messages Sender must wait for receiver to run (rendezvous). 2.Bounded capacity – finite length of n messages Sender must wait if link full. 3.Unbounded capacity – infinite length Sender never have to wait.

35. Silberschatz, Galvin and Gagne  2002 4.35 Applied Operating System Concepts Exception Conditions – Error Recovery Process terminates Lost messages Scrambled Messages