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

Joan Villoldo

dblp:81/5512 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 3 · 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
2 papers
Electronic design automation · 86% Parallel and multicore computing · 14%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.021993
Test Pattern Generation for Sequential Circuits on a Network of Workstations · HPDC 1993
Sequential Circuit Test Generation on a Distributed System · DAC 1993
Electronic design automation › hardware verification and test › test generation
sequential circuit test generation
0.021993
Test Pattern Generation for Sequential Circuits on a Network of Workstations · HPDC 1993
Sequential Circuit Test Generation on a Distributed System · DAC 1993
Electronic design automation › hardware verification and test
test generation
0.021993
Test Pattern Generation for Sequential Circuits on a Network of Workstations · HPDC 1993
Sequential Circuit Test Generation on a Distributed System · DAC 1993
Parallel and multicore computing › parallel computing
parallel applications
0.011993
Test Pattern Generation for Sequential Circuits on a Network of Workstations · HPDC 1993
Electronic design automation › hardware verification and test › test generation
parallel test generation
0.011993
Sequential Circuit Test Generation on a Distributed System · DAC 1993

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

speedup modeling · 0.0parallelization · 0.0fault simulation · 0.0distributed computing · 0.0
YearPublicationVenuePosition
1993 Sequential Circuit Test Generation on a Distributed System
abstract
A sequential circuit teat generation program ts paratleltzed to run on a network of Spare 2 workstations con.
Prathima Agrawal, Vishwani D. Agrawal, Joan Villoldo
DAC3
1993 Test Pattern Generation for Sequential Circuits on a Network of Workstations
abstract
A sequential circuit test generation program is parallelized to run on a network of Sparc 2 workstations connected through ethernet. The program attempts to compute tests to detect all faults in a given list. The fault list is equally divided among the processors. The entire process consists of a series of parallel computing passes with synchronization occurring between passes. During a pass, each processor independently generates test sequencies for the assigned faults through vector generation and fault simulation. A fixed per-fault CPU time limit is used within a pass. Faults requiring more time are abandoned for later passes. Each processor simulates the entire fault list with its vectors and communicates the list of undetected faults to all other processors. Processors then combine these fault lists to create a list of faults that were not detected by all processors. This list is again equally divided and the next pass begins with a larger per-fault time limit for test generation. The process stops after either the required fault coverage is achieved or the pass with given maximum per-fault time limit is completed. Some benchmark results are given to show the advantage of distributed system for large circuits. Finally, the authors study a speedup model that considers duplicated computation and interprocessor communication.>
Prathima Agrawal, Vishwani D. Agrawal, Joan Villoldo
HPDC3
1991 Stafan Algorithms for MOS Circuits
abstract
Novel models and algorithms for MOS transmission gates, buses and functional memories for use in statistical fault analysis (Stafan) are described. A bus is modeled as a multiple input multiplexer with feedback to account for its memory state. A CMOS transmission gate, modeled as a unidirectional device, always feeds into a bus that processes the high impedance state. Novel algorithms are devised to compute input observabilities of functional memory blocks. A novel implementation of Stafan algorithms is described for the MARS hardware accelerator environment. MARs is run in the true-value simulation mode and sends signal changes for all lines through a Unix pipe to the Stafan process running on a SUN workstation. The Stafan process computes controllabilities, observabilities, detection probabilities, and fault coverage. MARS and Stafan thus run as a pipeline. Results on several CMOS circuits are obtained and compared with those obtained from a concurrent fault simulator.>
Joan Villoldo, Prathima Agrawal, Vishwani D. Agrawal
ICCD1