Abstract
We present scheduling techniques considering the source code as well as the task graph of a parallel program. This approach allows to chose the proper scheduling algorithm and to estimate the execution time of the target program. We demonstrate this on stencil computations and their optimizations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Andonov, S. Rajopadhye, and N. Yanev. Optimal orthogonal tiling. Lecture Notes in Computer Science, 1470, 1998.
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pp 1–12, 1993. SIGPLAN Notices (28) 7.
B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pp 253–264. Springer, 1994.
P. Feautrier. Some efficient solutions to the affine scheduling problem. I. one dimensional time. International Journal of Parallel Programming, 21(5):313–347, October 1992.
A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4:686–701, June 1993.
J.A. Hoogreven, J.K. Lenstra, and B. Veltmann. Three, four, five, six or the complexity of scheduling with communication delays. Operations Research Letters, 16:129–137, 1994.
H. Jung, L.M. Kirousis, and P. Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Information and Computation, 105:94–104, 1993.
I. Kort and D. Trystram. Scheduling fork graphs under logp with an unbounded number of processors. In Europar’ 98, pp 940–943, 1998.
W. Löwe and W. Zimmermann. Scheduling balanced task-graphs to logp-machines. Parallel Computing, 26(9):1083–1108, 2000.
C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.
J. Siddhiwala and L.-F. Cha. Path-based task replication for scheduling with communication cost. In Proceedings of the International Conference on Parallel Processing, volume II, pp 186–190, 1995.
J. Verriet. Scheduling out-trees of height 1 in the LogP-Model Parallel Computing, 26(9):1065–1082, 2000.
M. Wolfe. More iteration space tiling. In ACM, editor, Proceedings, Supercomputing’ 89: November 13–17, 1989, Reno, Nevada, pp 655–664, New York, NY 10036, USA, 1989. ACM Press.
Michael Wolfe. Iteration space tiling for memory hierarchies. In Gary Rodrigue, editor, Proceedings of the 3rd Conference on Parallel Processing for Scientific Computing, pp 357–361, Philadelphia, PA, USA, December 1989. SIAM Publishers.
W. Zimmermann and W. Löwe. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277–288. Springer, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löwe, W., Zimmermann, W., Dickert, S., Eisenbiegler, J. (2001). Source Code and Task Graphs in Program Optimization. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive