execution time


Also found in: Acronyms.

execution time

[‚ek·sə′kyü·shən ‚tīm]
(computer science)
The time during which actual work, such as addition or multiplication, is carried out in the execution of a computer instruction.

execution time

The time in which a single instruction is executed. It makes up the last half of the instruction cycle.
References in periodicals archive ?
It is found that the execution time is directly proportional with the image size.
Among recent enforcement actions by the Financial Industry Regulatory Authority were the censure and fine of a firm for failures relating to private placements; of another for failures relating to monitoring execution times related to TRACE; and of another for failure to disclose reportable unsatisfied liens and judgments of registered representatives.
The total execution time for shuffle phase will be eq (2) Otherwise, the shuffle phase will be completed in multiple waves, then it will be eq (3)
exe] is the execution time of the Map task, and [F.
Based on the actual price history of EC2 spot instances, these studies compared several adaptive checkpointing schemes in terms of monetary costs and job execution time.
Figure 3 shows the curves of execution time values for processing multi-images in each algorithm.
Steps Execution time (s) Steps Execution time (s) 1 78 12,551414 31 132,86864 2 78 12,223929 29 126,359432 3 70 10,617825 29 131,983591 4 62 9,371246 31 134,68343 5 69 10,438041 31 133,769158 Avg 71,4 11,040491 30,2 131,93285 Best 62 9,371246 29 126,359432 CA1B *** GA type Nr.
The problems described in (Kouril & Zelinka, 2010) can be considered as sufficiently complex for providing as samples for analysing execution time of related algorithms.
A C++ computer program was created to measure the performance of each algorithm based upon execution time and path length in randomly generated maps that varied by the number of obstacle nodes.
In WinBench testing, a variety of popular applications are simulated and overall execution time is measured.
Interrupts in the system, which either execute longer than expected or occur more frequently than anticipated, may steal critical execution time from the highest priority threads.
By merging these machine and program characterizations, we can estimate execution time for arbitrary machine/program combinations.