Files in this item

FilesDescriptionFormat

application/pdf

application/pdf8815430.pdf (4MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Piecewise Linear Approach for Timing Simulation of VLSI Circuits on Serial and Parallel Computers
Author(s):Tejayadi, Ongky
Doctoral Committee Chair(s):Hajj, Ibrahim N.
Department / Program:Electrical Engineering
Discipline:Electrical Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Engineering, Electronics and Electrical
Computer Science
Abstract:The work presented in this thesis deals with the development of a fast and fairly accurate Computer Aided Design software for simulating very-large-scale-integrated (VLSI) circuits. The methods rely on piecewise linearized nonlinear elements in the circuits.
The piecewise linear approaches explored in this work are (1) A fast piecewise linear Gauss-Seidel waveform relaxation method. (2) A slower but more accurate piecewise linear method based on simplices. (3) A Gauss-Seidel piecewise linear method with dynamic partitioning.
Also described in a mixed method which combines the fast piecewise linear method and the dynamic partitioning method. The circuit to be analyzed is partitioned into dc-connected subcircuits and then sequenced for analysis. Small subcircuits are solved using the fast piecewise linear method while large subcircuits, including the strongly-connected components in the circuit, are solved using the dynamic partitioning method.
A parallel implementation of the Gauss-Seidel piecewise linear method with dynamic partitioning on a uniprocessor computer is studied. Algorithms for the parallel implementation of the dynamic partitioning approach on a multiprocessor with shared memory (Alliant FX/8) are also explained in detail.
The piecewise linear methods presented in this work have been implemented in a set of programs called PLATINUM. The waveforms generated by PLATINUM are fairly accurate as compared to SPICE2, and the speedup for a uniprocessor machine is over two orders of magnitude, while the parallel implementation gives an additional 4 to 6 times speed improvements.
Issue Date:1988
Type:Text
Description:139 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.
URI:http://hdl.handle.net/2142/69391
Other Identifier(s):(UMI)AAI8815430
Date Available in IDEALS:2014-12-15
Date Deposited:1988


This item appears in the following Collection(s)

Item Statistics