Skip to main content

Multi threading operating system

 


Multi threading 

operating system

·         Multi threading is a technique in which a process, executing an application is divided into threads that can run concurrently

·         A thread is a dispatch able unit of work. It includes  a processor context and its own data area for sack .

·         A thread execute sequentially and is interruptible so that the processor can turn to another thread.

·         Thus, a thread represents a light weight process and is the smallest unit of CPU utilization it is like a mini process.

·         A process, on other hand is a collection of one or more threads and associated system resources

·         A thread is not a process by itself. Cannot run on its own. It always run within a process.

·         Thus, a multithreaded process may have multiple execution flows, different once belonging to difficult threads.

 

Multi Threading Operating 

System

A thread is not a process by itself .it cannot run on its own. It always run within a process

 



 

The various States exhibited by windows thread are:

1.       Ready. A ready thread may be scheduling for execution. The kernel dispatcher keeps track of all ready threads and schedules them in priority order.

2.       Standby. A thread that has been selected to run next on a particular processor is said to be in standby state. The thread waits in this state until the processor is made available.

3.       Running the thread that is currently CPU is in running state.it keeps the processor until it is preempted by a higher priority thread or it gets blocked or its time slice expires.

4.       Waiting. A thread enters waiting state when:

(a)    It is blocked on event .

(b)   It voluntarily waits for synchronization purpose.

(c)    An environment subsystem directs the thread to suspend itself.

When waiting condition is satisfied, the thread moves back to ready state if all the resource are available.

5.       Transition. A thread enters this state after waiting if it is ready to run but resources are not available.

6.       Terminated. A thread can be terminated by itself, by another thread or when its parent process terminates.

Comments

Popular posts from this blog

Micro kernel architecture

  Micro kernel  architecture What is Kernel? A kernel is an important part of an OS that manages system resources. It also acts as a bridge between the software and hardware of the computer. It is one of the first program which is loaded on start-up after the bootloader. The Kernel is also responsible for offering secure access to the machine's hardware for various programs. It also decides when and how long a certain application uses specific hardware. What is Microkernel? Microkernel  is a software or code which contains the required minimum amount of functions, data, and features to implement an operating system. It provides a minimal number of mechanisms, which is good enough to run the most basic functions of an operating system. It allows other parts of the operating system to be implemented as it does not impose a lot of policies. Microkernels and their user environments are usually implemented in the C++ or C programming languages with a little bit of assembly. Ho...

Batch Processing Operating System

  Batch processing system ·           Batch processing is one of the oldest method    of running the programs ·           The computer in the past were very large in size and their I/O devices were very different from those that are used today. The job processing was not interactive as it is today. ·           The user did not interact directly with computer system.   ·           The process scheduling , memory management, file management and I/Omanagement functions are quite simple in batch processing system   1.         Process scheduling (i.e. allocation strategy for a processor is typically in order of their arrival i.e. first come first served(FCFS)basis.   2.         Memory management  is done by divi...

Time Sharing System and its Requirements

  Time sharing  system ·           Time sharing refers to the allocation of computer resources in a time dependent fashion to several program simultaneously ·           A time sharing system has many user terminals that are connected to same computer simultaneously. Using these terminal, different users can work on a system at the same time ·           Thus, it uses multi programming with a special CPU scheduling among all the last one, and then again beginning from the first one ·           In time sharing system, the CPU time is divided among all the users on schedule basis. ·           It release the CPU under any of the following three conditions: 1.         When the allotted time slice expires. 2.    ...

Multitasking System

  Multitasking system ·           Technically , multitasking is same as multi programming ·           In a multitasking operating system, s single user can execute multiple programs at the same time ·           We can also say, multitasking is the system capability to work on more than one job or process at the same time. ·           It means that whenever a job needs to perform I/O operation, the cpu can be used for execting some other job                                                        diagram of multi tasking     ·           There are two type of multitasking : 1.       ...

Multilevel Feedback queue scheduling (MFQ)

  Multilevel Feedback queue scheduling (MFQ) ·          Multilevel feedback queue scheduling is an enhancement of multi-levelqueue scheduling. In this scheme, processes can move between the different queue ·          The various processes are separates in different queue on the basis of their CPU Burst Char characteristics ·          If a process consumes a lot of CPU time , it is placed into a lower priority queue. Thus I/O bound and interactive process are placed in the higher priority queue and CPU bound pricesses are in lower priority ·          If a processes waits too long in a lower priority queue it is moved higher priority queue. Such an aging prevents starvation. ·          The top priority queue is given smallest CPU time Quantum ·      ...