dc.contributor.author | Shah, Julie A. | |
dc.contributor.author | Gombolay, Matthew Craig | |
dc.date.accessioned | 2015-05-21T13:03:14Z | |
dc.date.available | 2015-05-21T13:03:14Z | |
dc.date.issued | 2014-12 | |
dc.date.submitted | 2014-06 | |
dc.identifier.issn | 2327-3097 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/97044 | |
dc.description.abstract | Increasingly, real-time systems must handle the self-suspension of tasks (that is, lower-bound wait times between subtasks) in a timely and predictable manner. A fast schedulability test that does not significantly overestimate the temporal resources needed to execute self-suspending task sets would be of benefit to these modern computing systems. In this paper, a polynomial-time test is presented that is known to be the first to handle nonpreemptive self-suspending task sets with hard deadlines, where each task has any number of self-suspensions. To construct the test, a novel priority scheduling policy is leveraged, the jth subtask first, which restricts the behavior of the self-suspending model to provide an analytical basis for an informative schedulability test. In general, the problem of sequencing according to both upper-bound and lower-bound temporal constraints requires an idling scheduling policy and is known to be nondeterministic polynomial-time hard. However, the tightness of the schedulability test and scheduling algorithm are empirically validated, and it is shown that the processor is able to effectively use up to 95% of the self-suspension time to execute tasks. | en_US |
dc.description.sponsorship | Boeing Scientific Research Laboratories | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Graduate Research Fellowship (Grant 2388357) | en_US |
dc.language.iso | en_US | |
dc.publisher | American Institute of Aeronautics and Astronautics | en_US |
dc.relation.isversionof | http://dx.doi.org/10.2514/1.I010202 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Gombolay, Matthew C., and Julie A. Shah. “Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints.” Journal of Aerospace Information Systems 11, no. 12 (December 2014): 821–841. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.contributor.mitauthor | Gombolay, Matthew Craig | en_US |
dc.contributor.mitauthor | Shah, Julie A. | en_US |
dc.relation.journal | Journal of Aerospace Information Systems | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Gombolay, Matthew C.; Shah, Julie A. | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-5321-6038 | |
dc.identifier.orcid | https://orcid.org/0000-0003-1338-8107 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |