2026-09-19T18:17:20Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/66250 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Chou, Timothy Chen Kuang 2014-12-12T20:55:22Z 2014-12-12T20:55:22Z 10000-01-01 1981 1981 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. http://hdl.handle.net/2142/66250 (UMI)AAI8127567 eng Engineering, Electronics and Electrical High Performance, High Availability Distributed Processor Systems text Electrical Engineering Electrical Engineering University of Illinois at Urbana-Champaign Dissertation Ph.D.