Presentation is loading. Please wait.

Presentation is loading. Please wait.

Big Picture Lab 4 Operating Systems Csaba Andras Moritz.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Big Picture Lab 4 Operating Systems Csaba Andras Moritz."— Presentation transcript:

1 Big Picture Lab 4 Operating Systems Csaba Andras Moritz

2 2 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Readings Chapter 6

3 3 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Outline  Operating Systems.

4 4 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Operating systems  The operating system controls resources: who gets the CPU; when I/O takes place; how much memory is allocated.  The most important resource is the CPU itself. CPU access controlled by the scheduler.  OS needs to keep track of: process priorities; scheduling state; process activation record.

5 5 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Where is the OS?

6 6 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Process Concept  Process = a program in execution process execution must progress in sequential fashion.  A process includes: program counter stack data section  Processes may be created: statically before system starts; dynamically during execution.

7 7 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Process State  As a process executes, it changes state  Each process may be in one of the following states (names vary across various OS): new: The process is being created. running: Instructions are being executed. waiting: The process is waiting for some event to occur. ready: The process is waiting to be assigned to a processor. terminated: The process has finished execution.

8 8 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Diagram of Process State

9 9 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Process Control Block (PCB)  Information associated with each process in the OS, i.e., the process related data structure.  The PCB contains: Process state (running, waiting, …) Program counter (value of PC) Stack pointer, General purpose CPU registers CPU scheduling information (e.g., priority) Memory-management information Username of owner I/O status information Pointer to state queues,..

10 10 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Process Control Block (PCB)

11 11 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Example Process State in Memory What you wrote: void X(int b){ If (b==1).. } main(){ int a = 2; X(a); } In memory: PC->

12 12 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Single and Multithreaded Processes  A thread = stream of execution  Benefits?

13 13 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Example of Memory Layout with Threads main() { …… fork_thread(producer); fork_thread(consumer); …… } producer() { …… } consumer(){ ……. }

14 14 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Embedded vs. general-purpose scheduling  Workstations try to avoid starving processes of CPU access. Fairness = access to CPU.  Embedded systems must meet deadlines. Low-priority processes may not run for a long time.  Priority Driven scheduling Each process has a priority. CPU goes to highest-priority process that is ready. Priorities determine scheduling policy: fixed priority; time-varying priorities.

15 15 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 CPU Switch From Process to Process

16 16 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Interprocess Communication  Interprocess communication (IPC): OS provides mechanisms so that processes can pass data.

17 17 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 IPC Styles  Shared memory: processes have some memory in common; must cooperate to avoid destroying/missing messages.  Message passing: processes send messages along a communication channel---no common address space.

18 18 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Critical Regions  Critical region: section of code that cannot be interrupted by another process.  Examples: writing shared memory; accessing I/O device.

19 19 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Shared Memory  Shared memory on a bus: CPU 1CPU 2 memory

20 20 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Race Condition in Shared Memory  Problem when two CPUs try to write the same location: CPU 1 reads flag and sees 0. CPU 2 reads flag and sees 0. CPU 1 sets flag to one and writes location. CPU 2 sets flag to one and overwrites location.

21 21 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Synchronization Hardware – ISA Support  E.g.,: Test and modify the content of a word atomically. boolean TestAndSet(boolean &target) { boolean rv = target; target = true; return rv; }

22 22 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Mutual Exclusion with Test-and-Set Can be used to implement a simple lock Shared data: boolean lock = false; Process P i do { while (TestAndSet(lock)) ; critical section lock = false; remainder section } Wait here/test until/if Lock is TRUE, If it is not, set it and continue

23 23 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Atomic test-and-set in ARM ISA  ARM test-and-set provided by SWP: single bus operation reads memory location, tests it, writes it.  Example ADR r0,SEMAPHORE LDR r1,#1 GETFLAG SWP r1,r1,[r0] BNZ GETFLAG

24 24 ECE 354 © Moritz 2008, some slides modified from Burleson, UMass and Wolf, Computers as Components, Morgan Kaufman, 2005 Semaphores  Semaphore: Higher level OS primitive for controlling access to critical regions. Can be implemented with locks Locks with test-and-set  Protocol: Get access to semaphore with P(). Perform critical region operations. Release semaphore with V().

Download ppt "Big Picture Lab 4 Operating Systems Csaba Andras Moritz."

Similar presentations

Operating Systems Part III: Process Management (Process Synchronization)

Operating Systems Part III: Process Management (Process Synchronization)
CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,

CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,
Ch. 7 Process Synchronization (1/2) 2015-04-17. 7.I Background F Producer - Consumer process :  Compiler, Assembler, Loader, · · · · · · F Bounded buffer.

Ch. 7 Process Synchronization (1/2) I Background F Producer - Consumer process :  Compiler, Assembler, Loader, · · · · · · F Bounded buffer.
Background Concurrent access to shared data can lead to inconsistencies Maintaining data consistency among cooperating processes is critical What is wrong.

Background Concurrent access to shared data can lead to inconsistencies Maintaining data consistency among cooperating processes is critical What is wrong.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 6: Process Synchronization.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 6: Process Synchronization.
Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.

Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.
Review: Chapters 1 – 7. 1.2 Chapter 1: OS is a layer between user and hardware to make life easier for user and use hardware efficiently Control program.

Review: Chapters 1 – Chapter 1: OS is a layer between user and hardware to make life easier for user and use hardware efficiently Control program.
Page 1 Processes and Threads Chapter 2 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

Page 1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.
1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.

1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.
Ceng 334 - Operating Systems 2.1-1 Chapter 2.1 : Processes Process concept Process scheduling Interprocess communication Deadlocks Threads.

Ceng Operating Systems Chapter 2.1 : Processes Process concept Process scheduling Interprocess communication Deadlocks Threads.
1/23/2008CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.

1/23/2008CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
CSE451 Processes Spring 2001 Gary Kimura Lecture #4 April 2, 2001.

CSE451 Processes Spring 2001 Gary Kimura Lecture #4 April 2, 2001.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.
© 2008 Wayne Wolf Overheads for Computers as Components 2 nd ed. Processes and operating systems zInterprocess communication. zOperating system performance.

© 2008 Wayne Wolf Overheads for Computers as Components 2 nd ed. Processes and operating systems zInterprocess communication. zOperating system performance.
Processes April 5, 2000 Instructor: Gary Kimura Slides courtesy of Hank Levy.

Processes April 5, 2000 Instructor: Gary Kimura Slides courtesy of Hank Levy.
Process Concept An operating system executes a variety of programs

Process Concept An operating system executes a variety of programs
Race Conditions CS550 Operating Systems. Review So far, we have discussed Processes and Threads and talked about multithreading and MPI processes by example.

Race Conditions CS550 Operating Systems. Review So far, we have discussed Processes and Threads and talked about multithreading and MPI processes by example.
1/26/2007CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.

1/26/2007CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations.

Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations.

Similar presentations

Ads by Google