Thread is a single sequence stream within a process. Threads have same properties as of the process so they are called as light weight processes. Threads are executed one after another but gives the illusion as if they are executing in parallel. Each thread has different states. Each thread has
- A program counter
- A register set
- A stack space
Threads are not independent of each other as they share the code, data, OS resources etc.
Similarity between Threads and Processes –
- Only one thread or process is active at a time
- Within process both execute sequentiall
- Both can create children
Differences between Threads and Processes –
- Threads are not independent, processes are.
- Threads are designed to assist each other, processes may or may not do it
Types of Threads:
- User Level thread (ULT) –
Is implemented in the user level library, they are not created using the system calls. Thread switching does not need to call OS and to cause interrupt to Kernel. Kernel doesn’t know about the user level thread and manages them as if they were single-threaded processes.
Advantages of ULT –
- Can be implemented on an OS that does’t support multithreading.
- Simple representation since thread has only program counter, register set, stack space.
- Simple to create since no intervention of kernel.
- Thread switching is fast since no OS calls need to be made.
Disadvantages of ULT –
- No or less co-ordination among the threads and Kernel.
- If one thread causes a page fault, the entire process blocks.
- Kernel Level Thread (KLT) –
Kernel knows and manages the threads. Instead of thread table in each process, the kernel itself has thread table (a master one) that keeps track of all the threads in the system. In addition kernel also maintains the traditional process table to keep track of the processes. OS kernel provides system call to create and manage threads.
Advantages of KLT –
- Since kernel has full knowledge about the threads in the system, scheduler may decide to give more time to processes having large number of threads.
- Good for applications that frequently block.
Disadvantages of KLT –
- Slow and inefficient.
- It requires thread control block so it is an overhead.
- Each ULT has a process that keeps track of the thread using the Thread table.
- Each KLT has Thread Table (TCB) as well as the Process Table (PCB).
- File System Implementation in Operating System
- System Programs in Operating System
- System Protection in Operating System
- Types of Operating Systems
- Web Operating System
- Kernel in Operating System
- Best-Fit Allocation in Operating System
- Multithreading in Operating System
- Functions of Operating System
- Bad Block in Operating system
- Concurrency in Operating System
- Segmentation in Operating System
- Paging in Operating System
- Thread in Operating System
- Inode in Operating System
- Introduction of Operating System - Set 1
- Precedence Graph in Operating System
- Swap Space in Operating System
- Recovery from Deadlock in Operating System
- Bernstein's Conditions in Operating System