Donald O. Pederson

dblp:72/1089 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 8

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
5 papers
Electronic design automation · 95% Performance modeling and evaluation · 5%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation
0.051994
Algorithms for the transient simulation of lossy interconnect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Coupling algorithms for mixed-level circuit and device simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Simulating Lossy Interconnect with High Frequency Nonidealities in Linear Time · DAC 1992
Electronic design automation › circuit simulation
transient analysis
0.021994
Algorithms for the transient simulation of lossy interconnect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Efficient Transient Simulation of Lossy Interconnect · DAC 1991
Electronic design automation › circuit simulation
interconnect simulation
0.021992
Simulating Lossy Interconnect with High Frequency Nonidealities in Linear Time · DAC 1992
Efficient Transient Simulation of Lossy Interconnect · DAC 1991
Electronic design automation › circuit simulation
device and circuit simulation
0.011992
Coupling algorithms for mixed-level circuit and device simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › interconnect modeling
lossy interconnect
0.011991
Efficient Transient Simulation of Lossy Interconnect · DAC 1991
Electronic design automation › circuit simulation
parallel circuit simulation
0.011986
An empirical analysis of the performance of a multiprocessor-based circuit simulator · DAC 1986
Performance modeling and evaluation
simulation
0.011986
An empirical analysis of the performance of a multiprocessor-based circuit simulator · DAC 1986
Electronic design automation
interconnect modeling
0.011994
Algorithms for the transient simulation of lossy interconnect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Performance modeling and evaluation
bottleneck analysis
0.011986
An empirical analysis of the performance of a multiprocessor-based circuit simulator · DAC 1986

Methods — techniques the papers use, named apart from their topics

numerical convolution · 0.0lumped-RLC method · 0.0two-level newton algorithm · 0.0model order reduction · 0.0latency scheme · 0.0block LU decomposition · 0.0numerical integration · 0.0multiprocessor scheduling · 0.0gauss-seidel iteration · 0.0
YearPublicationVenuePosition
1994 Algorithms for the transient simulation of lossy interconnect
abstract
In this paper, a new linear-time technique is described for the simulation of lossy lines with frequency-independent R, L, C and G. Exact analytic forms are shown to exist for the frequency-independent lossy line, with application in both the new technique and the conventional convolution method. Numerical convolution formulae that exploit the analytic forms are presented. Experimental results for industrial circuits indicate that the new technique can be 10 and 50 times faster than the convolution and lumped-RLC methods, respectively, for long simulations.>
Jaijeet S. Roychowdhury, A. Richard Newton, Donald O. Pederson
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1992 Simulating Lossy Interconnect with High Frequency Nonidealities in Linear Time
Jaijeet S. Roychowdhury, A. Richard Newton, Donald O. Pederson
DAC3
1992 Coupling algorithms for mixed-level circuit and device simulation
abstract
A general framework for mixed-level circuit and device simulation is described. This framework was used in the development of the simulation program CODECS (coupled device and circuit simulator). Various algorithms to couple the device and circuit simulators for DC and transient analyses have been implemented in CODECS. These algorithms are evaluated based on their convergence properties and run-time performance. This study provides guidelines for choosing a particular coupling algorithm. A modified two-level Newton algorithm is used for DC analysis, whereas a full block-LU decomposition algorithm is used for transient analysis. This combination of algorithms provides reasonable convergence and run-time performance. A simple latency scheme provides a 50% speedup. Coupling for small-signal AC and pole-zero analyses are described.>
Kartikeya Mayaram, Donald O. Pederson
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1991 Efficient Transient Simulation of Lossy Interconnect
abstract
Article Free Access Share on Efficient transient simulation of lossy interconnect Authors: Jaijeet S. Roychowdhury Department of Electrical Engineering and Computer Sciences, University of California, Berkeley Department of Electrical Engineering and Computer Sciences, University of California, BerkeleyView Profile , Donald O. Pederson Department of Electrical Engineering and Computer Sciences, University of California, Berkeley Department of Electrical Engineering and Computer Sciences, University of California, BerkeleyView Profile Authors Info & Claims DAC '91: Proceedings of the 28th ACM/IEEE Design Automation ConferenceJune 1991 Pages 740–745https://doi.org/10.1145/127601.127762Published:01 June 1991Publication History 72citation503DownloadsMetricsTotal Citations72Total Downloads503Last 12 Months21Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Jaijeet S. Roychowdhury, Donald O. Pederson
DAC2
1991 An Impulse-Response Based Linear Time-Complexity Algorithm for Lossy Interconnect Simulation
abstract
A linear time-complexity algorithm for lossy transmission line simulation within arbitrary nonlinear circuits is presented. The method operates by storing information about the state of the line at dynamically selected internal points and using an analytical formulation based on impulse responses to predict the line's future behavior accurately. Previous approaches using impulse responses possess quadratic-time complexity. The proposed method does not require rational or other approximations of transfer functions to achieve linear time-complexity, nor does it increase the size of the simulator's matrix by more than 2 for each transmission line. Experimental results on industrial circuits indicate that, for equivalent or superior accuracy, the state-based method can be faster for simulations of one or more block or data pulses, with speedups of more than 10 and 50 over the convolution and lumped-RLC methods for the longer simulations.>
Jaijeet S. Roychowdhury, A. Richard Newton, Donald O. Pederson
ICCAD3
1988 CODECS: a fixed mixed-level device and circuit simulator
abstract
Mixed-level device and circuit simulation allows the use of one- or two-dimensional numerical models for critical devices in a circuit configuration. CODECS is a mixed-level device and circuit simulator that has been developed to support a variety of numerical models and analyses capabilities. Effective coupling of device and circuit simulation capabilities is achieved by a proper choice of algorithms and architecture. Several examples illustrate the advantages of CODECS for simulating both MOS and bipolar circuits.>
Kartikeya Mayaram, Donald O. Pederson
ICCAD2
1986 An empirical analysis of the performance of a multiprocessor-based circuit simulator
abstract
Our original MSPLICE multiprocessor-based circuit simulator showed excellent efficiency with up to 10 processors. As shown in this paper, however, the efficiency of the program drops significantly when over 40 processors are used. A new generation of the MSPLICE program is described which shows high efficiency with up to 99 processors for three different benchmark circuits. Data is compared against predictions made from simulations of an ideal Gauss-Seidel machine model with unit delay, and the data as well as the model are evaluated in light of this comparison. The results from the new implementation are used to study actual limitations that arise as more processors are employed to solve the circuit simulation problem. A major problem identified is that of scheduling overhead and queue contention. Elimination of this bottleneck has led to significant performance improvement. Another bottleneck discovered in the original implementation was that of global data structure contention. Solutions for these and other problems have been implemented in MSPLICE and are currently being used to direct the continued development of the program.
George K. Jacob, A. Richard Newton, Donald O. Pederson
DAC3
1982 VICTOR : A Fast VLSI Testability Analysis Program
Ion M. Ratiu, Alberto L. Sangiovanni-Vincentelli, Donald O. Pederson
ITC3