Extracting and implementing list homomorphisms in parallel program development

Science of Computer Programming

Volumn 33, Issue 1, 1999, Pages 1-27

  Gorlatch, Sergei ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001957326     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(97)00014-2     Document Type: Article

References (31)

1. K. Achatz, W. Schulte, Architecture independent massive parallelization of divide-and-conquer algorithms, in: B. Moeller (Ed.), Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 947, Springer, Berlin, 1995, pp. 97-127.
2. J.W. Backus, Can programming be liberated from the von Neumann style? Commun. ACM 21 (1978) 613-641.
3. D. Barnard, J. Schmeiser, D. Skillicorn, Deriving associative operators for language recognition, Bull. EATCS 43 (1991) 131-139.
4. J. Bentley, Programming pearls, Commun. ACM 27 (1984) 865-871.
5. R.S. Bird, Lectures on constructive functional programming, in: M. Broy (Ed.), Constructive Methods in Computing Science, NATO ASO Series F: Computer and Systems Sciences, Vol. 55, Springer, Berlin, 1988, pp. 151-216.
6. G. Blelloch, Scans as primitive parallel operations, IEEE Trans. Comput. 38(11) (1989) 1526-1538.
7. B. Carpentieri, G. Mou, Compile-time transformations and optimizations of divide-and-conquer algorithms, ACM SIGPLAN Notices 20(10) (1991) 19-28.
8. M. Cole, Parallel programming with list homomorphisms, Parallel Processing Lett. 5(2) (1994) 191-204.
9. A. Gibbons, R. Ziani, The balanced binary tree technique on mesh-connected computers, Inform. Process. Lett. 37 (1991) 101-109.
10. J. Gibbons, Upwards and downwards accumulations on trees. in: R. Bird, C. Morgan, J. Woodcock (Eds.), Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 669, Springer, Berlin, 1992, pp. 122-138.
11. J. Gibbons, The third homomorphism theorem, Technical Report, U. Auckland, 1994.
12. J. Gibbons, The third homomorphism theorem, J. Fun. Programming 6(4) (1996) 657-665.
13. S. Gorlatch, Constructing list homomorphisms, Technical Report MIP-9512, Universität Passau, 1995.
14. S. Gorlatch, Stages and transformations in parallel programming, in: M. Kara et al. (Eds.), Abstract Machine Models for Parallel and Distributed Computing, IOS Press, 1996, pp. 147-162.
15. Z. Grant-Duff, P. Harrison, Parallelism via homomorphisms, Parallel Processing Lett. 6(2) (1996) 279-295.
16. B. Heinz, Lemma discovery by anti-unification of regular sorts, Technical Report 94-21, TU Berlin, May 1994.
17. A. Kaldewaij, Programming: The Derivation of Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1990.
18. J. Kornerup, Mapping a functional notation for parallel programs onto hypercubes, Inform. Processing Lett. 53 (1995) 153-158.
19. K. Kumar, D. Skillicorn, Data parallel geometric operations on lists, Parallel Comput. 21 (3) (1995) 447-459.
20. R. Ladner, M. Fischer, Parallel prefix computation, J. ACM 27 (1980) 831-838.
21. J. Misra, Powerlist: a structure for parallel recursion, ACM TOPLAS 16(6) (1994) 1737-1767.
22. Z.G. Mou, Divacon: A parallel language for scientific computing based on divide and conquer, in: Proc. 3rd Symp. on the Frontiers of Massively Parallel Computation, October 1990, pp. 451-461.
23. J. O'Donnell, A correctness proof of parallel scan, Parallel Processing Lett. 4(3) (1994) 329-338.
24. F. Preparata, J. Vuillemin, The cube-connected cycles: a versatile network for parallel computation, Comm. ACM 24(5) (1981) 300-309.
25. M.J. Quinn, Parallel Computing, McGraw-Hill, New York, 1994.
26. M. Reid-Miller, List ranking and list scan on the Cray C-90, in: Proc. SPAA'94, 1994, pp. 104-113.
27. D. Skillicorn, Foundations of Parallel Programming, Cambridge Univ. Press, Cambridge, 1994.
28. D. Skillicorn, W. Cai, A cost calculus for parallel functional programming, J. Parallel Distributed Comput. 28 (1995) 65-83.
29. D.R. Smith, Applications of a strategy for designing divide-and-conquer algorithms, Science of Computer Programming 8 (3) (1987) 213-229.
30. D. Walker, The design of a standard message passing interface for distributed memory concurrent computers, Parallel Comput. 20 (1994) 657-673.
31. A. Geser, S. Gorlatch, Parallelizing functional programs by generalization, in: Algebraic and Logic Programming, ALP'97, Lecture Notes in Computer Science, Springer, Berlin, to appear.