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

Klas Arvidsson

dblp:60/4562 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 2

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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.012004
Efficient test solutions for core-based designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Electronic design automation › hardware verification and test › design for testability
test access mechanism
0.012004
Efficient test solutions for core-based designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Electronic design automation › hardware verification and test
test scheduling
0.012004
Efficient test solutions for core-based designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Electronic design automation › hardware verification and test › system-on-chip testing
core-based system testing
0.012004
Efficient test solutions for core-based designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004

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

integer programming · 0.0heuristic optimization · 0.0
YearPublicationVenuePosition
2004 Efficient test solutions for core-based designs
abstract
A test solution for a complex system requires the design of a test access mechanism (TAM), which is used for the test data transportation, and a test schedule of the test data transportation on the designed TAM. An extensive TAM will lead to lower test-application time at the expense of higher routing costs, compared to a simple TAM with low routing cost but long testing time. It is also possible to reduce the testing time of a testable unit by loading the test vectors in parallel, thus increasing the parallelization of a test. However, such a test-time reduction often leads to higher power consumption, which must be kept under control since exceeding the power budget could damage the system under test. Furthermore, the execution of a test requires resources and concurrent execution of tests may not be possible due to resource or other conflicts. In this paper, we propose an integrated technique for test scheduling, test parallelization, and TAM design, where the test application time and the TAM routing are minimized, while considering test conflicts and power constraints. The main features of our technique are the efficiency in terms of computation time and the flexibility to model the system's test behavior, as well as the support for the testing of interconnections, unwrapped cores and user-defined logic. We have implemented our approach and made several experiments on benchmarks as well as industrial designs in order to demonstrate that our approach produces high-quality solution at low computational cost.
Erik Larsson, Klas Arvidsson, Hideo Fujiwara, Zebo Peng
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2002 Integrated Test Scheduling, Test Parallelization and TAMDesign
abstract
We propose a technique integrating test scheduling, scan chain partitioning and test access mechanism (TAM) design to minimize the test time and the TAM routing cost while considering test conflicts and power constraints. The main features of our technique are (1) the flexibility in modelling the systems test behaviour and (2) the support for interconnection test of unwrapped cores and user-defined logic. Experiments using our implementation on several benchmarks and industrial designs demonstrate that it produces high quality solution at low computational cost.
Erik Larsson, Klas Arvidsson, Hideo Fujiwara, Zebo Peng
Asian Test Symposium2