Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

George K. Jacob

dblp:91/453 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1986
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-author

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
1 paper
Electronic design automation · 61% Performance modeling and evaluation · 39%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation
0.011986
An empirical analysis of the performance of a multiprocessor-based circuit simulator · DAC 1986
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
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

multiprocessor scheduling · 0.0gauss-seidel iteration · 0.0
YearPublicationVenuePosition
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
DAC1