Sciweavers

Share
ICS
2007
Tsinghua U.

Scheduling FFT computation on SMP and multicore systems

9 years 1 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code within a palatable amount of time. With the emergence of multicore (CMP), multiprocessor (SMP) and hybrid shared memory multiprocessor architectures, achieving high efficiency is becoming even more challenging. To address the challenge to achieve high efficiency in performance critical applications, domain specific frameworks have been developed that aid the compilers in scheduling the computations. We have developed a portable framework for the Fast Fourier Transform (FFT) that achieves high efficiency by automatically adapting to various architectural features. Adapting to parallel architectures by searching through all the combinations of schedules (plans) is an expensive task, even when the search is conducted in parallel. In this paper, we develop heuristics to simplify the generation of better schedul...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICS
Authors Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
Comments (0)
books