Difference among a computer process and thread
Describe difference among a computer process & thread?
Expert
A single process can contain multiple threads which share global data and address space along with other threads running in the similar process, and thus can operate on the similar data set easily. Processes do not share address space and a different mechanism have to be utilized if they are to share data.
If we assume running a word processing program to be a process, then the auto-save and spell check features which happen in the background are different threads of that process which are all operating on the similar data set (your document).
Process:
In computing, a process is an instance of a computer program which is being sequentially executed [1] by a computer system which has the ability to run several computer programs concurrently.
Thread:
A single process may have several executable programs (threads) that work together like a coherent whole. One thread might, for instance, handle error signals, another might send a message regarding the error to the user, while a third thread is executing the actual task.
Why is merging voice and data a major organizational challenge?
Normal 0
What is the order in which GPOs are applied?
Write down steps in the bacterial infection.
Explain what do you mean by the primary mediators?
Code Coverage Heuristics: In many industries, 100% branch coverage is considered a minimum requirement for test adequacy (Bezier 1990). Branch coverage requires that at every branching point in the program all possible branches be taken at least once.
Normal 0 false false
Module Practice: Prepare a set of non-functional requirements, including operational, performance security, and cultural and political for the following sce
Internment camps: The Japanese living in the US were removed from their houses and were put into internment camps. The number was around 120,000. The reason given was that there was a danger of being spy, informing Japan about USA moves. Almost all ca
DFS and BFS Tradeoffs: In general, DFS will have lower memory (space) complexity than BFS since only the information about the states and transitions on the current path needs to be stored. This contrasts with BFS, where all the states and transitions
18,76,764
1940680 Asked
3,689
Active Tutors
1411842
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!