Time utility function
From Wikipedia, the free encyclopedia
| This article may require cleanup to meet Wikipedia's quality standards. Please improve this article if you can. (February 2008) |
| This article does not cite any references or sources. (February 2008) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. |
| The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. |
| This article lacks information on the notability of the subject matter. Please help improve this article by providing context for a general audience, especially in the lead section. (February 2008) |
Time/utility functions were introduced by E. Douglas Jensen in 1977 as a way to overcome the limited expressiveness in classic deadline constraints in real-time systems. Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably the most effective and broadest approach for adaptive, dynamic, time-critical resource management. A TUF, which is a generalization of the classical deadline constraint, specifies the utility of completing an application activity as an application or situation-specific function of that activity's completion time. With TUF time constraints, timeliness optimality criteria can be specified in terms of accrued (e.g., summed) activity utilities.
Contents |
[edit] Summary
[edit] History
'placeholder':Time/utility functions were initially introduced by E. Douglas Jensen in 1977 ...
'placeholder' Introduction of various algorithms...
'placeholder' intro of rtsj
'placeholder' intro of drtsj
'placeholder' intro of TUFDefender

