{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81955"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81955","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Probabilistic Analysis and Scheduling of Critical Soft Real -Time Systems","abstract":"Allowing a real-time system to miss some deadlines in exchange for better average performance increases the possibility of overload. While overload in real-time systems has been studied, the emphasis has been on hard real-time systems in which overload is an exception whose occurrence is to be minimized. In contrast, critical soft real-time systems can be repeatedly overloaded during normal operation. Therefore, we have evaluated the performance of various real-time scheduling algorithms for critical soft real-time systems, including two new classes of algorithms, on workloads with execution and inter-release time variations, both with and without dependencies.","abstract_html":"Allowing a real-time system to miss some deadlines in exchange for better average performance increases the possibility of overload. While overload in real-time systems has been studied, the emphasis has been on hard real-time systems in which overload is an exception whose occurrence is to be minimized. In contrast, critical soft real-time systems can be repeatedly overloaded during normal operation. Therefore, we have evaluated the performance of various real-time scheduling algorithms for critical soft real-time systems, including two new classes of algorithms, on workloads with execution and inter-release time variations, both with and without dependencies.","abstract_has_math":false,"creators":["Gardner, Mark K."],"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":2015,"date_issued":"2015-09-25T20:21:10Z","date_published":"2015-09-25T20:21:10Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Engineering, System Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9953022"],"render_values":[{"text":"(MiAaPQ)AAI9953022","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81955","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":["Gardner, Mark K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:21:10Z","10000-01-01","1999"]},{"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, System Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81955","(MiAaPQ)AAI9953022"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Allowing a real-time system to miss some deadlines in exchange for better average performance increases the possibility of overload. While overload in real-time systems has been studied, the emphasis has been on hard real-time systems in which overload is an exception whose occurrence is to be minimized. In contrast, critical soft real-time systems can be repeatedly overloaded during normal operation. Therefore, we have evaluated the performance of various real-time scheduling algorithms for critical soft real-time systems, including two new classes of algorithms, on workloads with execution and inter-release time variations, both with and without dependencies.","Made available in DSpace on 2015-09-25T20:21:10Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9953022.pdf: 9218396 bytes, checksum: 040a753fa275c5a3a89f7185fead9d25 (MD5) Previous issue date: 1999","Embargo set by: Seth Robbins for item 83236 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","196 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999."]},{"key":"dc:title","label":"Title","values":["Probabilistic Analysis and Scheduling of Critical Soft Real -Time Systems"]}]}],"canonical_facts":{"dc:contributor":["Liu, Jane W.S."],"dc:creator":["Gardner, Mark K."],"dc:date":["2015-09-25T20:21:10Z","10000-01-01","1999"],"dc:description":["Allowing a real-time system to miss some deadlines in exchange for better average performance increases the possibility of overload. While overload in real-time systems has been studied, the emphasis has been on hard real-time systems in which overload is an exception whose occurrence is to be minimized. In contrast, critical soft real-time systems can be repeatedly overloaded during normal operation. Therefore, we have evaluated the performance of various real-time scheduling algorithms for critical soft real-time systems, including two new classes of algorithms, on workloads with execution and inter-release time variations, both with and without dependencies.","Made available in DSpace on 2015-09-25T20:21:10Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9953022.pdf: 9218396 bytes, checksum: 040a753fa275c5a3a89f7185fead9d25 (MD5) Previous issue date: 1999","Embargo set by: Seth Robbins for item 83236 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","196 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999."],"dc:identifier":["http://hdl.handle.net/2142/81955","(MiAaPQ)AAI9953022"],"dc:language":["eng"],"dc:subject":["Engineering, System Science"],"dc:title":["Probabilistic Analysis and Scheduling of Critical Soft 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:26:17Z"}