Experiments with a program timing tool based on source-level timing schema

Abstract

Analytic methods are employed at the source-language level, using formal timing schema that include control costs, handle interferences such as interrupts, and produce guaranteed best- and worst-case bounds. The timing tool computes the deterministic execution times for programs that are written in a subset of C and run on a bare machine. Two versions of the tool were written, using two granularity extremes for the atomic elements of the timing schema. All overview of the tool is given, timing schema and code prediction are discussed, and machine analysis and timing tool design are examined. Experimental and validation results are reported. It was found that all the predicted times are consistent, and most are safe. Some predictions are fairly tight, while others are a little loose. There are clear technical reasons that explain the differences between measured and predicted times, and technical solutions that should minimize these differences within the timing schema framework are seen.