Cost optimality and predictability of parallel programming with skeletons

Parallel Processing Letters

Volumn 13, Issue 4, 2003, Pages 575-587

  Bischof, Holger ^a   Gorlatch, Sergei ^a   Kitzelmann, Emanuel ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Cost optimality; Parallel programming; Skeletons; Tridiagonal system solver

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE REUSABILITY; COST EFFECTIVENESS; DATA STRUCTURES; PROGRAM PROCESSORS; SYSTEMS ANALYSIS;

COST-OPTIMALITY; PARALLEL PROGRAMMING; SKELETONS; TRIDIAGONAL-SYSTEM SOLVERS;

PARALLEL PROCESSING SYSTEMS;

EID: 1242352435     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626403001525     Document Type: Article

References (19)

1. Bischof, H., Gorlatch, S.: Double-scan: Introducing and implementing a new dataparallel skeleton. In Monien, B., Feldmann, R., eds.: Euro-Par 2002. Volume 2400 of LNCS., Springer (2002) 640-647
2. Bischof, H., Gorlatch, S., Kitzelmann, E.: The double-scan skeleton and its parallelization. Technical Report 2002/06, Technische Universität Berlin (2002)
3. Botorog, G., Kuchen, H.: Efficient parallel programming with algorithmic skeletons. In Bougé, L., et al., eds.: Euro-Par'96: Parallel Processing. Lecture Notes in Computer Science 1123. Springer-Verlag (1996) 718-731
4. Cole, M.I.: Algorithmic Skeletons: A Structured Approach to the Management of Parallel Computation. PhD thesis, University of Edinburgh (1988)
5. Cunha, J.C.: Future generations of problem solving environments. In: Proceedings of the IFIP WG 2.5 Conference on the Architecture of Scientific Software. (2000)
6. Danelutto, M., Pasqualetti, F., Pelagatti, S.: Skeletons for data parallelism in P3L. In Lengauer, C., Griebl, M., Gorlatch, S., eds.: Euro-Par'97. Volume 1300 of LNCS., Springer (1997) 619-628
7. Danelutto, M., Stigliani, M.: SKElib: parallel programming with skeletons in C. In Bode, A., Ludwig, T., Karl, W., Wismüller, R., eds.: EuroPar 2000. Volume 1900 of LNCS., Springer (2000) 1175-1184
8. A. Geser and S. Gorlatch. Parallelizing functional programs by generalization. J. Functional Programming, 9(6):649-673, 1999.
9. Gorlatch, S.: Systematic efficient parallelization of scan and other list homomorphisms. In Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y., eds.: Euro-Par'96: Parallel Processing, Vol. II. LNCS 1124. Springer-Verlag (1996) 401-408
10. Gorlatch, S., Lengauer, C.: Abstraction and performance in the design of parallel programs: overview of the SAT approach. Acta Informatica 36 (2000) 761-803
11. Herrmann, C. A.: The Skeleton-Based Parallelization of Divide-and-conquer Recursions. PhD thesis (2000) ISBN 3-89722-556-5.
12. Herrmann, C.A., Lengauer, C.: HDC: A higher-order language for divide-and-conquer. Parallel Processing Letters 10 (2000) 239-250
13. Kuchen, H.: A skeleton library. In Monien, B., Feldmann, R., eds.: Euro-Par 2002. Volume 2400 of LNCS., Springer (2002) 620-629
14. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publ. (1992)
15. López, J., Zapata, E.L.: Unified architecture for divide and conquer based tridiagonal system solvers. IEEE Transactions on Computers 43 (1994) 1413-1424
16. O'Donnell, J.: Bidirectional fold and scan. In: Functional Programming: Glasgow 1993. Workshops in Computing (1993) 193-200
17. Quinn, M.J.: Parallel Computing. McGraw-Hill, Inc. (1994)
18. Wang, H.H.: A parallel method for tridiagonal equations. ACM Transactions on Mathematical Software 7 (1982) 170-183
19. Wang, X., Mou, Z.: A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press (1991) 810-816