CE01000-3 Operating Systems

1. CE01000-3 Operating Systems Lecture 6 Processes

2. Overview of lecture In this lecture we will be looking at What is a process? Structure of a process Process state Resource queues Process scheduling Context switching Process creation and termination Co-operating processes

3. Concept of a process • OS shares resources between user programs (see last week). • Before user program can make any requests or do anything on the system it must exist in a way that allows the CPU to execute it and the OS to interact with it. • User program is simply a file of text that specifies what actions the computer should perform.

4. Concept of a process (Cont.) • In order to run, a representation of the user program must be created by the OS - known as a process. • It is the process that runs on the computer. • Process is a program in execution. • Processes are basic units that resources are shared between.

5. Concept of a process (Cont.) • Think of a user program as a design/specification for a machine, process is the actual machine working after it has been built.

6. Process structure • A process includes: • program section - contains a copy of the machine code instructions • user data section - to hold variable data values

7. Process structure (Cont.) • system data section - area to hold • process context info when process interrupted - program counter, processor registers, etc and • system information about resources allocated to process, etc. • user and system data sections obviously may be different from one run of a process to another

8. Process state

9. Process State (Cont.) • As a process executes, it changes state. • new: The process is created by OS • ready: The process is waiting to be assigned to a processor. • running: Instructions are being executed on processor • waiting: The process is waiting for some event to occur • terminated: The process has finished execution.

10. Process Control Block (PCB) • PCB - data structure that contains Information associated with each process: • Process state and process id. number • Copies of CPU registers when program not executing e.g. program counter, data, index, and other registers • CPU scheduling information - e.g. priority level

11. Process Control Block (Cont.) • Memory-management information - e.g. base/limit register values • Accounting information - CPU time used, etc • I/O status information - which I/O resources allocated

12. Process Control Block (Cont.)

13. Process Scheduling Queues Process migration between the various queues:

14. Process Scheduling Queues (Cont.) • Job queue – set of all processes wanting to be allowed to compete for use of CPU • Ready queue – set of all processes that are in main memory, ready and waiting to execute - a linked list • Device queues – set of processes waiting to use an I/O device

15. Representation of process scheduling

16. Ready queue and device queues

17. Execution Schedulers

18. Execution Schedulers (Cont.) • Long-term scheduler (or job scheduler) – selects which processes should be brought into the ready queue - LT scheduler generally only in batch system • Short-term scheduler (or CPU scheduler) – selects which process should be executed next and allocates CPU to it.

19. Execution 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 – • this is the number of processes in the system that can be scheduled onto the CPU I.e. number of processes competing for CPU as a resource.

20. Execution Schedulers (Cont.) • Long-term schedule wants to balance use of CPU between I/O-bound and CPU-bound processes • I/O-bound process – have small amount of computation before it needs to do some I/O; many I/O requests -Typical interactive user programs. • CPU-bound process – large amount of computation before it needs to do some I/O; few I/O requests - Programs that require sustained periods of calculation e.g. modelling applications

21. Medium term scheduler

22. Medium term scheduler (Cont.) • If number of processes competing for resources become too many and begin to slow system response times down, then can temporarily swap some processes out to disk and bring them back later. It is intermediate between long and short term. • may exist in time sharing systems to provide temporary relief from overloading

23. CPU switched between processes

24. 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 taken dependent on hardware support.

25. Process Creation • When a process is created it is created by another process known as the parent process - new process created is the child process of the parent. New process may in turn create other processes, forming a family tree of processes. • There must be a first process (init process) - this is process that is created at bootup of the OS and is part of OS.

26. Process Creation (Cont.) • Resource sharing between parent and child processes - options include: • Parent and children share all resources, or • Children share subset of parent’s resources, or • Parent and child share no resources. • Execution options: • Parent and children execute concurrently, or • Parent waits until children terminate.

27. Process Creation (Cont.) • UNIX example • fork system call creates new process which is a copy of the parent - but when child process runs it can distinguish itself from parent and normally proceeds to make exec call • exec family ofsystem calls used after a fork to replace the process’ memory space with the program the parent wanted to be executed

28. Process Termination • Process executes last statement and asks the operating system to delete it (exit system call). Then • Return data from child to parent (via wait). • Process’ resources are deallocated by operating system.

29. Process Termination (Cont.) • Parent may terminate execution of children processes (abort). Reasons for this could be: • Child has exceeded allocated resources. • Task assigned to child is no longer required. • Parent is exiting and O/S does not allow children to continue if their parent terminates.

30. Cooperating Processes • Process is independent if it cannot legally affect or be affected by the execution of another process. • Process is cooperating if it can legally affect or be affected by the execution of another process.

31. Cooperating Processes (Cont.) • Advantages of process cooperation: • Information sharing • Computation speed-up - but only if >1 processor • Modularity - dividing system functions into separate processes that then talk to each other • way in which user process can interact with OS processes to do I/O, etc.

32. Producer-Consumer Problem • Classic example for cooperating processes; producer process produces information that is consumed by a consumer process e.g. program outputting to printer spooler • producer places data in buffer, consumer takes data from buffer

33. Producer-Consumer Problem (Cont.) • unbounded-buffer places no practical limit on the size of the buffer - consumer waits when buffer empty • bounded-buffer assumes that there is a fixed buffer size - producer waits when buffer full and consumer when empty

34. Bounded-Buffer – Shared-Memory solution. • Data structures: • buffer for shared data - an array organised as a circular buffer • in-index - where producer to put data • out-index - where consumer to get data

35. Bounded-Buffer – Shared-Memory solution (Cont.) • Producer Process repeat …. produce data item …. /* buffer full when in-index is 1 less than out-index */ while buffer full do no-op; buffer[in-index] = data item in-index = (in-index+1) modulo size-of-buffer until false

36. Bounded-Buffer – Shared-Memory solution (Cont.) • Consumer process repeat /* buffer empty when in-index == out-index */ while buffer empty do no-op; get next data item from buffer[out-index] out-index = out-index-1 modulo size-of-buffer …. consume data item …. until false

37. References Operating System Concepts. Chapter 3.