Chapter 2.1 Performance Measures For Real-Time Systems Real-time systems are...  Home/Search
Context
Related
| ufl.edu/pub/faculty/yhlee...chap2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ufl.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: easures, too, act as filters, imposing a scale of values on performance. To be useful, a performance measure must be compact. That is, it must encapsulate in a very few numbers (preferably a single number) the "performance " of a system. In other words, it must convey what is important about the performance of a system and leave out what is not. If, for instance, we use the mean response time of a computer to a given task as a performance measure, we are -- deliberately or unwittingly -- laying ... (Update)
Active bibliography (related documents): More All
0.1: Performability Analysis for Degradable Computer Systems - Hédi Nabli, al. (1995) (Correct)
0.1: DEEM: a Tool for the Dependability Modeling and Evaluation - Of Multiple Phased (2000) (Correct)
0.1: Scheduling Solutions for Supporting Dependable.. - Sandrini, Di.. (Correct)
Similar documents based on text: More All
0.0: Value Efficiency Analysis of Academic Research - Korhonen, al. (1998) (Correct)
0.0: Resultativity In French Vs. In English - A Study In Contrastive.. - Caudal (Correct)
0.0: Influence of the Sparse Matrix Structure on.. - Ast, Barrado.. (1999) (Correct)
BibTeX entry: (Update)
@misc{ measures-characterizing,
author = "Performance Measures",
title = "Characterizing Real-Time Systems And Tasks",
url = "citeseer.ist.psu.edu/179765.html" }
Citations (may not include all citations):167 Calculating the Maximum Execution Time of Real-Time Programs (context) - Puschner, Koza - 1989
103 Experiments with a Program Timing Tool Based on SourceLevel .. (context) - Park, Shaw - 1991
92 Reasoning about Time in Higher-Level Language Software - Shaw - 1989
55 Pipelined Processors and Worst-Case Execution Times - Zhang, Burns et al. - 1993
54 Evaluating Tight Execution Time Bounds of Programs by Annota.. (context) - Mok - 1989
14 Derivation and Application of Hard Deadlines for Real-Time C.. (context) - Shin, Kim - 1991
10 Performability Evaluation of the SIFT Computer (context) - Meyer, Furchtgott et al. - 1980
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cis.ufl.edu.html): More
Sherman-Morrison-Woodbury Formula-based Algorithms for the.. - Lai, Vemuri (Correct)
Two Approaches for High Concurrency in Multicast-Based Object .. - Johnson, Maugis (1994) (Correct)
Interruptible Critical Sections - Johnson, Harathi (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC