Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 162 Discussion Section Week 2. Who am I? Haoyuan (HY) Li Office Hours: 1pm-3pm

Published byDayna Elliott Modified over 9 years ago

Similar presentations

Presentation on theme: "CS 162 Discussion Section Week 2. Who am I? Haoyuan (HY) Li Office Hours: 1pm-3pm"— Presentation transcript:

1 CS 162 Discussion Section Week 2

2 Who am I? Haoyuan (HY) Li http://www.cs.berkeley.edu/~haoyuan haoyuan@cs.berkeley.edu Office Hours: 1pm-3pm Monday @ 465E SODA Research: Data center systems

3 Administrivia Get to know Nachos Start project 1

4 Project 1 Can be found in the course website – Under the heading “Projects and Nachos” Stock Nachos has an incomplete thread system. Your job is to – complete it, and – use it to solve several synchronization problems

5 Project 1 Grading Design docs [40 points] – First draft [10 points] – Design review [10 points] – Final design doc [20 points] Code [60 points]

6 Design Document Overview of the project as a whole along with its parts Header must contain the following info – Project Name and # – Group Members Name and ID – Section # – TA Name

7 Design Document Structure Each part of the project should be explained using the following structure Overview Correctness Constraints Declarations Descriptions Testing Plan

8 True/False 1.Threads within the same process share the same heap and stack. 2.Preemptive multithreading requires threads to give up the CPU using the yield() system call. 3.Despite the overhead of context switching, multithreading can provide speed-up even on a single-core cpu.

9 Short Answers 1.What is the OS data structure that represents a running process? 2.What are some of the similarities and differences between interrupts and system calls? What roles do they play in preemptive and non-preemptive multithreading?

10 Why Processes & Threads? Goals:

11 Why Processes & Threads? Multiprogramming: Run multiple applications concurrently Protection: Don’t want a bad application to crash system! Goals: Solution:

12 Why Processes & Threads? Multiprogramming: Run multiple applications concurrently Protection: Don’t want a bad application to crash system! Goals: Process: unit of execution and allocation Virtual Machine abstraction: give process illusion it owns machine (i.e., CPU, Memory, and IO device multiplexing) Solution: Challenge:

13 Why Processes & Threads? Multiprogramming: Run multiple applications concurrently Protection: Don’t want a bad application to crash system! Goals: Process: unit of execution and allocation Virtual Machine abstraction: give process illusion it owns machine (i.e., CPU, Memory, and IO device multiplexing) Solution: Process creation & switching expensive Need concurrency within same app (e.g., web server) Challenge: Solution:

14 Why Processes & Threads? Multiprogramming: Run multiple applications concurrently Protection: Don’t want a bad application to crash system! Goals: Process: unit of execution and allocation Virtual Machine abstraction: give process illusion it owns machine (i.e., CPU, Memory, and IO device multiplexing) Solution: Process creation & switching expensive Need concurrency within same app (e.g., web server) Challenge: Thread: Decouple allocation and execution Run multiple threads within same process Solution:

15 Putting it together: Process Memory I/O State (e.g., file, socket contexts) CPU state (PC, registers..) Sequential stream of instructions A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); … (Unix) Process Resources

16 Putting it together: Processes … Process 1Process 2Process N CPU sched. OS CPU (1 core) 1 process at a time CP U sate IO sate Mem. CP U sate IO sate Mem. CP U sate IO sate Mem. Switch overhead: high – CPU state: low – Memory/IO state: high Process creation: high Protection – CPU: yes – Memory/IO: yes Sharing overhead: high (involves at least a context switch)

17 Putting it together: Threads Process 1 CPU sched. OS CPU (1 core) 1 thread at a time IO sate Mem. … threads Process N IO sate Mem. … threads … Switch overhead: low (only CPU state) Thread creation: low Protection –CPU: yes –Memory/IO: No Sharing overhead: low (thread switch overhead low) CPU sate CPU sate CPU sate CPU sate

18 Putting it together: Multi-Cores Process 1 CPU sched. OS IO sate Mem. … threads Process N IO sate Mem. … threads … Switch overhead: low (only CPU state) Thread creation: low Protection –CPU: yes –Memory/IO: No Sharing overhead: low (thread switch overhead low) core 1Core 2Core 3Core 4 CPU 4 threads at a time CPU sate CPU sate CPU sate CPU sate

19 Putting it together: Hyper-Threading Process 1 CPU sched. OS IO sate Mem. … threads Process N IO sate Mem. … threads … Switch overhead between hardware- threads: very-low (done in hardware) Contention to cache may hurt performance core 1 CPU core 2core 3core 4 8 threads at a time hardware-threads (hyperthreading) CPU sate CPU sate CPU sate CPU sate

20 Thread State State shared by all threads in process/addr space –Content of memory (global variables, heap) –I/O state (file system, network connections, etc) State “private” to each thread –Kept in TCB  Thread Control Block –CPU registers (including, program counter) –Execution stack – what is this? Execution Stack –Parameters, temporary variables –Return PCs are kept while called procedures are executing

21 What is the difference between a Thread and a Process?

22 When and how do you switch between processes?

23 Scheduling states

24 Dispatch Loop Conceptually, the dispatching loop of the operating system looks as follows: Loop { RunThread(); ChooseNextThread(); SaveStateOfCPU(curTCB); LoadStateOfCPU(newTCB); } This is an infinite loop –One could argue that this is all that the OS does

25 Context Switching

26 An OS needs to mediate access to resources: how do we share the CPU? Strategy 1: force everyone to cooperate – a thread willingly gives up the CPU by calling yield() which calls into the scheduler, which context-switches to another thread – what if a thread never calls yield()? Strategy 2: use pre-emption – at timer interrupt, scheduler gains control and context switches as appropriate Recall, an OS needs to mediate access to resources: how do we share the CPU?

27 From Lecture: Two Thread Yield Consider the following code blocks:“ " proc A() { B(); } proc B() { while(TRUE) { yield(); } Suppose we have 2 threads:“ Threads S and T Thread S Stack growth A B(while) yield run_new_thread switch Thread T A B(while) yield run_new_thread switch

28 Detour: Interrupt Controller Interrupts invoked with interrupt lines from devices Interrupt controller chooses interrupt request to honor –Mask enables/disables interrupts –Priority encoder picks highest enabled interrupt –Software Interrupt Set/Cleared by Software –Interrupt identity specified with ID line CPU can disable all interrupts with internal flag Non-maskable interrupt line (NMI) can’t be disabled Network IntID Interrupt Interrupt Mask Control Software Interrupt NMI CPU Priority Encoder Timer Int Disable

29 Max Number of Processes, Threads? Windows? Linux? Mac OS? How Many Threads and Processes are Enough?

30 Questions / Examples about Process and Thread?

31 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; addrX: addrY: addrU: addrV: addrZ:........................

32 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ addrX: addrY: addrU: addrV: addrZ:........................

33 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ addrX: addrY: addrU: addrV: addrZ:........................

34 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ addrX: addrY: addrU: addrV: addrZ:........................

35 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY addrX: addrY: addrU: addrV: addrZ:........................

36 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY addrX: addrY: addrU: addrV: addrZ:........................

37 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................

38 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................

39 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; A: tmp=2 ret=addrV Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................

40 Review: Execution Stack Example Stack holds function arguments, return address Permits recursive execution Crucial to modern languages A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; A: tmp=2 ret=addrV Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................

41 Review: Execution Stack Example A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; A: tmp=2 ret=addrV Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................ Output: 2

42 Review: Execution Stack Example A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY C: ret=addrU addrX: addrY: addrU: addrV: addrZ:........................ Output: 2

43 Review: Execution Stack Example A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ B: ret=addrY addrX: addrY: addrU: addrV: addrZ:........................ Output: 2

44 Review: Execution Stack Example A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; Stack Pointer Stack Growth A: tmp=1 ret=addrZ addrX: addrY: addrU: addrV: addrZ:........................ Output: 2 1

45 Review: Execution Stack Example A(int tmp) { if (tmp<2) B(); printf(tmp); } B() { C(); } C() { A(2); } A(1); exit; addrX: addrY: addrU: addrV: addrZ:........................ Output: 2 1

Download ppt "CS 162 Discussion Section Week 2. Who am I? Haoyuan (HY) Li Office Hours: 1pm-3pm"

Similar presentations

CS 162 Discussion Section Week 3. Who am I? Mosharaf Chowdhury Office 651 Soda 4-5PM.

CS 162 Discussion Section Week 3. Who am I? Mosharaf Chowdhury Office 651 Soda 4-5PM.
Processes CSCI 444/544 Operating Systems Fall 2008.

Processes CSCI 444/544 Operating Systems Fall 2008.
Avishai Wool lecture 2 - 1 Priority Scheduling Idea: Jobs are assigned priorities. Always, the job with the highest priority runs. Note: All scheduling.

Avishai Wool lecture Priority Scheduling Idea: Jobs are assigned priorities. Always, the job with the highest priority runs. Note: All scheduling.
Computer Science 162 Discussion Section Week 2. Agenda Recap “What is an OS?” and Why? Process vs. Thread “THE” System.

Computer Science 162 Discussion Section Week 2. Agenda Recap “What is an OS?” and Why? Process vs. Thread “THE” System.
Threads 1 CS502 Spring 2006 Threads CS-502 Spring 2006.

Threads 1 CS502 Spring 2006 Threads CS-502 Spring 2006.
OS Spring’03 Introduction Operating Systems Spring 2003.

OS Spring’03 Introduction Operating Systems Spring 2003.
CSE451 Processes Spring 2001 Gary Kimura Lecture #4 April 2, 2001.

CSE451 Processes Spring 2001 Gary Kimura Lecture #4 April 2, 2001.
CPS110: Implementing threads/locks on a uni-processor Landon Cox.

CPS110: Implementing threads/locks on a uni-processor Landon Cox.
Threads CS 416: Operating Systems Design, Spring 2001 Department of Computer Science Rutgers University

Threads CS 416: Operating Systems Design, Spring 2001 Department of Computer Science Rutgers University
Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)

Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)
CSE 451: Operating Systems Autumn 2013 Module 6 Review of Processes, Kernel Threads, User-Level Threads Ed Lazowska 570 Allen.

CSE 451: Operating Systems Autumn 2013 Module 6 Review of Processes, Kernel Threads, User-Level Threads Ed Lazowska 570 Allen.
Operating Systems CSE 411 CPU Management Sept. 29 2006 - Lecture 11 Instructor: Bhuvan Urgaonkar.

Operating Systems CSE 411 CPU Management Sept Lecture 11 Instructor: Bhuvan Urgaonkar.
CS 153 Design of Operating Systems Spring 2015

CS 153 Design of Operating Systems Spring 2015
COSC 3407: Operating Systems Lecture 3: Processes.

COSC 3407: Operating Systems Lecture 3: Processes.
CS 162 Discussion Section Week 1 (9/9 – 9/13) 1. Who am I? Kevin Klues Office Hours:

CS 162 Discussion Section Week 1 (9/9 – 9/13) 1. Who am I? Kevin Klues Office Hours:
Threads Many software packages are multi-threaded Web browser: one thread display images, another thread retrieves data from the network Word processor:

Threads Many software packages are multi-threaded Web browser: one thread display images, another thread retrieves data from the network Word processor:
Implementing Processes and Process Management Brian Bershad.

Implementing Processes and Process Management Brian Bershad.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Threads and Processes.

Operating Systems ECE344 Ashvin Goel ECE University of Toronto Threads and Processes.
Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.

Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.
Processes and Threads CS550 Operating Systems. Processes and Threads These exist only at execution time They have fast state changes -> in memory and.

Processes and Threads CS550 Operating Systems. Processes and Threads These exist only at execution time They have fast state changes -> in memory and.

Similar presentations

Ads by Google