Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stewart Edgar

dblp:46/4389 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › schedulability analysis
probabilistic schedulability analysis
0.012001
Statistical Analysis of WCET for Scheduling · RTSS 2001
Embedded and real-time systems
real-time scheduling
0.012001
Statistical Analysis of WCET for Scheduling · RTSS 2001
Embedded and real-time systems › real-time scheduling
schedulability analysis
0.012001
Statistical Analysis of WCET for Scheduling · RTSS 2001
Embedded and real-time systems › real-time scheduling › worst-case analysis
worst-case execution time estimation
0.012001
Statistical Analysis of WCET for Scheduling · RTSS 2001

Methods — techniques the papers use, named apart from their topics

statistical estimation · 0.0probabilistic confidence analysis · 0.0
YearPublicationVenuePosition
2001 Statistical Analysis of WCET for Scheduling
abstract
To perform a schedulability test, scheduling analysis relies on a known worst-case execution time (WCET). This value may be difficult to compute and may be overly pessimistic. This paper offers an alternative analysis based on estimating a WCET from test data to within a specific level of probabilistic confidence. A method is presented for calculating an estimate given statistical assumptions. The implications of the level of confidence on the likelihood of schedulability are also presented.
Stewart Edgar, Alan Burns 0001
RTSS1
2000 Predicting computation time for advanced processor architectures
abstract
Estimating computation times using analysis techniques is always safe but is becoming prohibitively complex or pessimistic with modern processors. The only alternative approach is to use measurement, but this has the significant disadvantage of optimism - the largest value seen during testing may not be the largest experienced during deployment. In this paper, we subject data obtained from measurement to statistical analysis using the techniques of extreme value estimation. A simple case study is described and the approach is illustrated via this study which focuses on the superscalar technique of branch prediction. The approach is applicable to all forms of hardware-induced temporal variability.
Alan Burns 0001, Stewart Edgar
ECRTS2