Abstract
Measuring program execution time is a much-used technique for performance evaluation in computer science. Without proper care, however, timed results may vary a lot, thus making it hard to trust their validity. We propose a novel timing protocol to significantly reduce such variability by eliminating executions involving infrequent, long-running daemons.
| Original language | English |
|---|---|
| Pages (from-to) | 239-243 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E101D |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2018 |
Keywords
- Execution-time measurement
- Infrequent long-running daemon