𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A space—time modeler for systlic algorithms

✍ Scribed by E. Diémoz; G.M. Megson

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
1013 KB
Volume
20
Category
Article
ISSN
0965-9978

No coin nor oath required. For personal study only.

✦ Synopsis

Parallel processing is now a key architectural concept. One form aimed at exploiting massive parallelism is through systolic arrays. The design of systolic arrays via synthesis techniques is now well understood by the means of space and time transformations. This theory is currently being exploited in Newcastle by SADE, a design environment to generate systolic algorithms in an automatic manner. A Snapshot Generator and its implementation in software using C and XGKS is presented. This tool allows the simulation of a typical systolic array, by evolving its computation in space-time, directly from a description generated by existing synthesis techniques. The designer can time-step through his/her design and show how the various data streams actually flow across the resulting array. Such abilities often lead to intuitive insights and improved design before array construction.

📜 SIMILAR VOLUMES

A space–time model for seasonal hurrican
A space–time model for seasonal hurricane prediction
✍ Thomas H. Jagger; Xufeng Niu; James B. Elsner 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract A space–time count process model is explained and applied to annual North Atlantic hurricane activity. The model uses the best‐track data set of historical hurricane positions and intensities, together with climate variables, to determine local space–time coefficients of a right‐truncat

Fast algorithms for optimal FIR filter a
Fast algorithms for optimal FIR filter and smoother of discrete-time state-space models
✍ Wook Hyun Kwon; Kyu Seung Lee; Joon Hwa Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 275 KB

In this paper, fast algorithms are suggested for the optimal FIR filter and smoother of discrete-time state-space models with system noise. While the computation order of the previous algorithms for the optimal FIR filter and smoother is O(N 2) with filter length N, it is shown in this paper that it