Abstract
The run-time overhead of detection and allocation of dynamic parallelism in a program can easily offset the performance gain. To improve the performance and reduce run-time overhead, it would be necessary to develop an allocation scheme that detects dynamic parallelism during compile-time. However, the difficult task of accurate estimation of the run-time parallelism is a stumbling block to this direction. As a compromise, we propose an allocation policy which: (i) detect dynamic parallelism for a selected group of program constructs during compile-time and, (ii) allocates them to the estimated hardware resources in a staggered fashion using a set of heuristic rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cytron, R., “DOACROSS: Beyond Vectorization for Multiprocessors,” Parallel Processing Conference, 1986, pp. 836–844.
Dunigan, T. H., “Performance of the Intel iPSC/860 and Ncube 6400 Hypercubes,” Parallel Computing, Vol. 17, 1991, pp. 1285–1302.
Feo, J. T., “An Analysis of the Computational and Parallel Complexity of the Livermore Loops,” Parallel Computing, Vol. 7, July 1988, pp. 163–185.
Hurson, A. R., Lim, J. T., Kavi, K., and Shirazi, B., “Loop Allocation Scheme for Multithreaded Dataflow Computers,” Parallel Processing Symposium, 1994.
Lee, B. and Hurson, A. R., “Issues in Dataflow Computing,” Advances in Computers, Vol. 37, 1993, pp. 285–333.
Lee, B., Hurson, A. R., and Feng, T. Y., “A Vertically Layered Allocation Scheme for Dataflow Systems,” Journal of Parallel and Distributed Computing, Vol. 11, 1991, pp. 175–187.
Lim, J. T., Hurson, A. R., Lee, B., and Shirazi, B., “Staggered Distribution: A Loop Allocation Scheme for Dataflow Multiprocessor Systems,” Frontiers of Massively Parallel Computation, 1992, pp. 310–317.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hurson, A.R., Lim, J.T., Shirazi, B., Kavi, K. (1994). Staggered scheme: A loop allocation policy. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_159
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_159
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive