The instruction systolic array and its relation to other models of parallel computers
We investigate the relationships between three different models of parallel computers based on mesh-connected arrays: the processor array (PA), which is an MIMD-array of independent processors, the instruction broadcasting array (IBA), where the instructions are broadcast to all the processors of a column and executed according to selector information which is broadcast to all the processor of a row, and the instruction systolic array (ISA), where the instruction are pumped through the array row by row and combined with selector information which is pumped through the array column by column. For every two of these models we determine tight bounds on the worst-case delay introduced by a transformation of a program on one model into an equivalent program on the other. The results show that the ISA concept combines the advantages of standard systolic arrays with those of the MIMD concept. Since in addition the ISA architecture has smaller area requirements that a corresponding systolic array or MIMD machine it is of strong practical relevance.
- Parallel merging on the instruction systolic array
- scientific article; zbMATH DE number 4056985 (Why is no real title available?)
- scientific article; zbMATH DE number 4094821 (Why is no real title available?)
- scientific article; zbMATH DE number 1834564 (Why is no real title available?)
- Typing the ISA to cluster the processor
- A bit-serial floating-point unit for a massively parallel system on a chip
This page was built for publication: The instruction systolic array and its relation to other models of parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104742)