Show simple item record

dc.contributor.authorShah, Julie A.
dc.contributor.authorGombolay, Matthew Craig
dc.date.accessioned2015-05-21T13:03:14Z
dc.date.available2015-05-21T13:03:14Z
dc.date.issued2014-12
dc.date.submitted2014-06
dc.identifier.issn2327-3097
dc.identifier.urihttp://hdl.handle.net/1721.1/97044
dc.description.abstractIncreasingly, 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.sponsorshipBoeing Scientific Research Laboratoriesen_US
dc.description.sponsorshipNational Science Foundation (U.S.). Graduate Research Fellowship (Grant 2388357)en_US
dc.language.isoen_US
dc.publisherAmerican Institute of Aeronautics and Astronauticsen_US
dc.relation.isversionofhttp://dx.doi.org/10.2514/1.I010202en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleSchedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraintsen_US
dc.typeArticleen_US
dc.identifier.citationGombolay, 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.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.mitauthorGombolay, Matthew Craigen_US
dc.contributor.mitauthorShah, Julie A.en_US
dc.relation.journalJournal of Aerospace Information Systemsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsGombolay, Matthew C.; Shah, Julie A.en_US
dc.identifier.orcidhttps://orcid.org/0000-0002-5321-6038
dc.identifier.orcidhttps://orcid.org/0000-0003-1338-8107
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record