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

Scheduling Algorithms

     Scheduling Algorithms CPU scheduling algorithm deal with the problem of deciding which of the processes in the ready queue is to be allocated the CPU . six commonly used scheduling algorithms are: 1. first-come First-served(FCFS) 2. Shortest job First(SJF) 3. Priority scheduling 4. Round-Robin Scheduling(RR) 5. Multi-Level Queue Scheduling(MLQ) 6. Multi-Level Feedback Queue Scheduling (MFQ)       First-Come First-Served Scheduling (FCFS) ·       It is simplest and the most straight forward of all scheduling algorithms. ·       In this scheduling, the process that request the CPU first is allocated CPU first. Thus   the name first come first served. ·       We can say that in FCFS scheduling, a process is allocated CPU time according to the arrival time of a process. ·       The implementation of FCFS policy is easily manged with a FIFO queue...

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.    ...

What is RAM and Why is it Important?

  What is RAM and Why is it Important? Random access memory (RAM) is a computer's short-term memory. None of your programs, files, or Netflix streams would work without RAM, which is your computer’s working space. But what is RAM exactly? In this article, we explain what RAM means in computer terms and why it’s important. What does RAM stand for? RAM is short for “random access memory” and while it might sound mysterious, RAM is one of the most fundamental elements of computing. RAM is the super-fast and temporary data storage space that a computer needs to access right now or in the next few moments. What is RAM and Why is it Important? Random access memory (RAM) is a computer's short-term memory. None of your programs, files, or Netflix streams would work without RAM, which is your computer’s working space. But what is RAM exactly? In this article, we explain what RAM means in computer terms and why it’s important. What does RAM stand for? RAM is short for “random access memo...

Multi user Operating System

  Multi user operating system ·           In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. ·           The access is provided using a network that consists of various personal computer attached to a mainframe computer system.                                                              diagram of multi -user operating system       ·           The various personal computer can send and receive information to mainframe computer system. ·           The example    of multi-user OS are UNIX, windows 2000,novell netware.            sing...

System structure operating architecture

  System structure operating  architecture An operating system is a construct that allows the user application programs to interact with the system hardware. Since the operating system is such a complex structure, it should be created with utmost care so it can be used and modified easily. An easy way to do this is to create the operating system in parts. Each of these parts should be well defined with clear inputs, outputs and functions. Simple Structure There are many operating systems that have a rather simple structure. These started as small systems and rapidly expanded much further than their scope. A common example of this is MS-DOS. It was designed simply for a niche amount for people. There was no indication that it would become so popular. An image to illustrate the structure of MS-DOS is as follows − It is better that operating systems have a modular structure, unlike MS-DOS. That would lead to greater control over the computer system and its various applications. T...