Results 1 
2 of
2
From Transformations to Methodology in Parallel Program Development: A Case Study
 Microprocessing and Microprogramming
, 1996
"... The BirdMeertens formalism (BMF) of higherorder functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We dev ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
The BirdMeertens formalism (BMF) of higherorder functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We develop a parallel program for polynomial multiplication, starting with a straightforward mathematical specification and arriving at the target processor topology together with a program for each processor of it. The development process is based on formal transformations; design decisions concerning data partitioning, processor interconnections, etc. are governed by formal type analysis and performance estimation rather than made ad hoc. The parallel target implementation is parameterized for an arbitrary number of processors; for the particular number, the target program is both time and costoptimal. We compare our results with systolic solutions to polynomial multiplication.
Mapping Regular Recursive Algorithms To FineGrained Processor Arrays
, 1994
"... With the continuing growth of VLSI technology, specialpurpose parallel processors have become a promising approach in the quest for high performance. Finegrained processor arrays have become popular as they are suitable for solving problems with a high degree of parallelism, and can be inexpensive ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
With the continuing growth of VLSI technology, specialpurpose parallel processors have become a promising approach in the quest for high performance. Finegrained processor arrays have become popular as they are suitable for solving problems with a high degree of parallelism, and can be inexpensively built using custom designs or commercially available field programmable gate arrays (FPGA). Such specialized designs are often required in portable computing and communication systems with realtime constraints, as softwarecontrolled processors often fail to provide the necessary throughput. This thesis addresses many issues in designing such applicationspecific systems built with finegrained processor arrays for regular recursive uniform dependence algorithms. A uniform dependence algorithm consists of a set of indexed computations and a set of uniform dependence vectors which are independent of the indices of computations. Many important applications in signal/image processing, commun...