{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72080"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72080","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Issues on Synchronizing and Scheduling Tasks in Real-Time Database Systems","abstract":"Real-time systems have timing requirements. In database systems, database operations are performed in a sequence so as to maintain database consistency. By combining the features of a real-time system and a database system, a real-time database system must satisfy requirements from both models. Unfortunately, the requirements from the two models are not always compatible. In order to satisfy the timing requirements, transactions must be scheduled in a temporally predictable fashion. On the other hand, some transactions may have to be suspended in order to maintain the database consistency. The suspension causes disturbances in scheduling and may result in temporally unpredictable behavior. The priority ceiling protocol has been proposed to satisfy the timing requirements under the existence of suspension. However, the priority ceiling protocol does not maintain database consistency. We propose a set of algorithms integrating scheduling and concurrency control in order to maintain database consistency and still satisfy the timing requirements. We describe the properties of the algorithms and compare them with the priority ceiling protocol.","abstract_html":"Real-time systems have timing requirements. In database systems, database operations are performed in a sequence so as to maintain database consistency. By combining the features of a real-time system and a database system, a real-time database system must satisfy requirements from both models. Unfortunately, the requirements from the two models are not always compatible. In order to satisfy the timing requirements, transactions must be scheduled in a temporally predictable fashion. On the other hand, some transactions may have to be suspended in order to maintain the database consistency. The suspension causes disturbances in scheduling and may result in temporally unpredictable behavior. The priority ceiling protocol has been proposed to satisfy the timing requirements under the existence of suspension. However, the priority ceiling protocol does not maintain database consistency. We propose a set of algorithms integrating scheduling and concurrency control in order to maintain database consistency and still satisfy the timing requirements. We describe the properties of the algorithms and compare them with the priority ceiling protocol.","abstract_has_math":false,"creators":["Nakazato, Hidenori"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Lin, Kwei-Jay"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-17T20:00:36Z","date_published":"2014-12-17T20:00:36Z","updated_at":"2026-07-22T22:26:06Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9314920"],"render_values":[{"text":"(UMI)AAI9314920","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72080","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lin, Kwei-Jay"]},{"key":"dc:creator","label":"Author","values":["Nakazato, Hidenori"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-17T20:00:36Z","10000-01-01","1993"]},{"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":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72080","(UMI)AAI9314920"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Real-time systems have timing requirements. In database systems, database operations are performed in a sequence so as to maintain database consistency. By combining the features of a real-time system and a database system, a real-time database system must satisfy requirements from both models. Unfortunately, the requirements from the two models are not always compatible. In order to satisfy the timing requirements, transactions must be scheduled in a temporally predictable fashion. On the other hand, some transactions may have to be suspended in order to maintain the database consistency. The suspension causes disturbances in scheduling and may result in temporally unpredictable behavior. The priority ceiling protocol has been proposed to satisfy the timing requirements under the existence of suspension. However, the priority ceiling protocol does not maintain database consistency. We propose a set of algorithms integrating scheduling and concurrency control in order to maintain database consistency and still satisfy the timing requirements. We describe the properties of the algorithms and compare them with the priority ceiling protocol.","For real-time database systems with monitoring and controlling operations, there are additional requirements for data consistency. We therefore define external consistency and temporal consistency. In order to satisfy these additional requirements, we propose design strategies for the temporal aspect of a real-time database system. Finally, we describe how to assign specific deadlines to transactions from the timing requirements while utilizing the processor effectively.","Made available in DSpace on 2014-12-17T20:00:36Z (GMT). No. of bitstreams: 1 9314920.pdf: 5172867 bytes, checksum: bbc846b7e3988c98815e2efd9fcf9943 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72248 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","115 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."]},{"key":"dc:title","label":"Title","values":["Issues on Synchronizing and Scheduling Tasks in Real-Time Database Systems"]}]}],"canonical_facts":{"dc:contributor":["Lin, Kwei-Jay"],"dc:creator":["Nakazato, Hidenori"],"dc:date":["2014-12-17T20:00:36Z","10000-01-01","1993"],"dc:description":["Real-time systems have timing requirements. In database systems, database operations are performed in a sequence so as to maintain database consistency. By combining the features of a real-time system and a database system, a real-time database system must satisfy requirements from both models. Unfortunately, the requirements from the two models are not always compatible. In order to satisfy the timing requirements, transactions must be scheduled in a temporally predictable fashion. On the other hand, some transactions may have to be suspended in order to maintain the database consistency. The suspension causes disturbances in scheduling and may result in temporally unpredictable behavior. The priority ceiling protocol has been proposed to satisfy the timing requirements under the existence of suspension. However, the priority ceiling protocol does not maintain database consistency. We propose a set of algorithms integrating scheduling and concurrency control in order to maintain database consistency and still satisfy the timing requirements. We describe the properties of the algorithms and compare them with the priority ceiling protocol.","For real-time database systems with monitoring and controlling operations, there are additional requirements for data consistency. We therefore define external consistency and temporal consistency. In order to satisfy these additional requirements, we propose design strategies for the temporal aspect of a real-time database system. Finally, we describe how to assign specific deadlines to transactions from the timing requirements while utilizing the processor effectively.","Made available in DSpace on 2014-12-17T20:00:36Z (GMT). No. of bitstreams: 1 9314920.pdf: 5172867 bytes, checksum: bbc846b7e3988c98815e2efd9fcf9943 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72248 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","115 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."],"dc:identifier":["http://hdl.handle.net/2142/72080","(UMI)AAI9314920"],"dc:subject":["Computer Science"],"dc:title":["Issues on Synchronizing and Scheduling Tasks in Real-Time Database 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:06Z"}