We select the Fast Fourier Transfrom (FFT) to demonstrate a methodology for deriving the optimal parallel algorithm according to predetermined performance metrics, within a computational model. Following the vector space framework for parallel permutations, we provide a speciication language to capture the algorithm, derive the optimal parallel FFT speciication, compute the arithmetic, memory, ...

Realizzazione di modelli di varie architetture di calcolatori paralleli (di tipo SIMD, MIMD e ibridi) e loro validazione sperimentale To Floriana Acknowledgments I would like to thank my supervisor Prof. Giuseppe Serazzi for the inspiration , guidance, friendship ooered throughout my studies. I feel a special gratitude towards Peter King and Paolo Cremonesi for their important contribution to t...

In this paper we describe the parallelization of a local area ocean circulation model using HPF. We nd that this particular problem, leading to a typical data parallel algorithm is easily expressed in HPF. The problems which occurs is mainly due to restrictions in the current HPF-compilers. We have run our program on 3 diierent platforms, using diierent HPF-compilers. and will report on the sta...

Parallel programming models exist as an abstraction of hardware and memory architectures. There are several parallel programming models in commonly use; they are shared memory model, thread model, message passing model, data parallel model, hybrid model, Flynn’s models, embarrassingly parallel computations model, pipelined computations model. These models are not specific to a particular type o...