COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
we can easily predict the execution time
|
|
|
we cannot predict the execution time
|
|
|
depending on the workload, sometimes we can predict the execution time and sometimes not
|
|
|
no correct answer
|
Detailed explanation-1: -The difference between the end time and start time is the execution time. Get the execution time by subtracting the start time from the end time.
Detailed explanation-2: -The execution time of an instruction depends in part on the behavior of other instructions in the pipeline. Two instructions that compete for the same resource will execute more slowly when executed together than if they were executed at widely separated times. The memory system is an even larger source of variation.
Detailed explanation-3: -Process-execution time is defined as the time spent by the enterprise executing that process. The status of a process can be either “completed” or “in-progress” with respect to an arbitrary predictive horizon (i.e., the future time of interest) [1].
Detailed explanation-4: -The running time of an algorithm refers to the length of time it takes for it to run as a function. An algorithm’s running time for a given input depends on the number of operations executed. An algorithm with more operations will have a lengthier running time.