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 hashed page table method, Hashed page table method A general ap...

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

Write a brief note on demand paging, Write a brief note on demand paging. ...

Write a brief note on demand paging. A demand paging is alike to a paging system with swapping. The Processes reside on the secondary memory while we want to implement a proces

PSEUDO CODE FOR PROGRAM, THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PR...

THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PRINT THEM OUT AS AN ADDITION PROBLEM.THE PROGRAM WILL THEN ASK THE USERTO ENTER THE CORRECT ANSWER.IF THE ANSWER IS CORRECT,THE PRO

Explain User-level threads (ult), USER-LEVEL THREADS (ULT) In this lev...

USER-LEVEL THREADS (ULT) In this level the kernel isn't aware of the existence of threads -- All thread management is complete by the application by using a thread library. Th

Explain debugging a multi threaded program, Debugging a multi threaded prog...

Debugging a multi threaded program The following list points out few of the more frequent oversights and errors that can cause bugs in multithreaded programs. 1.    Ephemeral

Memory management, example of first fit best fit and worst fit

example of first fit best fit and worst fit

Multiprogramming, how response times are reduced by allowing time sharing o...

how response times are reduced by allowing time sharing on top of multiprogramming

Explain hierarchical paging, Hierarchical paging Single way is to use a...

Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag

Define a public key encryption system, Define a public key encryption syste...

Define a public key encryption system Allows just the correct receiver to decode the data

Briefly explain the process management in unix., Briefly explain the proces...

Briefly explain the process management in UNIX. UNIX makes use of the easy but powerful process facility that is visible to the user. UNIX follows the model in which the majori

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