Yue Yu
Xiaobo Sharon Hu
Skip Abstract Section
Abstract
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.
- Abdelzaher, T., Blum, B., Cao, Q., Chen, Y., Evans, D., George, J., George, S., Gu, L., He, T., Krishnamurthy, S., Luo, L., Son, S., Stankovic, J., Stoleru, R., and Wood, A. 2004. Envirotrack: Towards an environmental computing paradigm for distributed sensor networks. In Proceedings of the International Conference on Distributed Computing Systems. 582--589. Google Scholar
Digital Library
- Alur, R. and Henzinger, T. A. 1989. A really temporal logic. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 164--169. Google ScholarDigital Library
- Alur, R. and Dill, D. L. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2, 183--235. Google ScholarDigital Library
- Alur, R., Feder, T., and Henzinger, T. A. 1991. The benefits of relaxing punctuality. In Proceedings of the Symposium on Principles of Distributed Computing. 139--152. Google ScholarDigital Library
- Arbab, F. and Rutten, J. 2002. A coinductive calculus of component connectors. In Proceedings of the Workshop on Algebraic Development Techniques (WADT’02). Lecture Notes in Computer Science, Vol. 2755. Springer, 34--55.Google Scholar
- Aydin, H., Melhem, R., Mosse, D., and Mejia-Alvarez, P. 2001. Dynamic and aggressive scheduling techniques for power-aware real-time systems. In Proceedings of the Real-Time Systems Symposium. 95--105. Google ScholarDigital Library
- Chantem, T., Dick, R. P., and Hu, X. S. 2008. Temperature-Aware scheduling and assignment for hard real-time applications on mpsocs. In Proceedings of the Design, Automation and Test in Europe (DATE’08). 288--293. Google ScholarDigital Library
- Dasdan, A. 1999. Timing analysis of embedded real-time systems. Tech. rep. UIUCDCS-R-99-2079, University of Illinois at Urbana-Champaign. Google ScholarDigital Library
- Dasdan, A. 2002a. Efficient algorithms for debugging timing constraint violations. In Proceedings of the 8th ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems. ACM, New York, 50--56. Google ScholarDigital Library
- Dasdan, A. 2002b. Strongly polynomial-time algorithm for over-constraint resolution: Efficient debugging of timing constraint violations. In Proceedings of the 10th International Symposium on Hardware/Software Codesign. 127--132. Google ScholarDigital Library
- Dasdan, A. 2009. Provably efficient algorithms for resolving temporal and spatial difference constraint violations. ACM Trans. Des. Autom. Electron. Syst. 14, 1, 1--24. Google ScholarDigital Library
- de Alfaro, L., Majumdar, R., Raman, V., and Stoelinga, M. 2007. Game relations and metrics. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS’07). IEEE Computer Society, Los Alamitos, CA, 99--108. Google ScholarDigital Library
- Dyer, M. E. and Frieze, A. M. 1988. On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17, 5, 967--974. Google ScholarDigital Library
- Fang, S.-C. and Puthebnpura, S. 1993. Linear Optimization and Extensions: Theory and Algorithms. Prentice-Hall. Google ScholarDigital Library
- Gerber, R., Hong, S., and Saksena, M. 1995. Guaranteeing real-time requirements with resource-based calibration of periodic processes. IEEE Trans. Softw. Engin. 21, 7, 579--592. Google ScholarDigital Library
- Gupta, V., Jagadeesan, R., and Panangaden, P. 2004. Approximate reasoning for real-time probabilistic processes. In Proceedings of the 1st International Conference on the Quantitative Evaluation of Systems (QEST’04). 304--313. Google ScholarDigital Library
- Hu, X. S., Zhou, T., and Sha, E. H.-M. 2001. Estimating probabilistic timing performance for real-time embedded systems. IEEE Trans. VLSI Syst. 9, 6, 833--844. Google ScholarDigital Library
- Jackson, D., Thomas, M., and Millett, L. I. 2007. Software for Dependable Systems: Sufficient Evidence? The National Academies Press, Washington, D.C. Google ScholarDigital Library
- Jahanian, F. and Mok, A. K.-L. 1987. A graph-theoretic approach for timing analysis and its implementation. IEEE Trans. Comput. 36, 8, 961--975. Google ScholarDigital Library
- Julius, A., Girard, A., and Pappas, G. 2006. Approximate bisimulation for a class of stochastic hybrid systems. In Proceedings of the American Control Conference.Google Scholar
- Kalavade, A. and Moghé, P. 1998. A tool for performance estimation of networked embedded end-systems. In Proceedings of the 35th Annual Conference on Design Automation. ACM, 257--262. Google ScholarDigital Library
- Lawrence, J. 1991. Polytope volume computation. Math. Comput. 57, 195, 259--271.Google Scholar
- Lee, E. A. 2005. Building unreliable systems out of reliable components: The real time story. Tech. rep. UCB/EECS-2005-5, EECS Department, University of California, Berkeley.Google Scholar
- Li, Y. A. 1996. A probabilistic framework for estimation of execution time in heterogeneous computing systems. Ph.D. thesis, Major Professor-John K. Antonio, West Lafayette, IN. Google ScholarDigital Library
- Liao, Y.-Z. and Wong, C. April 1983. An algorithm to compact a vlsi symbolic layout with mixed constraints. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 2, 2, 62--69.Google ScholarDigital Library
- McMullen, P. and Shepard, G. C. 1971. Convex Polytopes and the Upper Bound Conjecture. London Mathematical Society Lecture Notes Series 3, Cambridge University Press, London.Google Scholar
- Moscibroda, T., von Rickenbach, P., and Wattenhofer, R. 2006. Analyzing the energy-latency trade-off during the deployment of sensor networks. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM’06), 1--13.Google Scholar
- Pan, F., Freeh, V. W., and Smith, D. M. 2005. Exploring the energy-time tradeoff in high-performance computing. In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium Workshop 11 (IPDPS’05). (Workshop 11) IEEE Computer Society, Los Alamitos, CA, 234.1. Google ScholarDigital Library
- Pillai, P. and Shin, K. G. 2001. Real-Time dynamic voltage scaling for low-power embedded operating systems. SIGOPS Oper. Syst. Rev. 35, 5, 89--102. Google ScholarDigital Library
- Provan, J. S. 1994. Efficient enumeration of the vertices of polyhedra associated with network lp’s. Math. Program. 63, 1, 47--64. Google ScholarDigital Library
- Raju, S. C. V., Rajkumar, R., and Jahanian, F. 1992. Monitoring timing constraints in distributed real-time systems. In Proceedings of the IEEE Real-Time Systems Symposium. 57--67.Google Scholar
- Saewong, S. and Rajkumar, R. 2003. Practical voltage-scaling for fixed-priority rt-systems. In Proceedings of the 9th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’03). IEEE Computer Society, Los Alamitos, CA, 106. Google ScholarDigital Library
- Shivakumar, P., Keckler, S. W., Moore, C. R., and Burger, D. 2003. Exploiting microarchitectural redundancy for defect tolerance. In Proceedings of the 21st International Conference on Computer Design (ICCD). 481--488. Google ScholarDigital Library
- Song, L., Deng, Y., and Cai, X. 2007. Towards automatic measurement of probabilistic processes. In Proceedings of the 7th International Conference on Quality Software (QSIC’07). IEEE Computer Society, Los Alamitos, CA, 50--59. Google ScholarDigital Library
- Thorsley, D. and Klavins, E. 2008. Model reduction of stochastic processes using wasserstein pseudometrics. In Proceedings of the American Control Conference, 1374--1381.Google Scholar
- Tia, T.-S., Deng, Z., Shankar, M., Storch, M., Sun, J., Wu, L.-C., and Liu, J. W.-S. 1995. Probabilistic performance guarantee for real-time tasks with varying computation times. In Proceedings of the Real-Time Technology and Applications Symposium. 164. Google ScholarDigital Library
- Wang, F., Nicopoulos, C., Wu, X., Xie, Y., and Vijaykrishnan, N. 2007. Variation-aware task allocation and scheduling for mpsoc. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. IEEE Press, Los Alamitos, CA, 598--603. Google ScholarDigital Library
- Woo, H., Mok, A. K., and Lee, C.-G. 2006. A generic framework for monitoring timing constraints over uncertain events. In Proceedings of the 27th IEEE International Real-Time Systems Symposium (RTSS’06). IEEE Computer Society, Los Alamitos, CA, 435--444. Google ScholarDigital Library
- yi Huang, T. and Liu, J. W. S. 1995. Predicting the worst-case execution time of the concurrent execution of instructions and cycle-stealing dma i/o operations. In Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Real-Time Systems. 1--6.Google Scholar
- Yu, Y., Ren, S., and Frieder, O. 2008. Interval-Based timing constraints their satisfactions and applications. IEEE Trans. Comput. 57, 3, 418--432. Google ScholarDigital Library
- Zhang, L., Han, Y., Xu, Q., and Li, X. 2008. Defect tolerance in homogeneous manycore processors using core-level redundancy with unified topology. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE’08). ACM, New York, 891--896. Google ScholarDigital Library
Index Terms
- A Metric for Quantifying Similarity between Timing Constraint Sets in Real-Time Systems
Recommendations
Timing Constraints of Real-Time Systems: Constructs for Expressing Them, Methods of Validating Them
This paper examines timing constraints as features of realtime systems. It investigates the various constructs required in requirements languages to express timing constraints and considers how automatic test systems can validate systems that include ...
Provably efficient algorithms for resolving temporal and spatial difference constraint violations
A system of difference constraints is a formal model of temporal and spatial constraints in many areas such as scheduling, constraint satisfaction, and layout compaction. During construction of such a system, constraint violations often arise, and they ...
Feasibility of semiring-based timing constraints
Real-time and embedded applications often involve different types of timing constraints, such as precedence constraints and real-time constraints. As real-time and embedded applications further advance, new timing constraint types are emerging as well. ...
Comments