Synthesizing synchronous systems by static scheduling in space-time (Q1187649)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synthesizing synchronous systems by static scheduling in space-time |
scientific article; zbMATH DE number 43288
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synthesizing synchronous systems by static scheduling in space-time |
scientific article; zbMATH DE number 43288 |
Statements
Synthesizing synchronous systems by static scheduling in space-time (English)
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
0.88124955
0 references
0.87723404
0 references
0.8750807
0 references
0.87508065
0 references
0.86415523
0 references
0.86091965
0 references