Topological transformations as a tool in the design of systolic networks (Q1069704): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Radim Jiroušek / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Radim Jiroušek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folding of the plane and the design of systolic arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real-time cellular automata and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatat† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmable finite automata for VLSI† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of systolic binary tree automata and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed of Recognition of Context-Free Languages by Array Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3722428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative arrays with direct central control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing with the Perfect Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-way simulation of two-way real-time cellular automata and its related problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90091-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978546206 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Topological transformations as a tool in the design of systolic networks
scientific article

    Statements

    Topological transformations as a tool in the design of systolic networks (English)
    0 references
    0 references
    0 references
    1985
    0 references
    A systolic network, or more generally a computational network (CN), is a formal model of an arbitrary system of parallel processors. It is described by an ordered (generally infinite) digraph with several mappings assigned to its nodes and edges. Some of them express a computational process performed the others can be interpreted as synchronization functions. One of the main notions studied in the paper is the concept of equivalence of two CN's which is defined on the basis of an isomorphism of their space-time diagrams (unrollings). The main tool, a topological transformation of one CN into an equivalent one is used for proving several theorems including systolic conversion theorem. Another important notion describing situations when two CN's performs essentially identical computations is the concept of simulation of one CN on another one. This, as well as the whole article, is illustrated by a number of examples enabling to understand the rather complicated formalism.
    0 references
    parallel processing
    0 references
    computational network
    0 references
    equivalence
    0 references
    isomorphism
    0 references
    space-time diagrams
    0 references
    unrollings
    0 references
    simulation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references