I think a table of the shortest possible execution times for an instruction would be useful, how many operands it uses, and at the end a list of how much longer a fetch takes if an operand is not stored in the fastest level of cache.
On Tue, Feb 4, 2014 at 10:01 AM, John Gilmore <jwgli...@gmail.com> wrote: > I of course agree that "much work remains to be done"; but I am > hopeful that instruction-execution counts will in time come to > supplant CPU times, which are increasing problematic because no > longer simply reproducible, for performance comparisons and > evaluations. > > It would be agreeable to be able at last to give literal meaning to > the phrase "path length". > > If we must continue to use CPU times we shall all need to learn to > think like agronomists, to give up point measurements and instead to > view CPU times as mean values having high associated variances, and > thus to recognize that explicit, formal statistical > methods---experimental designs and multiple replications---will be > needed to obtain meaningful results. > > John Gilmore, Ashland, MA 01721 - USA > > ---------------------------------------------------------------------- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- Mike A Schwab, Springfield IL USA Where do Forest Rangers go to get away from it all? ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
