Chapter 4: Multi-Threaded Programming

Transcription

1 Chapter 4: Multi-Threaded Programming

2 Chapter 4: Threads 4.1 Overview 4.2 Multicore Programming 4.3 Multithreading Models 4.4 Thread Libraries Pthreads Win32 Threads Java Threads 4.5 Implicit Threading 4.6 Threading Issues 4.7 Operating-System Examples 4.2

3 4.1 Overview Thread a basic unit of CPU utilization thread ID, program counter, register set, stack, etc. share with other threads belonging to the same process code section, data section open files, signals traditional (or heavyweight) process: a single thread of control 4.3

4 Single and Multithreaded Processes 4.4

5 Benefits Responsiveness The program continues even if part of it is blocked Resource Sharing Sharing code and data allows an application to have several different threads Economy More economical to create and context-switch threads In Solaris, creating a process is about 30x slower Utilization of MP Architectures Threads may be running in parallel 4.5

6 4.2 Multicore Programming Multicore systems putting pressure on programmers, challenges include Dividing activities Balance Data splitting Data dependency Testing and debugging 4.6

7 Multithreaded Server Architecture 4.7

8 Concurrent Execution on a Single-core System 4.8

9 Parallel Execution on a Multicore System 4.9

10 4.3 Multithreading Models Types of Threads User Threads Thread management done by user-level threads library Three primary thread libraries: POSIX Pthreads Win32 threads Java threads Kernel Threads Supported by the Kernel Examples: Windows XP/2000, Solaris, Linux, Tru64 UNIX, Mac OS X Multithreading Models Many-to-One One-to-One Many-to-Many Two-level 4.10

11 Many-to-One Many user-level threads mapped to single kernel thread Examples: Solaris Green Threads GNU Portable Threads 4.11

12 Many-to-One Model 4.12

13 One-to-One Each user-level thread maps to kernel thread Examples Windows NT/XP/2000 Linux Solaris 9 and later 4.13

14 One-to-one Model 4.14

15 Many-to-Many Model Allows many user level threads to be mapped to many kernel threads Allows the operating system to create a sufficient number of kernel threads Solaris prior to version 9 Windows NT/2000 with the ThreadFiber package 4.15

16 Many-to-Many Model 4.16

17 Two-level Model Similar to the many-to-many model, except that it allows a user thread to be bound to kernel thread Examples IRIX HP-UX Tru64 UNIX Solaris 8 and earlier 4.17

18 Two-level Model 4.18

19 4.4 Thread Libraries Thread library: API for creating and managing threads Two primary implementation approaches 1. Entirely in user space with no kernel support All code and data structure in user space Invoke a local function call rather than a system call 2. Supported directly by OS Exist in kernel space Invoke a thread function typically resulting in a system call Three main thread libraries 1. POSIX Pthreads 2. Win32 threads 3. Java threads 4.19

20 Pthreads A POSIX standard (IEEE c) API for thread creation and synchronization API specifies behavior of the thread library, implementation is up to development of the library Common in UNIX operating systems (Solaris, Linux, Mac OS X) Example: Figure 4.9 at Page

21 Win32 Threads Implements the one-to-one mapping Each thread contains A thread id Register set Separate user and kernel stacks Private data storage area The register set, stacks, and private storage area are known as the context of the threads The primary data structures of a thread include: ETHREAD (executive thread block) KTHREAD (kernel thread block) TEB (thread environment block) Example: Figure 4.10 at Page

22 Java Threads Java threads are managed by the JVM Java threads may be created by two approaches: Extend Thread class Define a class that Implements the Runnable interface Actually created by the start() method rather by creating a thread object Allocate memory and initialize a new thread Call the run() method Six states New Terminated Runnable Blocked: waits to acquire a lock Waiting/Timed waiting: waits for an action by another thread, i.e. join() Example: Figure 4.11 at Page 165 Figures : Factory class with producer and consumer threads 4.22

23 4.5 Implicit Threading Implicit threading: transferring the creation and management of threading from application developers to compilers and run-time libraries Three approaches Thread Pools OpenMP Grand Central Dispatch 4.23

24 4.5.1 Thread Pools Simple approach: Create a separate thread to serve a request whenever the server receives the request Advanced approach: Create a number of threads in a pool where they await work Advantages: Usually slightly faster to service a request with an existing thread than create a new thread Allows the number of threads in the application(s) to be bound to the size of the pool Separating task to be performed from mechanics of creating task allows different strategies for running task i.e.tasks could be scheduled to run periodically Windows API supports thread pools: 4.24

25 4.5.2 OpenMP Set of compiler directives and an API for C, C++, FORTRAN Provides support for parallel programming in shared-memory environments Identifies parallel regions blocks of code that can run in parallel #pragma omp parallel Create as many threads as there are cores #pragma omp parallel for for(i=0;i<n;i++) { c[i] = a[i] + b[i]; } Run for loop in parallel 4.25

26 4.5.3 Grand Central Dispatch Apple technology for Mac OS X and ios operating systems Extensions to C, C++ languages, API, and run-time library Allows identification of parallel sections Manages most of the details of threading Block is in ^{ } - ˆ{ printf("i am a block"); } Blocks placed in dispatch queue Assigned to available thread in thread pool when removed from queue Two types of dispatch queues: serial blocks removed in FIFO order, queue is per process, called main queue Programmers can create additional serial queues within program concurrent removed in FIFO order but several may be removed at a time Three system wide queues with priorities low, default, high 4.26

27 4.6 Threading Issues Semantics of fork() and exec() system calls Thread cancellation Signal handling Thread-local storage Scheduler activations 4.27

28 4.6.1 Semantics of fork() and exec() Does fork() duplicate only the calling thread or all threads? depending on OS, typically have two versions of fork() 4.28

29 4.6.2 Thread Cancellation Terminating a thread before it has finished Two general approaches: Asynchronous cancellation terminates the target thread immediately may not free a necessary system-wide resource Deferred cancellation allows the target thread to periodically check if it should be cancelled The thread can be canceled at a point when it can be canceled safely. called cancellation points in Pthreads 4.29

30 4.6.3 Signal Handling Signals are used in UNIX systems to notify a process that a particular event has occurred A signal handler is used to process signals 1. Signal is generated by particular event 2. Signal is delivered to a process 3. Signal is handled Options: Deliver the signal to the thread to which the signal applies Deliver the signal to every thread in the process Deliver the signal to certain threads in the process Assign a specific thread to receive all signals for the process 4.30

31 4.6.4 Thread-Local Storage Allows each thread to have its own copy of data Example: each transaction in a transaction-processing system is served in a separate thread Most thread libraries provide this. 4.31

32 4.6.5 Scheduler Activations Both M:M and Two-level models require communication between the kernel and thread library to maintain the appropriate number of kernel threads allocated to the application lightweight process (LWP): an intermediate data structure between the user and kernel threads to implement threads; like a virtual processor attached to a kernel thread, which is scheduled by OS The kernel provides an application with a set of virtual processors (LWPs) The thread library schedule user threads onto an available virtual processor Scheduler activation provides upcalls - a communication mechanism from the kernel to the thread library The kernel inform an application about certain events eg. informing that a thread is about to block, or now eligible to run This communication allows an application to maintain the correct number of kernel threads 4.32

33 Summary 4.1 Overview 4.2 Multicore Programming 4.3 Multithreading Models 4.4 Thread Libraries Pthreads Win32 Threads Java Threads 4.5 Implicit Threading 4.6 Threading Issues 4.7 Operating-System Examples 4.33