Megson, Graham M. (1993) Mapping a class of run-time dependencies onto regular arrays. In: Proceedings of Seventh International Parallel Processing Symposium. IEEE, Los Alamitos, USA, pp. 97-104. ISBN 0818634421Full text not available from this repository.
The production of regular computations using algorithmic engineering techniques is beginning to play an important role in the synthesis of massively parallel and VLSI processor arrays. The author widens the class of algorithms that can be formally synthesized by introducing a mapping theorem for a class of algorithms with run-time dependencies. The technique is illustrated by deriving uniform recurrences for the so-called knapsack problem, the resulting systolic array is known to be optimal.
|Item Type:||Book Section|
|Uncontrolled Keywords:||Parallel algorithms, systolic arrays, VLSI processor arrays, algorithmic engineering, knapsack problem, mapping theorem, massively parallel, regular arrays regular computations, run-time dependencies, systolic array, uniform recurrences|
|Subjects:||University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)|
|Depositing User:||Miss Nina Watts|
|Date Deposited:||27 Jan 2009 16:48|
|Last Modified:||19 Oct 2009 15:28|
Actions (login required)
|Edit Item (Repository staff only)|