Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.arch.embedded > #24904
| From | Paul Rubin <no.email@nospam.invalid> |
|---|---|
| Newsgroups | comp.arch.embedded |
| Subject | Re: Instrumentation question. |
| Date | 2016-09-07 00:05 -0700 |
| Organization | A noiseless patient Spider |
| Message-ID | <8760q8mbpu.fsf@jester.gateway.pace.com> (permalink) |
| References | <nqo9eb$9ti$1@dont-email.me> |
Les Cargill <lcargill99@comcast.com> writes: > Obviously a histogram is in order. But wait!. > It seems to me that I should be able to estimate a histogram based on: > - minimum time > - maximum time > - average time. > What is this sort of ... inquiry called, and how do I stop being quite > so dull about it? You want a probability distribution of the time it takes to do an operation? You might look at the docs for Haskell's Criterion benchmarking library: http://www.serpentine.com/criterion/tutorial.html You presumably won't be able to use it directly (unless you're coding in Haskell), and lots of the doc is very Haskell-specific, but it can give you an idea of how a fancy package of this sort goes about things.
Back to comp.arch.embedded | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Instrumentation question. Les Cargill <lcargill99@comcast.com> - 2016-09-07 00:50 -0500
Re: Instrumentation question. Paul Rubin <no.email@nospam.invalid> - 2016-09-07 00:05 -0700
Re: Instrumentation question. Les Cargill <lcargill99@comcast.com> - 2016-09-07 13:07 -0500
Re: Instrumentation question. Tom Gardner <spamjunk@blueyonder.co.uk> - 2016-09-07 08:49 +0100
Re: Instrumentation question. Les Cargill <lcargill99@comcast.com> - 2016-09-07 13:10 -0500
Re: Instrumentation question. Tom Gardner <spamjunk@blueyonder.co.uk> - 2016-09-07 23:20 +0100
csiph-web