{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/20621"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/20621","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Building reliable programs through active replication","abstract":"This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so that user programs can continue to work in the face of system failures.","abstract_html":"This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so that user programs can continue to work in the face of system failures.","abstract_has_math":false,"creators":["Shi, Shaw-Ben"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Belford, Geneva G."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:44:30Z","date_published":"2011-05-07T12:44:30Z","updated_at":"2026-07-22T22:25:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1990 Shi, Shaw-Ben"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114411","(UMI)AAI9114411"],"render_values":[{"text":"AAI9114411","href":null,"code":true},{"text":"(UMI)AAI9114411","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/20621","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Belford, Geneva G."]},{"key":"dc:creator","label":"Author","values":["Shi, Shaw-Ben"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:44:30Z","10000-01-01","1990"]},{"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":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1990 Shi, Shaw-Ben"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114411","(UMI)AAI9114411","http://hdl.handle.net/2142/20621"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so that user programs can continue to work in the face of system failures.","We present a paradigm of replication called replicated transaction. In our system, a user computation is cast as an atomic transaction. A transaction is executed as several concurrent and independent copies. The replicated transaction approach has one serious problem: different transaction replicas might behave differently. This thesis identifies the reasons why transaction replicas behave differently. We present the necessary algorithms for ensuring transaction replicas to behave consistently. The algorithms include a multi-level concurrency control scheme, a token based message ordering protocol and a primary copy scheme. We also provide a formal model with which to prove the correctness of our concurrency control scheme and how our algorithms can ensure transaction replicas to behave consistently. We have written a simulation program to model the replicated transaction system. The simulation program is written in C++ and uses an event-driven simulation package, CSIM.","Made available in DSpace on 2011-05-07T12:44:30Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9114411.pdf: 5090055 bytes, checksum: dbcfa86af40e0e563901e1b559a36221 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:08Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:19:57-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":["Building reliable programs through active replication"]}]}],"canonical_facts":{"dc:contributor":["Belford, Geneva G."],"dc:creator":["Shi, Shaw-Ben"],"dc:date":["2011-05-07T12:44:30Z","10000-01-01","1990"],"dc:description":["This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so that user programs can continue to work in the face of system failures.","We present a paradigm of replication called replicated transaction. In our system, a user computation is cast as an atomic transaction. A transaction is executed as several concurrent and independent copies. The replicated transaction approach has one serious problem: different transaction replicas might behave differently. This thesis identifies the reasons why transaction replicas behave differently. We present the necessary algorithms for ensuring transaction replicas to behave consistently. The algorithms include a multi-level concurrency control scheme, a token based message ordering protocol and a primary copy scheme. We also provide a formal model with which to prove the correctness of our concurrency control scheme and how our algorithms can ensure transaction replicas to behave consistently. We have written a simulation program to model the replicated transaction system. The simulation program is written in C++ and uses an event-driven simulation package, CSIM.","Made available in DSpace on 2011-05-07T12:44:30Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9114411.pdf: 5090055 bytes, checksum: dbcfa86af40e0e563901e1b559a36221 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:08Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:19:57-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":["AAI9114411","(UMI)AAI9114411","http://hdl.handle.net/2142/20621"],"dc:language":["eng"],"dc:rights":["Copyright 1990 Shi, Shaw-Ben"],"dc:subject":["Computer Science"],"dc:title":["Building reliable programs through active replication"],"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"}