Synthesizing synchronous systems by static scheduling in space-time (Q1187649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Juraj Hromkovič / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Juraj Hromkovič / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:28, 5 March 2024

scientific article
Language Label Description Also known as
English
Synthesizing synchronous systems by static scheduling in space-time
scientific article

    Statements

    Synthesizing synchronous systems by static scheduling in space-time (English)
    0 references
    0 references
    23 January 1993
    0 references
    The subject of this book is the synthesis of synchronous concurrent systems with local memory. The purpose is to provide a generalized algebraical framework for the so-called space-time mapping methods for hardware synthesis. The space-time mapping methods provide a description of the minimal fixed hardware required to compute a given computing problem. Computing problems are described by output specifications which enable to present an algorithm as a set of atomic events, with possible data dependencies between them. The hardware description is a directed, labelled graph, where the nodes represent processing elements and edges communication lines with discrete delays. Some space-time transformations which enable to derive and to compare several distinct parallel architectures for a given computing problem are also considered.
    0 references
    space-time schedules
    0 references
    parallel processing
    0 references
    systolic arrays
    0 references
    VLSI- algorithms
    0 references
    synchronous concurrent systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references