Computer Science, № 14, 2001

Two-tier procedure of constructing compound model of computing structure with fine-grain parallelism are discussed in this paper. The description of tools of construction is presented. It was shown that the visual programming technology was utilized for their creation, and the care was taken to give to the user intuitively understandable...

In this paper, we continue the study of a parallel FSM equation. We establish that the solution set has a lattice structure and consider two restricted solutions to the equation, namely, a supremal and a livelock-free solution.

The algorithms for minimization of large-dimension functions with linear constraints with allowance for sparseness of the limitation matrices are considered. A~special case of the quadratic programming is emphasized. The algorithms have been implemented as a package of software programs to be used in the operational environments DOS, UNIX.

In this paper, by means of a model of associative parallel systems with the vertical processing (the STAR-machine), we propose a natural straight forward representation of the Edmonds–Karp version of performing the Ford shortest path algorithm. We present the associative parallel algorithm as the corresponding STAR procedure and prove its...

The methods and tools of model construction with fine-grain algorithms and structures are considered and demonstrated by typical examples. The usage of the system for models with complicated structure and large amount of data is presented.

The Object Visualization Engine library developed by the authors is described in the paper and its architecture is substantiated. This library provides an easy way for a user to implement the modules for custom visualization of cellular objects. These modules are called Object Visualization Drivers (OVD). The algorithm of the...

In this paper, the first-order Cellular Neural Networks (CNN) with homogeneous weight structure are investigated and an approach to learn them is suggested. It is shown that all CNN weight templates are classified according to properties of possible stable states. As the result, the proposed learning method is based on...

A parallel algorithm is presented for the input of data arrays (partly, of images) into processors of a distributed computer system (CS). The algorithm minimizes the input time by means of effective routing of array fragments in the CS interconnection network. The algorithm modeling shows that it is optimum for...