{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69532"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69532","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Fault Tolerance and Performance Improvement in Multiprocessor Interconnection Networks (shuffle-Exchange, Redundant-Path Array Processors)","abstract":"A general class of fault-tolerant multistage interconnection networks is introduced, wherein fault tolerance is achieved by providing non-unique paths between each input and each output. The topology of the multiple paths is specified by means of a redundancy graph. Different techniques for constructing such networks are presented and relevant properties and control algorithms investigated. Several implementation issues, including concurrent detection of errors and effective utilization of the redundant paths, are discussed and resultant improvements in network reliability analyzed under various circumstances. Performance of the network operating in both circuit switched and packet switched modes is evaluated in detail. Redundant path networks are shown to provide significant tolerance to faults at minimal costs, as well as improvements in performance and very graceful degradation.","abstract_html":"A general class of fault-tolerant multistage interconnection networks is introduced, wherein fault tolerance is achieved by providing non-unique paths between each input and each output. The topology of the multiple paths is specified by means of a redundancy graph. Different techniques for constructing such networks are presented and relevant properties and control algorithms investigated. Several implementation issues, including concurrent detection of errors and effective utilization of the redundant paths, are discussed and resultant improvements in network reliability analyzed under various circumstances. Performance of the network operating in both circuit switched and packet switched modes is evaluated in detail. Redundant path networks are shown to provide significant tolerance to faults at minimal costs, as well as improvements in performance and very graceful degradation.","abstract_has_math":false,"creators":["Padmanabhan, Krishnan"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:33Z","date_published":"2014-12-15T19:25:33Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8422791"],"render_values":[{"text":"(UMI)AAI8422791","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69532","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Padmanabhan, Krishnan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:33Z","10000-01-01","1984"]},{"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/69532","(UMI)AAI8422791"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A general class of fault-tolerant multistage interconnection networks is introduced, wherein fault tolerance is achieved by providing non-unique paths between each input and each output. The topology of the multiple paths is specified by means of a redundancy graph. Different techniques for constructing such networks are presented and relevant properties and control algorithms investigated. Several implementation issues, including concurrent detection of errors and effective utilization of the redundant paths, are discussed and resultant improvements in network reliability analyzed under various circumstances. Performance of the network operating in both circuit switched and packet switched modes is evaluated in detail. Redundant path networks are shown to provide significant tolerance to faults at minimal costs, as well as improvements in performance and very graceful degradation.","Made available in DSpace on 2014-12-15T19:25:33Z (GMT). No. of bitstreams: 1 8422791.pdf: 7305940 bytes, checksum: b0ce6cc77294fc1705ef8acfdfea04f1 (MD5) Previous issue date: 1984","Embargo set by: Seth Robbins for item 69698 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","239 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984."]},{"key":"dc:title","label":"Title","values":["Fault Tolerance and Performance Improvement in Multiprocessor Interconnection Networks (shuffle-Exchange, Redundant-Path Array Processors)"]}]}],"canonical_facts":{"dc:creator":["Padmanabhan, Krishnan"],"dc:date":["2014-12-15T19:25:33Z","10000-01-01","1984"],"dc:description":["A general class of fault-tolerant multistage interconnection networks is introduced, wherein fault tolerance is achieved by providing non-unique paths between each input and each output. The topology of the multiple paths is specified by means of a redundancy graph. Different techniques for constructing such networks are presented and relevant properties and control algorithms investigated. Several implementation issues, including concurrent detection of errors and effective utilization of the redundant paths, are discussed and resultant improvements in network reliability analyzed under various circumstances. Performance of the network operating in both circuit switched and packet switched modes is evaluated in detail. Redundant path networks are shown to provide significant tolerance to faults at minimal costs, as well as improvements in performance and very graceful degradation.","Made available in DSpace on 2014-12-15T19:25:33Z (GMT). No. of bitstreams: 1 8422791.pdf: 7305940 bytes, checksum: b0ce6cc77294fc1705ef8acfdfea04f1 (MD5) Previous issue date: 1984","Embargo set by: Seth Robbins for item 69698 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","239 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984."],"dc:identifier":["http://hdl.handle.net/2142/69532","(UMI)AAI8422791"],"dc:subject":["Computer Science"],"dc:title":["Fault Tolerance and Performance Improvement in Multiprocessor Interconnection Networks (shuffle-Exchange, Redundant-Path Array Processors)"],"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:01Z"}