A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
On the complexity of computing the volume of a polyhedron
SIAM Journal on Computing
The benefits of relaxing punctuality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Linear optimization and extensions: theory and algorithms
Linear optimization and extensions: theory and algorithms
Theoretical Computer Science
Efficient enumeration of the vertices of polyhedra associated with network LP's
Mathematical Programming: Series A and B
A tool for performance estimation of networked embedded end-systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Estimating probabilistic timing performance for real-time embedded systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Efficient algorithms for debugging timing constraint violations
Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems
Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes
IEEE Transactions on Software Engineering
Proceedings of the tenth international symposium on Hardware/software codesign
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Practical Voltage-Scaling for Fixed-Priority RT-Systems
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Timing Analysis of Embedded Real-Time Systems
Timing Analysis of Embedded Real-Time Systems
Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A probabilistic framework for estimation of execution time in heterogeneous computing systems
A probabilistic framework for estimation of execution time in heterogeneous computing systems
Exploiting Microarchitectural Redundancy For Defect Tolerance
ICCD '03 Proceedings of the 21st International Conference on Computer Design
EnviroTrack: Towards an Environmental Computing Paradigm for Distributed Sensor Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Approximate Reasoning for Real-Time Probabilistic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Exploring the Energy-Time Tradeoff in High-Performance Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12
A Generic Framework for Monitoring Timing Constraints over Uncertain Events
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Towards Automatic Measurement of Probabilistic Processes
QSIC '07 Proceedings of the Seventh International Conference on Quality Software
Variation-aware task allocation and scheduling for MPSoC
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Interval-Based Timing Constraints Their Satisfactions and Applications
IEEE Transactions on Computers
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Temperature-aware scheduling and assignment for hard real-time applications on MPSoCs
Proceedings of the conference on Design, automation and test in Europe
Proceedings of the conference on Design, automation and test in Europe
Provably efficient algorithms for resolving temporal and spatial difference constraint violations
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Software for Dependable Systems: Sufficient Evidence?
Software for Dependable Systems: Sufficient Evidence?
| Hi-index | 0.00 |
Real-time systems are systems in which their timing behaviors must satisfy a specified set of timing constraints and they often operate in a real-world environment with scarce resources. As a result, the actual runtime performance of these systems may deviate from the design, either inevitably due to unpredictable factors or by intention in order to improve system’s other Quality-of-Service (QoS) properties. In this article, we first introduce a new metric, timing constraint set similarity, to quantify the resemblance between two different timing constraint sets. Because directly calculating the exact value of the metric involves calculating the size of a polytope which is a #P-hard problem, we instead introduce an efficient method for estimating its bound. We further illustrate how this metric can be exploited for improving system predictability and for evaluating trade-offs between timing constraint compromises and the system’s other QoS property gains.