{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72012"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72012","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Parallel Circuit Simulation Techniques for a Hierarchical Machine","abstract":"Circuit simulation remains an indispensable tool in the CAD community and is used widely to verify circuit functionality and to generate detailed timing information. As circuit designers push the limits on chip density and complexity, more powerful parallel processing resources and more efficient techniques are needed to speed up the simulation process. This dissertation addresses some general issues in parallel circuit simulation and investigates a variety of classical algorithms on the Cedar multiprocessor. Unfortunately, the range of behavior observed for these algorithms applied to various types of circuits is considerable. In an attempt to combine the advantages of several well-established algorithms, a hierarchical framework called CedarSim is proposed. This framework uses a hierarchical relaxation approach and allows different combinations of algorithms to be used at different levels. The objective is to allow each subcircuit to be solved using the most appropriate technique. This flexibility makes it possible to switch between standard and hierarchical algorithms to adapt to varying conditions. The proper functioning of this framework also hinges on appropriate circuit partitioning and effective algorithm selection, which are major research topics by themselves. This dissertation shows that, given proper mechanisms for these two tasks, CedarSim can deliver reasonable performance. This framework can also adapt to poor partitioning by using hierarchical relaxation and aggressive latency exploitation in several algorithms. Performance evaluation tools and techniques are used extensively to understand the behavior of the algorithms and the architecture and to study the interactions between various performance issues. Observations on the strengths and weaknesses of machines such as Cedar are also made. The knowledge acquired in this work also serves as a guideline for a more ambitious goal of developing a portable parallel circuit simulator.","abstract_html":"Circuit simulation remains an indispensable tool in the CAD community and is used widely to verify circuit functionality and to generate detailed timing information. As circuit designers push the limits on chip density and complexity, more powerful parallel processing resources and more efficient techniques are needed to speed up the simulation process. This dissertation addresses some general issues in parallel circuit simulation and investigates a variety of classical algorithms on the Cedar multiprocessor. Unfortunately, the range of behavior observed for these algorithms applied to various types of circuits is considerable. In an attempt to combine the advantages of several well-established algorithms, a hierarchical framework called CedarSim is proposed. This framework uses a hierarchical relaxation approach and allows different combinations of algorithms to be used at different levels. The objective is to allow each subcircuit to be solved using the most appropriate technique. This flexibility makes it possible to switch between standard and hierarchical algorithms to adapt to varying conditions. The proper functioning of this framework also hinges on appropriate circuit partitioning and effective algorithm selection, which are major research topics by themselves. This dissertation shows that, given proper mechanisms for these two tasks, CedarSim can deliver reasonable performance. This framework can also adapt to poor partitioning by using hierarchical relaxation and aggressive latency exploitation in several algorithms. Performance evaluation tools and techniques are used extensively to understand the behavior of the algorithms and the architecture and to study the interactions between various performance issues. Observations on the strengths and weaknesses of machines such as Cedar are also made. The knowledge acquired in this work also serves as a guideline for a more ambitious goal of developing a portable parallel circuit simulator.","abstract_has_math":false,"creators":["Hung, Gih-Guang"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Gallivan, Kyle A.","Saleh, Resve A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-16T22:23:18Z","date_published":"2014-12-16T22:23:18Z","updated_at":"2026-07-22T22:26:06Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9411660"],"render_values":[{"text":"(UMI)AAI9411660","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72012","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Gallivan, Kyle A.","Saleh, Resve A."]},{"key":"dc:creator","label":"Author","values":["Hung, Gih-Guang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-16T22:23:18Z","10000-01-01","1993"]},{"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","Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72012","(UMI)AAI9411660"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Circuit simulation remains an indispensable tool in the CAD community and is used widely to verify circuit functionality and to generate detailed timing information. As circuit designers push the limits on chip density and complexity, more powerful parallel processing resources and more efficient techniques are needed to speed up the simulation process. This dissertation addresses some general issues in parallel circuit simulation and investigates a variety of classical algorithms on the Cedar multiprocessor. Unfortunately, the range of behavior observed for these algorithms applied to various types of circuits is considerable. In an attempt to combine the advantages of several well-established algorithms, a hierarchical framework called CedarSim is proposed. This framework uses a hierarchical relaxation approach and allows different combinations of algorithms to be used at different levels. The objective is to allow each subcircuit to be solved using the most appropriate technique. This flexibility makes it possible to switch between standard and hierarchical algorithms to adapt to varying conditions. The proper functioning of this framework also hinges on appropriate circuit partitioning and effective algorithm selection, which are major research topics by themselves. This dissertation shows that, given proper mechanisms for these two tasks, CedarSim can deliver reasonable performance. This framework can also adapt to poor partitioning by using hierarchical relaxation and aggressive latency exploitation in several algorithms. Performance evaluation tools and techniques are used extensively to understand the behavior of the algorithms and the architecture and to study the interactions between various performance issues. Observations on the strengths and weaknesses of machines such as Cedar are also made. The knowledge acquired in this work also serves as a guideline for a more ambitious goal of developing a portable parallel circuit simulator.","Made available in DSpace on 2014-12-16T22:23:18Z (GMT). No. of bitstreams: 1 9411660.pdf: 10005406 bytes, checksum: 1c589d6e707705550d388825c83fd1a4 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72178 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","211 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."]},{"key":"dc:title","label":"Title","values":["Parallel Circuit Simulation Techniques for a Hierarchical Machine"]}]}],"canonical_facts":{"dc:contributor":["Gallivan, Kyle A.","Saleh, Resve A."],"dc:creator":["Hung, Gih-Guang"],"dc:date":["2014-12-16T22:23:18Z","10000-01-01","1993"],"dc:description":["Circuit simulation remains an indispensable tool in the CAD community and is used widely to verify circuit functionality and to generate detailed timing information. As circuit designers push the limits on chip density and complexity, more powerful parallel processing resources and more efficient techniques are needed to speed up the simulation process. This dissertation addresses some general issues in parallel circuit simulation and investigates a variety of classical algorithms on the Cedar multiprocessor. Unfortunately, the range of behavior observed for these algorithms applied to various types of circuits is considerable. In an attempt to combine the advantages of several well-established algorithms, a hierarchical framework called CedarSim is proposed. This framework uses a hierarchical relaxation approach and allows different combinations of algorithms to be used at different levels. The objective is to allow each subcircuit to be solved using the most appropriate technique. This flexibility makes it possible to switch between standard and hierarchical algorithms to adapt to varying conditions. The proper functioning of this framework also hinges on appropriate circuit partitioning and effective algorithm selection, which are major research topics by themselves. This dissertation shows that, given proper mechanisms for these two tasks, CedarSim can deliver reasonable performance. This framework can also adapt to poor partitioning by using hierarchical relaxation and aggressive latency exploitation in several algorithms. Performance evaluation tools and techniques are used extensively to understand the behavior of the algorithms and the architecture and to study the interactions between various performance issues. Observations on the strengths and weaknesses of machines such as Cedar are also made. The knowledge acquired in this work also serves as a guideline for a more ambitious goal of developing a portable parallel circuit simulator.","Made available in DSpace on 2014-12-16T22:23:18Z (GMT). No. of bitstreams: 1 9411660.pdf: 10005406 bytes, checksum: 1c589d6e707705550d388825c83fd1a4 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72178 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","211 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."],"dc:identifier":["http://hdl.handle.net/2142/72012","(UMI)AAI9411660"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Parallel Circuit Simulation Techniques for a Hierarchical Machine"],"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:26:06Z"}