Given is some program, P, which needs 300 Time-Units (TU) to run from start to completion...

 

1. 
   

Transcribed Image Text:

Given is some program, P, which needs 300 Time-Units (TU) to run from start to completion on a single processor. Thereby, 1 TU corresponds to 1 Basic Instruction Cycle (as per Fig.1.2 in your book). Assume further that P's fvalue is 0.12 (or 12%). What is the theoretically shortest possible run-time (counted in TU) of a multi- threaded version of P whereby Nmay be as large as you want? Answer: The theoretically shortest possible run-time of P under these circumstances is [T] TU. Given is some program, P, which needs 300 Time-Units (TU) to run from start to completion on a single processor. Thereby, 1 TU corresponds to 1 Basic Instruction Cycle (as per Fig.1.2 in your book). Assume further that P's fvalue is 0.12 (or 12%). What is the theoretically shortest possible run-time (counted in TU) of a multi- threaded version of P whereby Nmay be as large as you want? Answer: The theoretically shortest possible run-time of P under these circumstances is [T] TU.

Answer rating: 100% (QA)

Answer Process Synchronisation is nothing but the processes execution in the predefined order which is helpful to ease the computer operations Its very important when the resources are in sharing with ... View the full answer