skip to main content
research-article

Feasibility of semiring-based timing constraints

Published:06 April 2010Publication History
Skip Abstract Section

Abstract

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. Recent research on interval-based timing constraints is an example. Thus, it is important to have a uniformed timing constraint representation so that a generalized approach can be developed to analyze the variant constraint types.

A semiring-based timing constraint model is introduced to generalize the representations of different constraint types. Under this model, we develop an algorithm to check the satisfaction feasibility for a given set of semiring-based timing constraints. This algorithm provides better performance in the average case as compared to applying the Bellman-Ford algorithm directly on the constraint set.

In addition, for a set of feasible semiring-based timing constraints, event occurrence points that satisfy the constraint set form a (hyperdimension) feasible region. For the given two sets of timing constraints, we develop a necessary and sufficient condition to testify whether the two constraint sets' feasible regions have an inclusion relation. If one feasible region is included in the other, we know that the real-time event occurrences that satisfy the included constraint set will necessarily satisfy the including set.

References

  1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Andrei, S. and Cheng, A. M. K. 2006. Faster verification of rtl-specified systems via decomposition and constraint extension. In Proceedings of the 27th IEEE International Real-Time Systems Symposium. 67--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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. 34--55.Google ScholarGoogle ScholarCross RefCross Ref
  4. Bistarelli, S., Montanari, U., and Rossi, F. 1997. Semiring-Based constraint satisfaction and optimization. J. ACM 44, 2, 201--236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chodrow, S. E., Jahanian, F., and Donner, M. 1991. Run-Time monitoring of real-time systems. In Proceedings of the 12th IEEE International Real-Time Systems Symposium. 74--83.Google ScholarGoogle Scholar
  6. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dasdan, A. 1999. Timing analysis of embedded real-time systems. Tech. rep. UIUCDCS-R-99-2079. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. Fletcher, J. G. 1980. A more general algorithm for computing closed semiring costs between vertices of a directed graph. Comm. ACM 23, 6, 350--351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Jahanian, F. and Mok, A. K. 1987. A graph-theoretic approach for timing analysis and its implementation. IEEE Trans. Comput. 36, 8, 961--975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Kleinberg, J. and Tardos, E. 2005. Algorithm Design. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kopetz, H. 2008. The rationale for time-triggered ethernet (invited keynote paper). In Proceedings of the 29th IEEE International Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA, 3--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Lamport, L. 1978a. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7, 558--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Lamport, L. 1978b. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7, 558--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Lee, C., Mok, A. K., and Konana, P. 2007. Monitoring of timing constraints with confidence threshold requirements. IEEE Trans. Comput. 56, 7, 977--991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Liao, Y.-Z. and Wong, C. 1983. An algorithm to compact a vlsi symbolic layout with mixed constraints. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 2, 2, 62--69.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Liu, J. W. S. W. 2000. Real-Time Systems. Prentice Hall PTR, Upper Saddle River, NJ.Google ScholarGoogle Scholar
  19. Mok, A. K., Lee, C., Woo, H., and Konana, P. 2002. The monitoring of timing constraints on time intervals. In Proceedings of the 23rd IEEE International Real-Time Systems Symposium. IEEE Computer Society, Los, Alamitos, CA, 191. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Mok, A. K. and Liu, G. 1997. Efficient run-time monitoring of timing constraints. In Proceedings of the 3rd IEEE International Real-Time Technology and Applications Symposium. 252--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Papadimitriou, C. H. and Steiglitz, K. 1998. Combinatorial Optimization: Algorithms and Complexity. Dover Publications. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Raju, S. C. V., Rajkumar, R., and Jahanian, F. 1992. Monitoring timing constraints in distributed real-time systems. In Proceedings of the 13th IEEE International Real-Time Systems Symposium. 57--67.Google ScholarGoogle Scholar
  23. 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. 435--444. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Yu, Y., Ren, S., and Frieder, O. 2008. Interval-Based timing constraints their satisfactions and applications. IEEE Trans. Comput. 57, 3, 418--432. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Yu, Y., Ren, S., and Hu, X. S. 2009. A metric for judicious relaxation of timing constraints in soft real-time systems. In Proceedings of the 15th IEEE International Real-Time Technology and Applications Symposium. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Zhao, Y., Liu, J., and Lee, E. A. 2007. A programming model for time-synchronized distributed real-time systems. In Proceedings of the 13th IEEE International Real-Time and Embedded Technology and Applications Symposium. 259--268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Zhou, Y. and Lee, E. A. 2006. A causality interface for deadlock analysis in dataflow. In Proceedings of the 6th ACM IEEE International Conference on Embedded Software. ACM, New York, 44--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Zhou, Y. and Lee, E. A. 2008. Causality interfaces for actor networks. ACM Trans. Embed. Comput. Syst. 7, 3, 1--35. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Feasibility of semiring-based timing constraints

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!