{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/20444"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/20444","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems","abstract":"A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each periodic task have regular arrival times and hard deadlines. Aperiodic requests, on the other hand, have random arrival times and may have hard or soft deadlines. We called these aperiodic requests with hard deadlines sporadic requests and those with soft deadlines aperiodic requests.","abstract_html":"A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each periodic task have regular arrival times and hard deadlines. Aperiodic requests, on the other hand, have random arrival times and may have hard or soft deadlines. We called these aperiodic requests with hard deadlines sporadic requests and those with soft deadlines aperiodic requests.","abstract_has_math":false,"creators":["Tia, Too-Seng"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Liu, Jane W.S."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:39:22Z","date_published":"2011-05-07T12:39:22Z","updated_at":"2026-07-22T22:25:16Z","subjects":["Engineering, Industrial","Engineering, System Science","Computer Science"],"languages":["eng"],"rights":["Copyright 1995 Tia, Too-Seng"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9543745","(UMI)AAI9543745"],"render_values":[{"text":"AAI9543745","href":null,"code":true},{"text":"(UMI)AAI9543745","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/20444","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Liu, Jane W.S."]},{"key":"dc:creator","label":"Author","values":["Tia, Too-Seng"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:39:22Z","10000-01-01","1995"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Industrial","Engineering, System Science","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1995 Tia, Too-Seng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9543745","(UMI)AAI9543745","http://hdl.handle.net/2142/20444"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each periodic task have regular arrival times and hard deadlines. Aperiodic requests, on the other hand, have random arrival times and may have hard or soft deadlines. We called these aperiodic requests with hard deadlines sporadic requests and those with soft deadlines aperiodic requests.","This thesis extends two common approaches to scheduling periodic requests to address the problems of jointly scheduling periodic requests with aperiodic requests or sporadic requests. Specifically, we present algorithms for scheduling aperiodic requests in dynamic-priority systems, sporadic requests in dynamic-priority systems, and aperiodic requests in fixed-priority systems.","Our algorithms are based on the concept of slack, which is the amount of processor time available to schedule the aperiodic or sporadic requests without causing any periodic requests to miss their deadlines. Two features that distinguish our algorithms from previous slack stealing algorithms proposed in the literature are (1) the efficient computation of slack, and (2) the optimal usage (i.e., when and how much to use) of the available slack to schedule the aperiodic or sporadic requests. For aperiodic requests, our algorithms are optimal in that the aperiodic requests have the minimum possible response times. For sporadic requests, they guarantee the deadlines of as many sporadic requests as possible.","Made available in DSpace on 2011-05-07T12:39:22Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9543745.pdf: 3780009 bytes, checksum: a26bef315ab669d8c4a1d7c95c32377a (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:43:56Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:19:17-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems"]}]}],"canonical_facts":{"dc:contributor":["Liu, Jane W.S."],"dc:creator":["Tia, Too-Seng"],"dc:date":["2011-05-07T12:39:22Z","10000-01-01","1995"],"dc:description":["A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each periodic task have regular arrival times and hard deadlines. Aperiodic requests, on the other hand, have random arrival times and may have hard or soft deadlines. We called these aperiodic requests with hard deadlines sporadic requests and those with soft deadlines aperiodic requests.","This thesis extends two common approaches to scheduling periodic requests to address the problems of jointly scheduling periodic requests with aperiodic requests or sporadic requests. Specifically, we present algorithms for scheduling aperiodic requests in dynamic-priority systems, sporadic requests in dynamic-priority systems, and aperiodic requests in fixed-priority systems.","Our algorithms are based on the concept of slack, which is the amount of processor time available to schedule the aperiodic or sporadic requests without causing any periodic requests to miss their deadlines. Two features that distinguish our algorithms from previous slack stealing algorithms proposed in the literature are (1) the efficient computation of slack, and (2) the optimal usage (i.e., when and how much to use) of the available slack to schedule the aperiodic or sporadic requests. For aperiodic requests, our algorithms are optimal in that the aperiodic requests have the minimum possible response times. For sporadic requests, they guarantee the deadlines of as many sporadic requests as possible.","Made available in DSpace on 2011-05-07T12:39:22Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9543745.pdf: 3780009 bytes, checksum: a26bef315ab669d8c4a1d7c95c32377a (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:43:56Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:19:17-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9543745","(UMI)AAI9543745","http://hdl.handle.net/2142/20444"],"dc:language":["eng"],"dc:rights":["Copyright 1995 Tia, Too-Seng"],"dc:subject":["Engineering, Industrial","Engineering, System Science","Computer Science"],"dc:title":["Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:16Z"}