CPSC 213 Concurrent Programming with Threads disk reads as - PowerPoint PPT Presentation

Reading The Virtual Processor Illusion of Synchrony ‣ Text ‣ Originated with Edsger Dijkstra in the THE Operating System ‣ Multiple things co-existing on the same physical CPU • in The Structure of the “THE” Multiprogramming System, 1968 CPSC 213 •Concurrent Programming with Threads • disk reads as motivation (huge disk/CPU speed mismatch) “I had had extensive experience (dating back to 1958) in making basic software dealing • supporting this illusion is a core purpose of operating system •2ed: 12.3 with real-time interrupts , and I knew by bitter experience that as a result of the irreproducibility of the interrupt moments a program error could present itself - scheduler decides what thing to run next •1ed: 13.3 misleadingly like an occasional machine malfunctioning. As a result I was terribly ‣ Threads afraid . Having fears regarding the possibility of debugging, we decided to be as careful as possible and, prevention being better than cure, to try to prevent nasty bugs from entering the construction. • multiple flows within a single program • example use: loading big file while maintaining responsive user interface This decision, inspired by fear, is at the bottom of what I regard as the group's main Introduction to Computer Systems contribution to the art of system design.” ‣ Processes ‣ The Thread (as we now call it) • multiple programs running on single CPU • a single thread of synchronous execution of a program • example use: email and browser and game and debugger - the illusion of a single system such as the Simple Machine Unit 2b • can be stopped and restarted • more on how we manage to do this later (with virtual memory) - stopped when waiting for an event (e.g., completion of an I/O operation) Threads ‣ Multiprocessor systems - restarted with the event fires • can co-exist with other processes sharing a single hardware processor • multiple CPUs - a scheduler multiplexes processes over processor - each CPU can have multiple processes, each process can have multiple threads - synchronization primitives are used to ensure mutual exclusion and for waiting and signalling 1 2 3 4 Thread Revisiting the Disk Read Synchronous Disk Read using Threads Threads in Java √ unblock x block ‣ Create a procedure that can be executed by a thread ‣ An abstraction for execution ‣ A program that reads a block from disk asyncRead do something else while waiting nowHaveBlock • looks to programmer like a sequential flow of execution, a private CPU • want the disk read to be synchronous •build a class that implements the Runnable interface CPU • it can be stopped and started, it is sometimes running and sometimes not read (buf, siz, blkNo); // read siz bytes at blkNo into buf ‣ Create two threads that CPU runs, one at a time class ZotRunnable implements Runnable { nowHaveBlock (buf, siz); // now do something with the block • the physical CPU thus now multiplexes multiple threads at different times Integer result, arg; ZotRunnable (Integer anArg) { foo • but, it is asynchronous so we have this ‣ Creating and starting a thread •one for disk read arg = anArg; } •one for doSomethingElse • like an asynchronous procedure call asyncRead (buf, siz, blkNo, nowHaveBlock ); public void run() { doSomethingElse (); result = zot (arg); ‣ Illusion of synchrony • starts a new thread of control to execute a procedure bar zot } ‣ As a timeline } ‣ Stopping and re-starting a thread •disk read blocks while waiting for disk to complete • two processors • stopping a thread is called blocking •CPU runs other thread(s) while first thread is blocked ‣ Create a thread to execute the procedure and start it • two separate computations join • a blocked thread can be re-started (i.e., unblocked) •disk interrupt restarts the blocked read asyncRead do something else while waiting nowHaveBlock ZotRunnable zot = new ZotRunnable (0); ‣ Joining with a thread Thread t = new Thread (zot); asyncRead (buf, siz, blkNo); interruptHandler () { t.start(); • blocks the calling thread until a target thread completes CPU waitForInterrupt (); signalBlockedThread(); nowHaveBlock (buf, siz); } • returns the return value of the target-thread’s starting procedure disk controller • turns thread create back into a synchronous procedure call bat perform disk read 5 6 7 8 UThread : A Simple Thread System for C Example Program using UThreads Example: Yield vs Join ‣ Later join with thread to get zot’s return value Integer result; ‣ The UThread Interface file (uthread.h) void ping () { void ping () { try { int i; int i; t. join (); for (i=0; i<100; i++) { for (i=0; i<100; i++) { struct uthread_TCB; result = zot.result; printf ("ping %d\n",i); fflush (stdout); printf ("ping %d\n",i); fflush (stdout); typedef struct uthread_TCB uthread_t; } catch (InterruptedException ie) { uthread_yield (); uthread_yield (); result = null; } } void uthread_init (int num_processors); } } } uthread_t* uthread_create (void* (*star_proc)(void*), void* start_arg); void uthread_yield (); void* uthread_join (uthread_t* thread); void pong () { void pong () { void uthread_detach (uthread_t* thread); ‣ So that the entire calling sequence is int i; int i; uthread_t* uthread_self (); for (i=0; i<100; i++) { for (i=0; i<100; i++) { foo ‣ Explained printf ("pong %d\n",i); fflush (stdout); printf ("pong %d\n",i); fflush (stdout); foo (); uthread_yield (); uthread_yield (); ZotRunnable zot = new Zot Runnable (0); • uthread_t is the datatype of a thread control block } } Thread t = new Thread (zot); bar zot } } t. start (); • uthread_init is called once to initialize the thread system bar (); Integer result = null; • uthread_create create and start a thread to run specified procedure void ping_pong () { void ping_pong () { void ping_pong () { join try { t. join (); • uthread_yield temporarily stop current thread if other threads waiting uthread_init (1); uthread_init (1); uthread_init (2); result = zot.result; uthread_create (ping, 0); uthread_create (ping, 0); uthread_create (ping, 0); • uthread_join join calling thread with specified other thread } catch (InterruptedException ie) { uthread_create (pong, 0); uthread_create (pong, 0); uthread_create (pong, 0); } while (1) while (1) uthread_join (ping_thread); • uthread_detach indicate no thread will join specified thread bat (); uthread_yield (); uthread_yield (); uthread_join (pong_thread); bat • uthread_self a pointer to the TCB of the current thread } } } 9 10 11 12 Implement Threads: Some Questions Implementing UThreads: Data Structures Thread Data Structure Diagram Thread Status State Machine ‣ The key new thing is blocking and unblocking ‣ Thread State Ready Queue Thread Control Stacks •what does it mean to stop a thread? •running: register file and runtime stack Blocks d l e Nascent Y i •what happens to the thread? •stopped: Thread Control Block and runtime stack Create r5 Running ‣ Thread-Control Block (TCB) TCBa •what happens to the physical processor? RUNNING ‣ What data structures do we need •thread status: (NASCENT, RUNNING, RUNNABLE, BLOCKED, or DEAD) Block C •pointers to thread’s stack base and top of its stack o e Runnable l u d h e m •scheduling parameters such as priority, quantum, pre-emptability etc. c S TCBb p ‣ Ready/Runnable Queue RUNNABLE l e t e •list of TCB’s of all RUNNABLE threads Blocked ‣ What basic operations are required U n b l o c ‣ One or more Blocked Queues k TCBc •list of TCB’s of BLOCKED threads RUNNABLE Freed Dead Join or Detach 13 14 15 16