ch4 3
ch4 3
(Textbook - Chapter 4)
Threads
Operating System Concepts – 9th Edition 4.2 Silberschatz, Galvin and Gagne
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 examine issues related to multithreaded
programming
Operating System Concepts – 9th Edition 4.3 Silberschatz, Galvin and Gagne
Motivation
Operating System Concepts – 9th Edition 4.4 Silberschatz, Galvin and Gagne
Multithreaded Server Architecture
Operating System Concepts – 9th Edition 4.5 Silberschatz, Galvin and Gagne
Benefits
Operating System Concepts – 9th Edition 4.6 Silberschatz, Galvin and Gagne
Multicore Programming
Operating System Concepts – 9th Edition 4.7 Silberschatz, Galvin and Gagne
Multicore Programming (Cont.)
Types of parallelism
Data parallelism – distributes subsets of the
same data across multiple cores, same operation
on each
Task parallelism – distributing threads across
cores, each thread performing unique operation
As # of threads grows, so does architectural support
for threading
CPUs have cores as well as hardware threads
Consider Oracle SPARC T4 with 8 cores, and 8
hardware threads per core
Operating System Concepts – 9th Edition 4.8 Silberschatz, Galvin and Gagne
Concurrency vs. Parallelism
Concurrent execution on single-core system:
Operating System Concepts – 9th Edition 4.9 Silberschatz, Galvin and Gagne
Single and Multithreaded Processes
Operating System Concepts – 9th Edition 4.10 Silberschatz, Galvin and Gagne
Amdahl’s Law
Identifies performance gains from adding additional cores
to an application that has both serial and parallel
components
S is serial portion
N processing cores
Operating System Concepts – 9th Edition 4.12 Silberschatz, Galvin and Gagne
Multithreading Models
Many-to-One
One-to-One
Many-to-Many
Operating System Concepts – 9th Edition 4.13 Silberschatz, Galvin and Gagne
Many-to-One
Operating System Concepts – 9th Edition 4.14 Silberschatz, Galvin and Gagne
One-to-One
Each user-level thread maps to kernel
thread
Creating a user-level thread creates a
kernel thread
More concurrency than many-to-one
Number of threads per process
sometimes restricted due to overhead
Examples
Windows
Linux
Solaris 9 and later
Operating System Concepts – 9th Edition 4.15 Silberschatz, Galvin and Gagne
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 with the ThreadFiber
package
Operating System Concepts – 9th Edition 4.16 Silberschatz, Galvin and Gagne
Two-level Model
Similar to M:M, except that it allows a user
thread to be bound to kernel thread
Examples
IRIX
HP-UX
Tru64 UNIX
Solaris 8 and earlier
Operating System Concepts – 9th Edition 4.17 Silberschatz, Galvin and Gagne
Thread Libraries
Operating System Concepts – 9th Edition 4.18 Silberschatz, Galvin and Gagne
Pthreads
Operating System Concepts – 9th Edition 4.19 Silberschatz, Galvin and Gagne
Pthreads Example
Operating System Concepts – 9th Edition 4.20 Silberschatz, Galvin and Gagne
Pthreads
Pthreads Example
Example (Cont.)(Cont.)
Operating System Concepts – 9th Edition 4.21 Silberschatz, Galvin and Gagne
Pthreads Code for Joining 10 Threads
Operating System Concepts – 9th Edition 4.22 Silberschatz, Galvin and Gagne
Windows Multithreaded C Program
Operating System Concepts – 9th Edition 4.23 Silberschatz, Galvin and Gagne
Windows Multithreaded C Program (Cont.)
Operating System Concepts – 9th Edition 4.24 Silberschatz, Galvin and Gagne
Java Threads
Operating System Concepts – 9th Edition 4.25 Silberschatz, Galvin and Gagne
Java Multithreaded Program
Operating System Concepts – 9th Edition 4.26 Silberschatz, Galvin and Gagne
Java Multithreaded Program (Cont.)
Operating System Concepts – 9th Edition 4.27 Silberschatz, Galvin and Gagne
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
Operating System Concepts – 9th Edition 4.28 Silberschatz, Galvin and Gagne
Semantics of fork() and exec()
Operating System Concepts – 9th Edition 4.29 Silberschatz, Galvin and Gagne
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 by one of two signal
handlers:
1. default
2. user-defined
Every signal has default handler that kernel runs
when handling signal
User-defined signal handler can override
default
For single-threaded, signal delivered to
process
Operating System Concepts – 9th Edition 4.30 Silberschatz, Galvin and Gagne
Signal Handling (Cont.)
Where should a signal be delivered 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
Operating System Concepts – 9th Edition 4.31 Silberschatz, Galvin and Gagne
Thread Cancellation
Terminating a thread before it has finished
Thread to be canceled is target thread
Two general approaches:
Asynchronous cancellation terminates the target
thread immediately
Deferred cancellation allows the target thread to
periodically check if it should be cancelled
Pthread code to create and cancel a thread:
Operating System Concepts – 9th Edition 4.32 Silberschatz, Galvin and Gagne
Thread Cancellation (Cont.)
Invoking thread cancellation requests cancellation,
but actual cancellation depends on thread state
Operating System Concepts – 9th Edition 4.33 Silberschatz, Galvin and Gagne
Thread-Local Storage
Operating System Concepts – 9th Edition 4.34 Silberschatz, Galvin and Gagne
Scheduler Activations
Both M:M and Two-level models
require communication to maintain
the appropriate number of kernel
threads allocated to the application
Typically use an intermediate data
structure between user and kernel
threads – lightweight process (LWP)
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
Operating System Concepts – 9 Edition
th 4.35
correct Silberschatz, Galvin and Gagne
End of Chapter 4