{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/66250"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/66250","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"High Performance, High Availability Distributed Processor Systems","abstract":"Distributed processor systems are often heralded as systems which can provide high performance along with availability. In order to realize such an environment it is necessary to develop algorithms for sharing the system workload. Analytic as well as simulation models are being used to study the behavior of various distributed load sharing algorithms. In particular, an optimal deterministic scheduling algorithm has been designed which assigns tasks to processors for minimal execution time. Also a new class of adaptive decentralized load sharing algorithms have been defined and studied using both queueing models and a general distributed system simulator. These models are being used to examine how distributed processor load sharing algorithms behave as a function of job arrival, job service, processor failure, processor repair and interprocessor communication times.","abstract_html":"Distributed processor systems are often heralded as systems which can provide high performance along with availability. In order to realize such an environment it is necessary to develop algorithms for sharing the system workload. Analytic as well as simulation models are being used to study the behavior of various distributed load sharing algorithms. In particular, an optimal deterministic scheduling algorithm has been designed which assigns tasks to processors for minimal execution time. Also a new class of adaptive decentralized load sharing algorithms have been defined and studied using both queueing models and a general distributed system simulator. These models are being used to examine how distributed processor load sharing algorithms behave as a function of job arrival, job service, processor failure, processor repair and interprocessor communication times.","abstract_has_math":false,"creators":["Chou, Timothy Chen Kuang"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-12T20:55:22Z","date_published":"2014-12-12T20:55:22Z","updated_at":"2026-07-22T22:25:55Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8127567"],"render_values":[{"text":"(UMI)AAI8127567","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/66250","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Chou, Timothy Chen Kuang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-12T20:55:22Z","10000-01-01","1981"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"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, Electronics and Electrical"]}]},{"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/66250","(UMI)AAI8127567"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Distributed processor systems are often heralded as systems which can provide high performance along with availability. In order to realize such an environment it is necessary to develop algorithms for sharing the system workload. Analytic as well as simulation models are being used to study the behavior of various distributed load sharing algorithms. In particular, an optimal deterministic scheduling algorithm has been designed which assigns tasks to processors for minimal execution time. Also a new class of adaptive decentralized load sharing algorithms have been defined and studied using both queueing models and a general distributed system simulator. These models are being used to examine how distributed processor load sharing algorithms behave as a function of job arrival, job service, processor failure, processor repair and interprocessor communication times.","Made available in DSpace on 2014-12-12T20:55:22Z (GMT). No. of bitstreams: 1 8127567.pdf: 4178336 bytes, checksum: 8569fb19020ef47f124445933266949a (MD5) Previous issue date: 1981","Embargo set by: Seth Robbins for item 66429 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","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981."]},{"key":"dc:title","label":"Title","values":["High Performance, High Availability Distributed Processor Systems"]}]}],"canonical_facts":{"dc:creator":["Chou, Timothy Chen Kuang"],"dc:date":["2014-12-12T20:55:22Z","10000-01-01","1981"],"dc:description":["Distributed processor systems are often heralded as systems which can provide high performance along with availability. In order to realize such an environment it is necessary to develop algorithms for sharing the system workload. Analytic as well as simulation models are being used to study the behavior of various distributed load sharing algorithms. In particular, an optimal deterministic scheduling algorithm has been designed which assigns tasks to processors for minimal execution time. Also a new class of adaptive decentralized load sharing algorithms have been defined and studied using both queueing models and a general distributed system simulator. These models are being used to examine how distributed processor load sharing algorithms behave as a function of job arrival, job service, processor failure, processor repair and interprocessor communication times.","Made available in DSpace on 2014-12-12T20:55:22Z (GMT). No. of bitstreams: 1 8127567.pdf: 4178336 bytes, checksum: 8569fb19020ef47f124445933266949a (MD5) Previous issue date: 1981","Embargo set by: Seth Robbins for item 66429 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","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981."],"dc:identifier":["http://hdl.handle.net/2142/66250","(UMI)AAI8127567"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["High Performance, High Availability Distributed Processor Systems"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:55Z"}