Week 3 - Threads
Processes and Threads
Processes have two characteristics:
- Resource Ownership
- process includes a virtual address space to hold the process image
- the OS performs a protection function to prevent unwanted interference between processes with respect to resources
- follows an execution path that may be interleaved with other processes
- a process has an execution state (Running, Ready, etc.) and a dispatching priority and is scheduled and dispatched by the OS
These two characteristics are treated independently by modern operating systems:
- the unit of dispatching is referred to as a `thread` or lightweight process
- the unit of resource ownership is referred to as a `process` or `task`
The ability of an OS to support multiple, concurrect paths of execution within a single process
The unit of resource allocation and a unit of protection.
A process is associated with:
- A virtual address space which holds the process image
- Protected access to
- Other processes
- I/O resources
Multiple threads in Process
Each thread has:
- Access to the memory and resources of its process (all threads of a process share this)
- An execution state (running, ready, etc.)
- Saved thread context when not running
- An execution stack
- Some per-thread static storage for local variables
Single-Threaded vs multi threaded
- Both have
Process Control Block
- Both have
User Address Space
- Single thread has a
User Stack and
- Multithread process has a
Thread Control Block within each thread
In OS that supports threads: scheduling and dispatching done on thread basis
- Most of the state info dealing with execution is maintained in thread-level data structures
- Several actions that affect all of the threads in a process and that the OS must manage at the process level
- Suspending process means all threads of a process
- Terminates a process terminates all threads within the process
- Similar to processes, threads have execution states and may synchronize with one another.
Thread Execution States
Three basic states
Operations associated with a change in thread state
- Spawn (another thread)
- allocate register context and stacks
- move to an event queue waiting for the event
- issue: will blocking a thread block other, or all, threads within the same process?
- moved the the
Ready queue for execution
- Finish (thread)
- de-allocate register context and stacks
Necessity to sync activities of all threads and prevent interference between each other.
- all threads of a process share the same address space and other resources
- any alteration of a resource by one thread affects the other threads in the same process
In general, the techniques used for thread sync are the same as those for process sync.
Types of Threads
- User Level Thread (ULT)
- Kernel Level Thread (KLT)
- also called kernel-supported threads or lightweight threads
Thread management all done by application.
- Multithreading is managed by a runtime threads lib
The kernel is not aware of the existence of threads
- Only schedule the process as a unit and assigns a single execution state to that process
Disadvantages of ULT
In a typical OS many system calls are blocking
- as a result, when a ULT executes a system call, not only is the thread blocked, but all within the process are blocked
In a pure ULT strategy, multithreaded applications cannot take advantage of multiprocessing.
Kernel maintains context information for the process and the threads.
- No thread management done by application
Scheduling is done on a thread basis.
Windows is an example of this approach.
Advantages of KLT
The kernel can simultaneously schedule multiple threads from the same process on multiple processors.
If one thread is blocked, the kernel schedules another thread of the same process.
Kernel routines themselves can be multithreaded.
Multicore & Multithreading
Achieves concurrency without the overhead of using multiple processes.
Threads within the same process can exchange information through their common address space and have access to the shared resources of the process.
- Threads of any process can run on any processor
- Soft affinity:
- dispatcher tries to assign a ready thread to the same processor it last ran on
- helps reuse data still in that processor's memory caches from the previous execution of the thread
- Hard affinity:
- an application restricts thread execution to certain processors
- Dividing activities
- Data splitting
- Data dependency
- Testing and debugging
Linux uses the same internal representation for processes and threads; a thread is simply a new process (or task) that happens to share the same address space as its parent.
A distinction is only made when a new thread is created by the
clone system call
- `fork` creates a new process with its own entirely new process context
- `clone` creates a new process with its own identity, but that is allowed to share the data structures of its parent
clone gives the application fine-grained control over exactly what is shared between two threads.
|File-system info is shared|
|The same mem space is shared|
|Signal handlers are shared|
|The set of open files are shared|
Processes and servies provided by the Windows Kernel are relatively simple and general purpose.
- implemented as objects
- created as new process or a copy of an existing process
- exec proc may contain one or more threads
- both procs and thread objects have built-in sync capabilities
Windows makes use of two types of process-related objects:
– an entity corresponding to a user job or application that owns resources
– a dispatchable unit of work that executes sequentially and is interruptible