A Timing Constraint Search Technique for a TMO based Real-time Process


Yoon-Seok Jeong, Tae-Wan Kim, Sun Young Han, Chun-Hyon Chang, Journal of Information Processing Systems Vol. 2, No. 1, pp. 1-5, Feb. 2006  


Keywords: Timing Constraint Search Technique, TMO Real-Time Process Load Model, Network Load Model
Fulltext:

Abstract

Finding a valid timing constraint is one of the most important issues in the real-time monitoring area. To get the valid timing constraint, a developer executes a real-time process and changes the constraint on a regular basis. This is an exhaustive and time-consuming process. To improve this approach, we propose a timing constraint search technique. This technique uses two load models and one condition proposed in this paper to support the developer in determining the valid timing constraint range in an easy and systematic manner.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Yoon-Seok Jeong, Tae-Wan Kim, Sun Young Han, & Chun-Hyon Chang (2006). A Timing Constraint Search Technique for a TMO based Real-time Process. Journal of Information Processing Systems, 2(1), 1-5. DOI: .

[IEEE Style]
Y. Jeong, T. Kim, S. Y. Han and C. Chang, "A Timing Constraint Search Technique for a TMO based Real-time Process," Journal of Information Processing Systems, vol. 2, no. 1, pp. 1-5, 2006. DOI: .

[ACM Style]
Yoon-Seok Jeong, Tae-Wan Kim, Sun Young Han, and Chun-Hyon Chang. 2006. A Timing Constraint Search Technique for a TMO based Real-time Process. Journal of Information Processing Systems, 2, 1, (2006), 1-5. DOI: .