1 / 38

Chapter 4: Threads

Chapter 4: Threads. Layout. Multicore Programming Multithreading Models Thread Libraries Implicit Threading Threading Issues Operating System Examples. Objectives. To introduce the notion of a thread

von
Download Presentation

Chapter 4: Threads

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 4: Threads

  2. Layout • Multicore Programming • Multithreading Models • Thread Libraries • Implicit Threading • Threading Issues • Operating System Examples

  3. Objectives • To introduce the notion of a thread • a fundamental unit of CPU utilization that forms the basis of multithreaded computer systems • To discuss the APIs for • the Pthreads • Windows, and • Java thread libraries • To explore several strategies that provide implicit threading • To examine issues related to multithreaded programming • To cover OS support for threads • Windows • Linux

  4. Motivation • Simple and efficient • Thread creation is light-weight • Process creation is heavy-weight • Multiple tasks can be implemented by separate threads • Update display • Fetch data • Spell checking • Answer a network request • Most modern applications are multithreaded • OS Kernels

  5. Multithreaded Server Architecture

  6. Benefits • Responsiveness • allow continued execution if part of process is blocked • Resource Sharing • threads share resources of process • Economy • cheaper than process creation • thread switching lower overhead than context switching • Scalability • process can take advantage of multiprocessor architectures

  7. 1. Multicore Programming • Challenges • Putting pressure on programmers • Dividing activities • Balance • Data splitting • Data dependency • Testing and debugging • Parallelism • implies a system can perform more than one task simultaneously • Data parallelism-distribute data across m-cores • Task parallelism-distribute threads across cores • Concurrency • supports more than one task making progress • Single processor / core, scheduler providing concurrency

  8. Concurrency vs. Parallelism • Concurrent execution on single-core system: • Parallelism on a multi-core system:

  9. Single and Multithreaded Processes

  10. Amdahl’s Law • Identifies performance gains • adding additional cores to an application that has both serial and parallel components • S is serial portion • N processing cores • Example • if application is 75% parallel / 25% serial, moving from 1 to 2 cores results in speedup of 1.6 times

  11. User Threads and Kernel Threads • User threads • 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 • Solaris • Linux • Tru64 UNIX • Mac OS X

  12. 2. Multithreading Models • Many-to-One • One-to-One • Many-to-Many

  13. Many-to-One • Many user-level threads single kernel thread • One thread blocking causes all to block • Multiple threads may not run in parallel on multicore system • because only one user thread may access the kernel at a time • Few system uses it • Because inability to take advantage of multiple processing cores • Examples: • Solaris Green Threads • GNU Portable Threads

  14. One-to-One • Each user-level thread kernel thread • Drawback • Creating a user-level thread requires creation of corresponding kernel thread • More concurrency than many-to-one • # threads per process is restricted due to overhead • Examples • Windows NT/XP/2000 • Linux • Solaris 9 and later

  15. Many-to-Many Model • many user level threads many kernel threads • OS creates a sufficient number of kernel threads • Example • Solaris prior to version 9 • Windows NT/2000 with the ThreadFiber package

  16. Two-level Model • Similar to M:M • Difference: allows a user-level thread to be bound to a kernel thread • Examples • IRIX • HP-UX • Tru64 UNIX • Solaris 8 and earlier

  17. 3. Thread Libraries • POSIX Pthreads • Win32 threads • Java threads • Provides programmer with API • creating and managing threads • Two primary ways of implementing • Library entirely in user space • Kernel-level library supported by the OS

  18. Pthreads • May be provided either as user-level or kernel-level • A POSIX standard (IEEE 1003.1c) API • thread creation and synchronization • Specification, not implementation • specifies behavior of the thread library • implementation is up to development of the library • Common in UNIX operating systems • Solaris • Linux • Mac OS X

  19. Pthreads Example

  20. Pthreads Example (Cont.)

  21. Pthreads Code for Joining 10 Threads

  22. Win32 API Multithreaded C Program (skip)

  23. Win32 API Multithreaded C Program (Cont.)

  24. Java Threads • Managed by the JVM • Typically implemented • using the threads model provided by underlying OS • May be created by: • Extending Thread class • Implementing the Runnable interface

  25. Java Multithreaded Program

  26. Java Multithreaded Program (Cont.)

  27. 4. Threading Issues • Semantics of fork() and exec() system calls • Signal handling • Synchronous and asynchronous • Thread cancellation of target thread • Asynchronous or deferred • Thread-local storage • Scheduler Activations

  28. Semantics of fork() and exec() • How fork()works • duplicate the calling thread in the new process? or • Duplicate all the threads in the new process? • How Exec() works • New executed process will replace the entire running process • Including all threads

  29. Signal Handling • Signals • used in UNIX systems to notify a process that a particular event has occurred • A signal handler • used to process signals generated by particular event or delivered to a process • Type • Default—kernel runs • user-defined • User-defined signal handler can override default • For single-threaded, signal is delivered to process • For multi-threaded • 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

  30. Thread Cancellation • Asynchronous cancellation • terminates the target thread immediately • Deferred cancellation • allows the target thread to periodically check if it should be cancelled • Example • Pthread code to create and cancel a thread:

  31. Thread Cancellation (Cont.) • Actual cancellation depends on thread state • If cancellation disabled • cancellation remains pending until thread enables it • Default type is deferred • For Linux systems • thread cancellation is handled through signals

  32. Thread-Local Storage (TLS) • Each thread has its own copy of data • Useful when you do not have control over the thread creation process • TLS vs. local variables • Local variables visible only during single function invocation • TLS is visible across function invocations • TLS is unique to each thread

  33. Scheduler Activations (Skip) • Lightweight process (LWP) • an intermediate data structure between user and kernel threads • Appears to be a virtual processor on which process can schedule user thread to run • Each LWP attached to kernel thread • How many LWPs to create? • Scheduler activations • provide upcalls • a communication mechanism from the kernel to the upcall handler in the thread library • This communication allows an application to maintain the correct number kernel threads

  34. 5. Operating System Examples Windows XP Threads Linux Thread

  35. Windows Threads • One-to-one mapping, kernel-level • Each thread contains • A thread id • Register set representing state of processor • Separate user and kernel stacks when thread runs in user mode or kernel mode • Private data storage area used by run-time libraries and dynamic link libraries (DLLs) • Context of a thread • The register set, stacks, and private storage area • The primary data structures • ETHREAD (executive thread block) • includes pointer to process to which thread belongs and to KTHREAD, in kernel space • KTHREAD (kernel thread block) • scheduling and synchronization info, kernel-mode stack, pointer to TEB, in kernel space • TEB (thread environment block) • thread id, user-mode stack, thread-local storage, in user space

  36. Windows XP Threads Data Structures

  37. Linux Threads • Called tasks rather than threads • creation • through clone()system call • clone() • allows a child task to share the address space of the parent task (process) • structtask_struct • points to process data structures (shared or unique)

  38. End of Chapter 4

More Related