Foundations for the integration of scheduling techniques into compilers for parallel languages

International Journal of Computational Science and Engineering

Volumn 1, Issue 2-4, 2005, Pages 99-109

  Zimmermann, Wolf ^a   Löwe, Welf ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b LINNAEUS UNIVERSITY   (Sweden)

Author keywords

compilers for parallel languages; malleable tasks; task scheduling

Indexed keywords

EID: 47349097156     PISSN: 17427185     EISSN: 17427193     Source Type: Journal    
DOI: 10.1504/ijcse.2005.009695     Document Type: Article

References (29)

1. Barak, A. and Láaden, O. (1998) ‘The mosix multicomputer operating system for high performance cluster computing’, Journal of Future Generation Computer Systems, Vol. 13, Nos. 4–5, pp.361–372.
2. Blelloch, G. (1995) Nesl: A Nested Data-parallel Language (3.1), Carnegie Mellon University, Tech. Rep., CMU-CS-95-170.
3. Blelloch, G.E., Sipelstein, J., Hardwick, J. and Zagha, M. (1995) Nesl User’s Manual (Version 3.1), Carnegie Mellon University, Tech. Rep., CMU-CS-95-169.
4. Cavalheiro, G.G.H., Galilée, F. and Roch, J-L. (1998) ‘Athapascan-1: parallel programming with asynchronous tasks’, Proceedings of the Yale Multithreaded Programming Workshop, New Haven, Connecticut.
5. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R. and von Eicken, T. (1993) ‘LogP: towards a realistic model of parallel computation’, 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pp.1–12, published in: SIGPLAN Notices (28) 7.
6. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R. and von Eicken, T. (1996) ‘LogP: a practical model of parallel computation’, Communications of the ACM, Vol. 39, No. 11, pp.78–85
7. Di Martino, B. and Ianello, G. (1994) ‘Parallelization of non-simultaneous iterative methods for systems of linear equations’, Parallel Processing: CONPAR 94 – VAPP VI, ser. Lecture Notes in Computer Science, Vol. 854, Springer, pp.253–264.
8. Eisenbiegler, J., Löwe, W. and Wehrenpfennig, A. (1997) ‘On the optimization by redundancy using an extended LogP model’, International Conference on Advances in Parallel and Distributed Computing (APDC’97), IEEE Computer Society Press, Shanghai, China, pp.149–155.
9. Fortune, S. and Wyllie, J. (1978) ‘Parallelism in random access machines’, Proceedings of the 10th Annual Symposium on Theory of Computing, pp.114–118.
10. Foster, I. (1995) Designing and Building Parallel Programs, Addison-Wesley, available on Internet under URL, http://www.mcs.anl.gov/dbpp/.
11. Griebl, M. and Lengauer, C. (1997) ‘The loop parallelizer LooPo – announcement’, in Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A. and Padua, D. (Eds.): Languages and Compilers for Parallel Computing (LCPC’96), ser. LNCS 1239, pp.603, 604, more details at http://www.infosun.fmi.uni-passau.de/cl/loopo.
12. Karp, R.M. and Ramachandran, V. (1990) ‘Parallel algorithms for shared memory machines’, in van Leeuwen, J. (Ed.): Handbook of Theoretical Computer Science Vol. A, MIT-Press, Cambridge, Massachusets, pp.871–941.
13. Lepère, R., Trystram, D. and Woeginger, G.J. (2002) ‘Approximation algorithms for scheduling malleable tasks under precedence constraints’, International Journal of Foundations of Computer Science, Vol. 13, No. 4, pp.613–627.
14. Löwe, W. and Zimmermann, W. (1999) ‘Scheduling iterative programs onto LogP-machine’, Europar ‘99, ser. Lecture Notes in Computer Science, No. 1685, Springer, pp.332–339.
15. Löwe, W. and Zimmermann, W. (2000) ‘Scheduling balanced task-graphs to LogP-machines’, Parallel Computing, Vol. 26, No. 9, pp.1083–1108.
16. Löwe, W., Eisenbiegler, J. and Zimmermann, W. (1996) ‘Optimizing parallel programs on machines with fast communication’, 9th International Conference on Parallel and Distributed Computing Systems, pp.100–103.
17. Mounie, G., Rapine, C. and Trystram, D. (1999) ‘Efficient approximation algorithms for scheduling malleable tasks’, 11th ACM Symposium on Parallel Algorithms and Architectures SPAA ’99, ACM Press, Saint-Malo, France, pp.23–32.
18. Nakano, H., Ishizaka, K., Obata, M., Kimura, K. and Kasahara, H. (2003) ‘Static coarse grain scheduling with cache optimization using openmp’, International Journal of Parallel Programming, Vol. 31, No. 3, pp.211–223.
19. Philippsen, M. (1994) Optimierungstechniken Zur Ubersetzung Paralleler Pro-grammiersprachen, PhD Dissertation, Universitat Karlsruhe, VDI-Verlag GmbH, Düsseldorf, VDI Fortschritt-Berichte 292, Reihe 10, Informatik.
20. Polychronopoulos, C.D. (1991) ‘The hierarchical task graph and its use in auto-scheduling’, Proceedings of the 5th International Conference on Supercomputing, ACM Press, Albuquerque, New Mexico, pp.252–263.
21. Rauber, T. and Rünger, G. (1998) ‘Compiler support for task scheduling in hierarchical execution models’, Journal of Systems Architecture, Vol. 45, pp.483–503.
22. Rauber, T. and Rünger, G. (1999) ‘Scheduling of data parallel modules for scientific computing’, Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, Texas.
23. Supercomputing Technologies Group (2001) CILK 5.3.2 Reference Manual, MIT Laboratory for Computer Science, http://supertech.lcs.mit.edu/cilk/.
24. Tannenbaum, T., Wright, D., Miller, K. and Livny, M. (2001) ‘Condor – a distributed job scheduler’, in Sterling, T. (Ed.): Beowulf Cluster Computing with Linux, MIT Press, Cambridge. Massachusets, October.
25. Wolfe, M. (1995) High Performance Compilers for Parallel Computing, Addison-Wesley, Redwood City, California.
26. Yang, T. and Gerasoulis, A. (1994) ‘Dsc: scheduling parallel tasks on an unbounded number of processors’, IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 9, pp.951–967.
27. Zima, H. and Chapman, B. (1991) Supercompilers for Parallel and Vector Computers, ser. Frontier Series, ACM Press, New York.
28. Zimmermann, W. and Löwe, W. (1994) ‘An approach to machine-independent parallel programming’, Parallel Processing: CONPAR 94 – VAPP VI, ser. Lecture Notes in Computer Science, Vol. 854, Springer, pp.277–288.
29. Equivalent to the PRAM-machine model, see Fortune and Wyllie (1978) and Karp and Ramachandran (1990).