Browse Wiki & Semantic Web
Http://dbpedia.org/resource/Time-utility function |
This page has no properties. |
hide properties that link here |
No properties link to this page. |
http://dbpedia.org/resource/Time-utility_function |
http://dbpedia.org/ontology/abstract | A Time/Utility Function (TUF), née Time/Va … A Time/Utility Function (TUF), née Time/Value Function, specifies the application-specific utility that an action (e.g., computational task, mechanical movement) yields depending on its completion time. TUFs and their utility interpretations (semantics), scales, and values are derived from application domain-specific subject matter knowledge. An example (but not the only) interpretation of utility is an action's relative importance, which otherwise is independent of its timeliness. The traditional deadline represented as a TUF is a special case—a downward step of utility from 1 to 0 at the deadline time—e.g., timeliness without importance. A TUF is more general—it has a critical time, with application-specific shapes and utility values on each side, after which it does not increase. The various researcher and practitioner definitions of firm and soft real-time can also be represented as special cases of the TUF model. The optimality criterion for scheduling multiple TUF-constrained actions has historically in the literature been only maximal utility accrual (UA)—e.g., a (perhaps expected) weighted sum of the individual actions' completion utilities. This thus takes into account timeliness with respect to critical times. Additional criteria (e.g., energy, predictability), constraints (e.g., dependencies), system models, scheduling algorithms, and assurances have been added as the TUF/UA paradigm and its use cases have evolved. More expressively, TUF/UA allows accrued utility, timeliness, predictability, and other scheduling criteria and constraints to be traded off against one another for the schedule to yield situational application QoS—as opposed to only timeliness per se. Instances of the TUF/UA paradigm have been employed in a wide variety of application domains, most frequently in military systems.ains, most frequently in military systems. |
---|---|
http://dbpedia.org/ontology/thumbnail | http://commons.wikimedia.org/wiki/Special:FilePath/Example_TUFs.png?width=300 + |
http://dbpedia.org/ontology/wikiPageExternalLink | https://www.stern.nyu.edu/om/faculty/pinedo/schedtheory/book5/index.html + , https://www.springer.com/journal/10951 + , https://en.wiktionary.org/wiki/monotonic_decreasing%23:~:text=English-%2CAdjective%2Ccontrast%20this%20with%20strictly%20decreasing + , https://www.springer.com/us/book/9783662593615%3Fgclid=Cj0KCQjwsuP5BRCoARIsAPtX_wHOG2nAkt8eTSFJbhNa4VXlQBt_xhirlmE-ECUV5cnq8nPqgH6gpJUaAuGaEALw_wcB + , https://www.researchgate.net/project/The-Third-International-Workshop-on-Dynamic-Scheduling-Problems-IWDSP-2020 + , https://www.ssrg.ece.vt.edu/allpapers.php + , https://www.academia.edu/15210217/Fifty_years_of_scheduling_a_survey_of_milestones%3Fauto=download&email_work_card=download-paper + , https://www.real-time.org + , http://www.schedulingconference.org/ + |
http://dbpedia.org/ontology/wikiPageID | 15735043 |
http://dbpedia.org/ontology/wikiPageLength | 21724 |
http://dbpedia.org/ontology/wikiPageRevisionID | 1122628394 |
http://dbpedia.org/ontology/wikiPageWikiLink | http://dbpedia.org/resource/Category:Software_performance_management + , http://dbpedia.org/resource/Concave_function + , http://dbpedia.org/resource/Category:Optimal_scheduling + , http://dbpedia.org/resource/Constant_function + , http://dbpedia.org/resource/Real-time_computing + , http://dbpedia.org/resource/File:Example_TUFs.png + , http://dbpedia.org/resource/Tardiness + , http://dbpedia.org/resource/Imprecise_probability + , http://dbpedia.org/resource/Dempster-Shafer_Theory + , http://dbpedia.org/resource/Scheduling + , http://dbpedia.org/resource/Category:Real-time_computing + , http://dbpedia.org/resource/Category:Quality_of_service + |
http://dbpedia.org/property/wikiPageUsesTemplate | http://dbpedia.org/resource/Template:Anchor + , http://dbpedia.org/resource/Template:Reflist + , http://dbpedia.org/resource/Template:See_below + , http://dbpedia.org/resource/Template:Notelist + , http://dbpedia.org/resource/Template:ISBN + , http://dbpedia.org/resource/Template:Efn + |
http://purl.org/dc/terms/subject | http://dbpedia.org/resource/Category:Software_performance_management + , http://dbpedia.org/resource/Category:Real-time_computing + , http://dbpedia.org/resource/Category:Quality_of_service + , http://dbpedia.org/resource/Category:Optimal_scheduling + |
http://www.w3.org/ns/prov#wasDerivedFrom | http://en.wikipedia.org/wiki/Time-utility_function?oldid=1122628394&ns=0 + |
http://xmlns.com/foaf/0.1/depiction | http://commons.wikimedia.org/wiki/Special:FilePath/Example_TUFs.png + |
http://xmlns.com/foaf/0.1/isPrimaryTopicOf | http://en.wikipedia.org/wiki/Time-utility_function + |
owl:sameAs | http://dbpedia.org/resource/Time-utility_function + , http://rdf.freebase.com/ns/m.03nrkpt + , https://global.dbpedia.org/id/4wHqr + , http://www.wikidata.org/entity/Q7804834 + |
rdfs:comment | A Time/Utility Function (TUF), née Time/Va … A Time/Utility Function (TUF), née Time/Value Function, specifies the application-specific utility that an action (e.g., computational task, mechanical movement) yields depending on its completion time. TUFs and their utility interpretations (semantics), scales, and values are derived from application domain-specific subject matter knowledge. An example (but not the only) interpretation of utility is an action's relative importance, which otherwise is independent of its timeliness. The traditional deadline represented as a TUF is a special case—a downward step of utility from 1 to 0 at the deadline time—e.g., timeliness without importance. A TUF is more general—it has a critical time, with application-specific shapes and utility values on each side, after which it does not increase. The va, after which it does not increase. The va |
rdfs:label | Time-utility function |
hide properties that link here |