Volume 16, 1997, No. 1


Designing of Processor-Time Optimal Hexagonal Systolic Array for Matrix Multiplication

E.I. Milovanovič, I.Z. Milentijevič, I.Ž. Milovanovič

Abstract. A procedure for synthesizing 2D hex systolic array of Kung´s type for square matrix-matrix multiplication is proposed.  The procedure is based on data dependence approach. The systolic array synthesized by this procedure is processor-time optional. The obtained array has n2 processing elements, compared with 3n2-3n+1 in the original Kung´s array. The active execution time of the array is 3n-2 time units.

 

RT Level Test Scheduling

J. Blatný, Z, Kotásek, J. Hlavička

Abstract. The paper describes a new model of exploiting parallelism in testing of VLSI circuits. A circuit at the register transfer level is denoted as an RTL circuit. The model utilizes the concept of TACG (Test Application Conflict Graph). For the testing process the resource utilization model is defined and used for the TACG construction.  Different conflicts that must be taken into account during an RTL circuit test scheduling are presented. The problem of concurrent test application is transformed to the one of TACG coloring and covering its nodes. Thus, the graph theory algorithms can be utilized for an RT level test schedules. The way how to use a TACG for an RTL circuit modification is also presented.

The paper offers a methodology that can be utilized during VLSI circuit design process, the final goal of which is to reduce the overall test application time of an RTL circuit.

 

An Architecture of a Parallel Grid Multiprocessor

V.P. Ilyin, Ya. I. Fet

Abstract. An architecture is described of a specialized PGM (Parallel Grid Multiprocessor) supercomputer directed toward efficient solution of large scale numerical problems by grid methods for partial differential equations of different types. The project is based on intermediate mapping of the structure of computations and data streams characteristic for grid methods into the hardware architecture. The organization of two important PGM subsystems is described, namely the distributed interconnection network, and the set of parallel functional modules.

 

Diagnostic Bayesian Networks

G. Agre

Abstract. The paper presents a casual-probabilistic approach to the technical diagnosis in which the solution of the technical diagnostic problem is considered as a probabilistic inference on a special kind of Bayesian networks called Diagnostic Bayesian Networks. A mechanism of probabilistic inference and an algorithm for inference control are described. It is provided that a diagnostic problem represented by a singly connected Diagnostic Bayesian network can be decomposed to a sequence of subproblems with directed tree of multitree topology which are exactly solved in the sense of minimizing the average number of executed tests. The applications of the approach and future trends are briefly discussed.

 

Contribution to the Reliability of Wide Area Computer Network

M. Krokavec

Abstract. The paper introduces original improving reliability characteristic and user reliability characteristics of wide area computer networks and method of speeding up of their computation by decreasing the number of processed network states.

 

VegeDog: Formalism, Vegetarian Dogs, and Partonomies

in Transition

E. Nissan, S.E. Shimony

Abstract. The pragmatics of 'vegetarian' and 'carnivorous' exhibits an asymmetry that we put in evidence by analyzing a newspaper  report about vegetarian dog-owners imposing a vegetarian diet on their pets. More fundamental is the problem of partonomy versus containment, for which we attempt a naive but formal analysis applied to ingestion and the food chain, an issue we derive from the same text analyzed. Our formal tools belong in commonsense modelling, a domain of artificial intelligence related to extra-linguistic knowledge and pragmatics. We first provide an interpretation of events analyzed, and express it graphically in a semantic-network related representation, and propose an alternative that we express in terms of a modal logic, avoiding the full representational power of Hayes's "ontology for liquids".


Go To Contents