Irregularity handling via structured parallel programming

International Journal of Computational Science and Engineering

Volumn 1, Issue 2-4, 2005, Pages 73-85

  Danelutto, M ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

auto scheduling; irregularity; layered run time support implementation; skeletons; structured parallel programming

Indexed keywords

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

References (41)

1. Aldinucci, M. and Danelutto, M. (1999) ‘Stream Parallel Skeleton Optimisations’, Proc. LASTED International Conference Parallel and Distributed Computing and Systems, IASTED/ACTA Press, November, pp.955–962. Boston, USA.
2. Aldinucci, M., Campa, S., Ciullo, P., Coppola, M., Magini, S., Pesciullesi, P., Potiti, L., Ravazzolo, R., Torquati, M., Vanneschi, M. and Zoccolo, C. (2003b) ‘The implementation of ASSIST, an environment for parallel and distributed programming’, in Kosch, H., Boszormenyi, L. and Hellwagner, H. (Eds.): Euro-Par Parallel Processing, No. 2790 in LNCS, Springer Verlag, Kalgenfurt, Austria, August, pp.712–721.
3. Aldinucci, M., Coppola, M., Danelutto, M. and Zoccolo, C. (2004a) ‘ASSIST as a research framework for highperformance grid programming environments’, in Cunha, J.C. and Rana, O.F. (Eds.): (Chapter in) Grid Computing: Software Environments and Tools, Draft version available as Technical Report TR-04–09, February, Dept. of Computer Science, University of Pisa, Italy, Springer Verlag.
4. Aldinucci, M., Danelutto, M. and Teti, P. (2003c) ‘An advanced environment supporting structured parallel programming in Java’, Future Generation Computer Systems, Vol. 19, pp.611–626.
5. Aldinucci, M., Danelutto, M., Duennweber, J. and Gor-Latch, S. (2004b) Optmization Techniques for Implementing Parallel Skeletons in Grid Environments, to appear on Parallel Processing Letters.
6. Allan, B.A., Armstrong, R.C., Wolfe, A.P., Ray, J., Bernholdt, D.E. and Kohl, J.A. (2002) ‘The CCA core specification in a distributed memory SPMD framework’, Concurrency Computat., Vol. 14, pp.1–23.
7. Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M. and Werthimer, D. (2002) ‘SETI@home: an experiment in public-resource computing’, Communications of ACM, Vol. 45, pp.56–61.
8. 3L: a structured high level programming language and its structured support’, Concurrency Practice and Experience, Vol. 7, pp.225–255.
9. Blount, B., Chatterjee, S. and Philippsen, M. (1999) ‘Irregular parallel algorithms in Java’, Proceedings of the Second Merged Symposium IPPS/SPDP, 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, San Juan, Portorico.
10. Buyya, R. (1999) High Performance Cluster Computing, Prentice-Hall PTR, NJ USA, ISBN 0–13-013784–7.
11. Cole, M. (1989) Algorithmic Skeletons: Structured Management of Parallel Computations, Research Monographs in Parallel and Distributed Computing, Pitman.
12. Cole, M. (2002) eSkel: The Edinburgh SKEleton Library, Tutorial Introduction, http://homepages.inf.ed.ac.uk/mic/eSkel.
13. Cole, M. (2004) ‘Bringing skeletons out of the closet’, Parallel Computing, Vol. 30, No. 3, pp.389–406.
14. Danelutto, M. (1999) ‘Dynamic run time support for skeletons’, in D'Hollander, E.H. Joubert, G.R. Peters, F.J. and Sips, H.J. (Eds.): Proceedings of the International Conference ParCo99, Parallel Computing Fundamentals and Applications, Imperial College Press, pp.460–467.
15. Danelutto, M. (2000) Task Farm Computations in Java, in Buback, Afsarmanesh, Williams, and Hertzberger (Eds.): High Performance Computing and Networking, LNCS, No. 1823, Springer Verlag, May, pp.385–394.
16. Danelutto, M. (2001) Efficient Support for Skeletons on Workstation Clusters, Parallel Processing Letters, Vol. 11, pp.41–56.
17. Danelutto, M. (2004) ‘Adaptive task farm implementation strategies’, Proceedings of the Euromicro Conference on Parallel, Distributed and Network-based Processing, IEEE, February, pp.416–423.
18. Danelutto, M. and Teti, P. (2002) ‘Lithium: a structured parallel programming environment in Java’, Proceedings of Computational Science – ICCS ’2002, Springer Verlag, LNCS No. 2330, pp.844–853.
19. Danelutto, M., Meglio, R.D., Orlando, S., Pelagatti, S. and Vanneschi, M. (1992) A Methodology for the Development and Support of Massively Parallel Programs, Future Generation Computer Systems, Vol. 8, pp.205–220.
20. de Doncker, E., Zanny, R., Kaugars, K. and Cu, L. (2001) ‘CUCOS, performance and irregular behavior of adaptive task partitioning’, Proceedings of ICCS 2001, Springer Verlag, LNCS No. 2074, pp.118–127.
21. Foster, I. and Kesselman, C. (Eds.) (2003) The Grid 2 Blueprint for a New Computing Infrastructure, Morgan Kaufmann, December.
22. Gamma, E., Helm, R., Johnson, R. and Vissides, J. (1994) Design Patterns: Elements of Reusable Object-Oriented Software, Addison Wesley, Boston, MA.
23. Grosso, W. (2001) RMI, O’Reilly, October.
24. Guo, M., Cao, J., Chang, W., Li, L. and Liu, C. (2004) ‘Effective OpenMP Extensions for irregular applications on clusters environments’, Proceedings of GCC 2003, Springer Verlag, LNCS No. 3033, pp.97–1004.
25. Hlppold, J. and Runger, G. (2002) Task Pool teams for Implementing Irregular Algorithms on Cluster of SMPs, Tech. Report SBF393/02–18, Technische Universitat Chemnitz.
26. Hu, Z., Iwasaki, H. and Takeichi, M. (2002) ‘An accumulative parallel skeleton for all’, Proceedings of ESOP 2002, Springer Verlag, LNCS. No. 2305, pp.83–97
27. Kuchen, H. (2002) A Skeleton Library, in Euro-Par 2002, Parallel Processing, No. 2400 in LNCS, Springer Verlag, August, pp.620–629.
28. Llabarta, J., Ayguade, E., Oliver, J. and Henty, D. (2000) New OpenMP directives for irregular data access loops, Proceedings of EWOMP’2000.
29. McDonald, S., Szafron, D., Schaeffer, J. and Bromling, S. (2000) ‘Generating parallel program frameworks from parallel design patterns’, in Bode, A., Ludwing, T., Karl, W. and Wismiiller, R. (Eds.): Euro-Par 2000 Parallel Processing, LNCS, No. 1900, Springer Verlag, August/September, pp.95–105.
30. Meyer, J. and Downing, T. (1997) Java Virtual Machine, O’Reilly.
31. Moulitsas, I. and Moulitsas, G. (2001) ‘Multilevel algorithms for generating coarse grids for multigrid methods’, Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, ACM Press, pp.45–54.
32. Nlkolopoulos, D.S., Polychronopoulos, C.D. and Ayguade, E. (2001) ‘Scaling irregular parallel codes with minimal programming effort’, Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, ISBN: 1–58113-293-X.
33. Polychronopoulos, C.D. (1991) ‘The hierarchical task graph and its use in auto-scheduling’, International Conference on Supercomputing Archive, Proceedings of the 5th International Conference on Supercomputing, pp.252–263.
34. Slu, S., de Slmone, M., Goswami, D. and Singh, A. (1996) ‘Design patterns for parallel programming’, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA’96, CSREA, August, pp.230–240.
35. Subramaniam, S. and Eager, D. (1994) Affinity Scheduling of Unbalanced Workloads, in Supercomputing '94, IEEE Computer Society.
36. Tuminaro, R.S. (2000) ‘Parallel smoothed aggregation multigrid: aggregation strategies on massively parallel machines’, Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, ACM Press, New York, USA.
37. Vanneschi, M. (2002) ‘The programming model of ASSIST, an environment for parallel and distributed portable applications’, Parallel Computing, Vol. 28, pp.1709–1732.
38. Yang, T. and Fu, C. (1998) Space/Time-Efficient Scheduling and Execution of Parallel Irregular Computations, ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 20, No. 6, pp.1195–1222.
39. Which is built on top of plain sockets, actually.
40. This is not current Lithium syntax actually.
41. i.e., when the thread controlling a remote processing element gets a RemoteException.