In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors- test set partition and fault set partition. The sequential algorithm for fault simulation, used on individual nodes of the network, is based on a novel path compression technique proposed in this paper. We describe experimental results on a number of ISCAS '85 benchmark circuits. 1
AbstractIn this paper, a novel approach is introduced on accelerating the fault simulation speed on ...
In this paper, we explore the implementation of fault simulation on a Graphics Processing Unit (GPU)...
Abstract We present a new multiprocessor sequential circuit fault simulator, Zamlog, b ased on a nov...
In this paper, we describe distributed algorithms for combinational fault simulation assuming the cl...
Distributed computing attempts to aggregate different computing resources available in enterprises a...
To explore the potential speedup to be obtained through parallelism, a mathematical model for the pe...
We propose a new method to speed up stuck-at fault simulation for sequential circuits. The method co...
110 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.All implementations were done...
Trace-based methods have been shown to be more effective than traditional fault simulation methods. ...
Current and future multicore architectures can significantly accelerate the performance of test auto...
In the past decade, the use of distributed algorithms to model simulations is considerably increased...
We consider issues of fault tolerance for distributed computing systems at two levels of system desi...
Abstract Embedded parallel and distributed computing systems for real-time applications are becoming...
With increase in complexity of digital circuits, it has become extremely important to detect faults ...
In this paper, a methodology for distributed fault diagnosis is proposed. The algorithm p...
AbstractIn this paper, a novel approach is introduced on accelerating the fault simulation speed on ...
In this paper, we explore the implementation of fault simulation on a Graphics Processing Unit (GPU)...
Abstract We present a new multiprocessor sequential circuit fault simulator, Zamlog, b ased on a nov...
In this paper, we describe distributed algorithms for combinational fault simulation assuming the cl...
Distributed computing attempts to aggregate different computing resources available in enterprises a...
To explore the potential speedup to be obtained through parallelism, a mathematical model for the pe...
We propose a new method to speed up stuck-at fault simulation for sequential circuits. The method co...
110 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.All implementations were done...
Trace-based methods have been shown to be more effective than traditional fault simulation methods. ...
Current and future multicore architectures can significantly accelerate the performance of test auto...
In the past decade, the use of distributed algorithms to model simulations is considerably increased...
We consider issues of fault tolerance for distributed computing systems at two levels of system desi...
Abstract Embedded parallel and distributed computing systems for real-time applications are becoming...
With increase in complexity of digital circuits, it has become extremely important to detect faults ...
In this paper, a methodology for distributed fault diagnosis is proposed. The algorithm p...
AbstractIn this paper, a novel approach is introduced on accelerating the fault simulation speed on ...
In this paper, we explore the implementation of fault simulation on a Graphics Processing Unit (GPU)...
Abstract We present a new multiprocessor sequential circuit fault simulator, Zamlog, b ased on a nov...