Computer Science, № 2, 1994

Operation of parallel substitutions over cellular arrays in mixed (synchronous-asynchronous) mode is studied. Correctness conditions for parallel substitution systems in this mode of execution are stated.

The aim of this paper is to introduce the new kind of decomposition for computer colour images based on the three-factors analysis of the palette and to demonstrate the improvement of the compression coefficients in the comparison with the well-known PAL television oriented decomposition standard.

Asynchronous versus synchronous cellular computations are investigated in terms of Parallel Substitution Algorithm (a formal model of fine-grained parallel data processing). A general method for constructing asynchronous cellular computation equivalent to a given cellular algorithm execution is presented. It is shown that more than a twofold increase in cell-complexity should...

This paper is devoted to the application of specialized processors for speeding-up the realization of relational algebra operations on fine-grain SIMD computers. A short description of two processors is presented. By means of a special high level language STAR, the algorithms of implementation of relational algebra operations in a STARAN-like...

Peculiarity of the most direct algorithms for solving system of linear equations is the use of divisions for the elimination of unknowns. Divisions require a great time for its execution, when the multiprecision arithmetic is used because in this case they are realized by special programs. The paper describes the...

Event structures have widely been proposed as a basis for constructing models of nondeterministic processes. However, not all event structures are turned out to be suitable for this purpose. One way to get around this problem is to adapt Petri's concurrency axioms (including K-density and related properties) to event structures...