Tuesday, January 15, 2008. 1 What are the major difference between deadlock, starvation, and race? Describes a situation where two or more threads are blocked forever, waiting for each other. Starvation is the result of conservative allocation of resources which a single job is prevented from execution because its kept waiting for resources that never become available. Race is a synchronization problem between two processes vying for the same resource. 2 real life examples of deadlock, starvation and race.

Tuesday, January 15, 2008. 1 The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Starvation, however is the allocation of resource that prevents one job to be executed. Race occurs before the process has been started. Classmate get his pen back.

Thursday, December 13, 2007. Why is it used? B Internal fragmentation. How this it occur? Internal fragmentation occurs when storage is allocated without ever intending to use it. While this seems foolish, it is often accepted in return for increased efficiency or simplicity. Why is it needed? They could be divi.

Tuesday, January 15, 2008. 1What are the major differences between deadlock, starvation, and race? The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Starvation, however is the allocation of resource that prevents one job to be executed. Race occurs before the process has been started. Hread B- - - -.

Wednesday, January 16, 2008. 1 What are the major difference between deadlock, starvation, and race? Describes a situation where two or more threads are blocked forever, waiting for each other. Starvation is the result of conservative allocation of resources which a single job is prevented from execution because its kept waiting for resources that never become available. Race is a synchronization problem between two processes vying for the same resource. A Deadlock will not happ.

Tuesday, January 15, 2008. 1 The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Threads can try to update the same data structure at the same time. The result can be partly what one thread wrote and partly what the other thread wrote. To avoid updating the same data structure at the same time, threads lock a. Data structure until they have finished making their modifications to it.

Tuesday, January 15, 2008. 1 The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Starvation, however is the allocation of resource that prevents one job to be executed. Race occurs before the process has been started. Classmate get his pen back.