Programming with divide-and-conquer skeletons: A case study of FFT

Journal of Supercomputing

Volumn 12, Issue 1-2, 1998, Pages 85-97

  Gorlatch, Sergei ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Bird Meertens formalism (BMF); Divide and conquer; Fast Fourier Transform (FFT); Parallel programming; Skeletons

Indexed keywords

EXPERT SYSTEMS; FAST FOURIER TRANSFORMS; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

BIRD-MEERTENS FORMALISM; DISTRIBUTABLE HOMOMORPHISM; DIVIDE AND CONQUER SKELETONS;

COMPUTER PROGRAMMING;

EID: 0031650898     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007981511582     Document Type: Article

References (15)

1. K. Achatz and W. Schulte. Architecture independent massive parallelization of divide-and-conquer algorithms. In B. Moeller, editor, Mathematics of Program Construction, Lecture Notes in Computer Science 947, pages 97-127, 1995.
2. J. W. Backus. Can programming be liberated from the von Neumann style? Communications of the ACM, 21:613-641, 1978.
3. R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, NATO ASI Series F: Computer and Systems Sciences. Vol. 55, pages 151-216. Springer Verlag, 1988.
4. M. Cole. Algorithmic Skeletons: A Structured Approach to the Management of Parallel Computation. PhD thesis, University of Edinburgh, 1988.
5. S. Gorlatch. Stages and transformations in parallel programming. In M. Kara et al., editors, Abstract Machine Models for Parallel and Distributed Computing, pages 147-162. IOS Press, 1996.
6. S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bougé et al., editors, Parallel Processing. Euro-Par'96, Lecture Notes in Computer Science 1124, pages 401-408. Springer-Verlag, 1996.
7. S. Gorlatch. Systematic extraction and implementation of divide-and-conquer parallelism. In H. Kuchen and D. Swierstra, editors, Programming Languages: Implementation, Logics and Programs. PLILP'96, Lecture Notes in Computer Science 1140, pages 274-288. Springer-Verlag, 1996.
8. S. Gorlatch. Optimizing compositions of scans and reductions in parallel program derivation. Technical Report MIP-9711, Universität Passau, May 1997.
9. S. Gorlatch and H. Bischof. Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's. In D. Mery, editor, Formal Methods for Parallel Programming: Theory and Applications. Workshop at IPPS'97, pages 80-94, 1997. Available from http://brahms.fmi.uni-passau.de/cl/papers/GorBi97.html.
10. S. Gorlatch and C. Lengauer. Parallelization of divide-and-conquer in the Bird-Meertens formalism. Formal Aspects of Computing, 7(6):663-682, 1995.
11. C. A. Herrmann and C. Lengauer. Parallelization of divide-and-conquer by translation to nested loops. Technical Report MIP-9705, Fakultät für Mathematik und Informatik, Universität Passau, March 1997.
12. V. Kumar et al. Introduction to Parallel Computing. Benjamin/Cummings Publ., 1994.
13. J. Misra. Powerlist: a structure for parallel recursion. ACM TOPLAS, 16(6):1737-1767, 1994.
14. Z. G. Mou and P. Hudak. An algebraic model for divide-and-conquer algorithms and its parallelism. Journal of Supercomputing, 2(3):257-278, 1988.
15. D. Skillicorn. Foundations of Parallel Programming. Cambridge U. P., 1994.