The goal of IC production test is to avoid selling bad parts. The goal of fault grading is to assure that the test is so thorough that only an acceptably small fraction of shipped parts are bad. Fault grading is almos...
详细信息
The goal of IC production test is to avoid selling bad parts. The goal of fault grading is to assure that the test is so thorough that only an acceptably small fraction of shipped parts are bad. Fault grading is almost always based on a single-stuck fault, ssf, model.< >
The paper presents an execution model and a processor architecture for general purpose massively parallel computers. To construct an efficient massively parallel computer: the execution model should be natural enough ...
详细信息
The paper presents an execution model and a processor architecture for general purpose massively parallel computers. To construct an efficient massively parallel computer: the execution model should be natural enough to map an actual problem structure into a processor architecture; each processor should have efficient and simple communication structure; and computation and communication should be tightly coupled and their operation should be highly overlapped. To meet these, we obtain a simplified architecture with a Continuation Driven Execution Model. We call this architecture RICA. RICA consists of a simplified message handling pipeline, a continuation-driven thread invocation mechanism, a RISC core for instruction execution, a message generation pipeline which can send messages asynchronously with other operations, and a thread switching mechanism with little overhead, all of which are fused in a simple architecture. Next, we state how RICA realizes parallel primitives of programming models and how efficiently it does. The primitives examined are-shared memory primitives, message passing primitives and barriers.< >
The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processo...
ISBN:
(纸本)9780897915922
The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.
An integrated model for real time alarm processing in a real world terminal power station is applied. The integrated model is a combination of a generic neuro-expert system model, object model, and UNIX operating syst...
详细信息
An integrated model for real time alarm processing in a real world terminal power station is applied. The integrated model is a combination of a generic neuro-expert system model, object model, and UNIX operating system process (UOSP) model. It is shown how the massive parallelism and fast execution features of ANNs help to cope with real-time system constraints like data variability and fast response time. For further enhancing reliability, a practical use of competing expert system-artificial neural networks (ES-ANN) objects is proposed.< >
One missing link between CAD and CAM is the lack of a systematic methodology for generating and evaluating alternative ways to manufacture a proposed design. To address this problem, we are developing a systematic app...
详细信息
Neural network (or parallel distributed processing) models have been shown to have some potential for solving optimisation problems. Most formulations result in NP-complete problems and solutions rely on energy based ...
详细信息
Neural network (or parallel distributed processing) models have been shown to have some potential for solving optimisation problems. Most formulations result in NP-complete problems and solutions rely on energy based models, so there is no guarantee that the network converges to a global optimal solution. In this paper, we propose a non-energy based neural shortest path network based on the principle of dynamic programming and least take all network. No problem of local minima exists and it guarantees to reach the optimal solution. The network can work purely in an asynchronous mode which greatly increases the computation speed.
The field of Inductive Logic Programming (ILP) is concerned with inducing logic programs from examples in the presence of back-ground knowledge. This paper defines the ILP problem and describes several syntactic restr...
详细信息
Discusses the implementation of novel programming paradigms on virtual shared memory (VSM) parallel architectures. A wide spectrum of paradigms (data-parallel, functional and logic languages) have been investigated in...
详细信息
Discusses the implementation of novel programming paradigms on virtual shared memory (VSM) parallel architectures. A wide spectrum of paradigms (data-parallel, functional and logic languages) have been investigated in order to achieve, within the context of VSM parallel architectures, a better understanding of the underlying support mechanisms for the paradigms and to identify commonality amongst the different mechanisms. An overview of VSM is given in the context of a commercially available VSM machine: a KSR-1. The correspondence between the features of the high level languages and the VSM features which assist efficient implementation are presented. Case studies are discussed as concrete examples of the issues involved.< >
Most neural network models are energy based models and there is no guarantee that the network converges to a global optimal solution. A new neural shortest path network model is proposed in which no special convergenc...
详细信息
Most neural network models are energy based models and there is no guarantee that the network converges to a global optimal solution. A new neural shortest path network model is proposed in which no special convergence procedure needs to be performed. The network can work in a purely asynchronous mode, and is guaranteed to reach the global optimal solution.< >
Classical constraint handling in data processing systems is concerned with ensuring the integrity of the database. Constraints are usually based on attribute values in a domain, or on syntactic (structural) relationsh...
详细信息
暂无评论