Abstract
This paper addresses the dag scheduling problem, proposing the bulk synchronous parallel (BSP) model as a framework for the derivation of general purpose parallel computer schedules of uniform dags, i.e., of dags that stand for tightly-nested loops with computable distance vectors. A general technique for the BSP scheduling of normalised uniform dags is introduced and analysed in terms of the BSP cost model, and methods for the normalisation of generic uniform dags are briefly overviewed in the paper.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D.F. Bacon et al., Compiler transformations for high-performance computing. In: ACM Comp. Surv. 26(4), Dec. 1994, 346–420.
U. Banerjee, Dependence Analysis for Supercomputing. Kluwer Acad. Publ., 1988.
P. Boulet et al., (Pen)-ultimate tiling?. In: Integration, the VLSI Journal 17(1), Aug. 1994, 33–51.
A. Gerasoulis and T. Yang, A comparison of clustering heuristics for scheduling DAGs on multiprocessors. In: J. Par. Distr. Comp. 14(4), Dec. 1992, 276–291.
F. Irigoin and F. Triolet, Supernode partitioning. In: Conf. Rec. 15th ACM Symp. Princ. Progr. Lang., ACM Press, 1988, 319–329.
L. Lamport, The parallel execution of DO loops. In: Comm. ACM 17(2), Febr. 1974, 83–93.
B.A. Malloy et al., Scheduling DAG's for asynchronous multiprocessor execution. In: IEEE Trans. Par. Distr. Syst. 5(5), May 1994, 498–508.
W.F. McColl, General purpose parallel computing. In: A.M. Gibbons, P. Spirakis (eds.), Lectures on Parallel Computation, Cambridge Univ. Press, 1993, 337–391.
J. Ramanujam and P. Sadayappan, Tiling multidimensional iteration spaces for multiComputers. In: J. Par. Distr. Comp. 16(2), Oct. 1992, 108–120.
R. Schreiber, J.J. Dongarra, Automatic blocking of nested loops. Technical Report 90-38, Univ. of Tennessee at Knoxville, May 1990.
L.G. Valiant, A bridging model for parallel computation. In: Comm. ACM 33(8), Aug. 1990, 103–111.
M.E. Wolf and M.S. Lam, A loop transformation theory and an algorithm to maximize parallelism. In: IEEE Trans. Par. Distr. Syst. 2(4), Oct. 1991, 452–470.
M.J. Wolfe, Optimizing Supercompilers for Supercomputers. Research Monographs in Parallel and Distributed Computing, MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calinescu, R. (1996). Bulk synchronous parallel scheduling of uniform dags. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024748
Download citation
DOI: https://doi.org/10.1007/BFb0024748
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive