What are the differences between process and thread, Operating System

Assignment Help:

What are the differences between process and thread?

The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and thus consumes quite a bit of memory. A thread is nothing but a separate implementation context within a single program every thread shares all the memory with the other threads with the exception of just a small amount of per-thread memory so that the operating system can keep track of the execution context of each thread.

In practice several more threads can run on a given amount of memory than the same number of processes, for the reason that each individual thread uses much less memory. As well, operating systems be able to handle significantly more threads than individual processes because multi-threading is typically much more efficient. I.e. the amount of CPU time per thread is lesser than the amount of time per process.

Creating an individual thread is as well a much faster and less memory intensive task than creating a new process. Therefore, programs which destroy and create threads quickly will be much faster and more efficient than programs that create and destroy processes quickly. by individual threads for separate tasks is so much more efficient than using separate processes

From the Unix point of view it may be different for a given language all threads of a same process share the same address space the code from one of them can access to a variable of another. This isn't true for processes: if one seeks to access to another's memory Unix will kill him.

1) Threads aren't independent like process.

2) All threads are able to access every address in the task unlike process.

3) Threads are designed to help one another and process might or not might be assisted     on one another.

4) Thread is nothing but flow of implementation whereas process is nothing but a group of instructions which is similar to that of a program except which may be stopped and started by the OS itself.

5) Different processes cannot work under same memory location. They have their personal individual working memory segment. But the threads are able to work under the same memory area. Even they are able to access any memory location.

 6) Procedure has the overhead of making all the work within it orderly and as well sum up them. However threads are done for a single unit of task only and at completion their work is all over

7). Multiple processes need the resources explicitly to work with. They are least apprehensive about the sharing them that is why when a system implements a multi process system it is expensive as compared to multi-threaded system  because the threads have excellent strategy to share the things.

8) One process is able to run on more than one thread.


Related Discussions:- What are the differences between process and thread

Explain parsing, What is parsing Parsing is the procedure of analyzing ...

What is parsing Parsing is the procedure of analyzing a text, made of a sequence of tokens, to define its grammatical structure regarding to a given formal grammar. Parsing is

Android development, Developing an application for android encompass differ...

Developing an application for android encompass different steps as follows: Setup:  Development environment is prepared during this phase. This includes downloading and installi

Determine a critical section is a program segment, Determine a critical sec...

Determine a critical section is a program segment  Critical section is where shared resources are accessed

Keeping track of free memory, How do we keep track of where the free pieces...

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size

Can we call trap as an interrupt??, is there any difference between the tra...

is there any difference between the trap and interrupt??

Semaphores, Synchronization can be achieved by means other than locks and c...

Synchronization can be achieved by means other than locks and condition variables. One alternative is semaphores. A semaphore is used to regulate traf?c in a critical section. A se

How is it different from the unbounded buffer algori, How is it different f...

How is it different from the unbounded buffer algorithm ? Explain.

Algorithm for reconstructing a logical ring, Q. Present an algorithm for re...

Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

Define a election algorithm, Consider a setting where processors are not as...

Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd