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

Deadlock, Suppose we have 3 processes running at the same time as shown in ...

Suppose we have 3 processes running at the same time as shown in the following table. Each resource only has one instance. Show a possible scenario of resource allocation that r

Mechanism for code and data sharing, Q. Consider a system in which a progr...

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data

What is the occupation of the object manager, Q. What is the occupation of ...

Q. What is the occupation of the object manager? Answer: Substance present a generic set of kernel mode interfaces to user mode programs. Objects are influenced by the execut

Explain worst fit algorithm, Worst Fit Algorithm Here we obtain the la...

Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we

What is low-level formatting, What is low-level formatting? Before a di...

What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form

Explain lru approximation page replacement, LRU approximation page replacem...

LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for

Multilevel page table, what is multilevel page table and its applications?

what is multilevel page table and its applications?

Why page sizes always powers of 2, Q. Why page sizes always powers of 2? ...

Q. Why page sizes always powers of 2? Answer: Recall that paging is executed by breaking up an address into a page and offset number. It is most competent to break the address

What is preemptive and nonpreemptive scheduling, What is preemptive and non...

What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C

Can broadcast packets pass between networks, Q. Why would it be an awful id...

Q. Why would it be an awful idea for gateways to pass broadcast packets between networks? What would be the merite of doing so? Answer: All broadcasts would be spreads to all

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