Multicore architectures are becoming available in embedded systems. However, parallelizing sequential software is a challenging task. A structured approach is needed to exploit parallel opportunities. Therefore we propose a topdown approach based on a layered model of parallel design patterns. As a proof of concept this approach has been applied on a number of algorithms including the Fast Fourier Transformation. The FFT algorithm has been implemented parallel on a Linux based embedded system while others were implemented in a freestanding environment.status: publishe
In the quest for additional computational power to provide higher software performance, industry hav...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
Multicore embedded systems introduce new opportunities and challenges. Scaling of computational powe...
Writing parallel software effectively for embedded systems is not an easy task. We believe a new app...
This paper describes a portable programming environment for MIMD concurrent processors based on an o...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
A class of parallel programs, based on Free Choice Petri nets, is modeled by associating operators a...
A class of parallel programs, based on Free Choice Petri nets, is modeled by associating operators a...
We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. O...
Increased complexity of memory systems to ameliorate the gap between the speed of processors and mem...
We are now entering the multi-core era, many multi-core chips are designed and manufactured by vario...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
An efficient parallel form in digital signal processor can improve the algorithm performance. The bu...
The emergence of streaming multicore processors with multi-SIMD (single-instruction multiple-data) a...
In the quest for additional computational power to provide higher software performance, industry hav...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
Multicore embedded systems introduce new opportunities and challenges. Scaling of computational powe...
Writing parallel software effectively for embedded systems is not an easy task. We believe a new app...
This paper describes a portable programming environment for MIMD concurrent processors based on an o...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
A class of parallel programs, based on Free Choice Petri nets, is modeled by associating operators a...
A class of parallel programs, based on Free Choice Petri nets, is modeled by associating operators a...
We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. O...
Increased complexity of memory systems to ameliorate the gap between the speed of processors and mem...
We are now entering the multi-core era, many multi-core chips are designed and manufactured by vario...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
An efficient parallel form in digital signal processor can improve the algorithm performance. The bu...
The emergence of streaming multicore processors with multi-SIMD (single-instruction multiple-data) a...
In the quest for additional computational power to provide higher software performance, industry hav...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...