Abstract
This paper is devoted to the problem of estimating the achievable degree of parallelism for a parallel algorithm with respect to a bandwidth constraint. In a compiler chain for embedded parallel microprocessors such an estimation can be used to fix an appropriate target for parallelism reduction “tools”. Informally, our problem consists in task ordering and memory management for an algorithm, so as to minimize the number of memory accesses. After a brief survey of the literature, we prove the \(\mathcal{NP}\)-hardness of this problem and introduce a polynomial special case. We then present a branch and bound procedure for the general case along with computational results interpretation demonstrating its practical relevance.
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
Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3), 985–1032 (2008)
Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5(2), 78–101 (1966)
Carpov, S.: Optimisation du préfetch et du parallélisme pour plateforme MPSoC. Master’s thesis, Université de Technologie de Compiègne (2008)
Ding, C., Kennedy, K.: Improving cache performance in dynamic applications through data and computation reorganization at run time. SIGPLAN Not. 34(5), 229–241 (1999)
Ding, C., Kennedy, K.: Improving effective bandwidth through compiler enhancement of global cache reuse. J. Parallel Distrib. Comput. 64(1), 108–134 (2004)
Ding, C., Orlovich, M.: The potential of computation regrouping for improving locality. In: SC 2004: Proceedings of the 2004 ACM/IEEE Conference on Supercomputing, p. 13. IEEE Computer Society, Washington, DC (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Gonzalez, R., Woods, R.: Digital Image Processing. Addison-Wesley Longman Publishing Co., Inc., Boston (2001)
Gordon, M.I., Thies, W., Amarasinghe, S.: Exploiting coarse-grained task, data, and pipeline parallelism in stream programs. In: Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-XII, New York, NY, USA, pp. 151–162 (2006)
Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2002)
McKinley, K., Carr, S., Tseng, C.W.: Improving data locality with loop transformations. ACM Trans. Program. Lang. Syst. 18(4), 424–453 (1996)
Pingali, V., McKee, S., Hsieh, W.C., Carter, J.: Restructuring computations for temporal data cache locality. Int. J. Parallel Program. 31(4), 305–338 (2003)
Strout, M., Carter, L., Ferrante, J.: Compile-time composition of run-time data and iteration reorderings. In: PLDI 2003: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pp. 91–102. ACM, New York (2003)
Wolf, M., Lam, M.: A data locality optimizing algorithm. In: PLDI 1991: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carpov, S., Carlier, J., Nace, D., Sirdey, R. (2011). Task Ordering and Memory Management Problem for Degree of Parallelism Estimation. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)