Abstract
Increasing disparity between processor and memory speeds has been a motivation for designing systems with deep memory hierarchies. Most data-dominated multimedia applications do not use their cache efficiently and spend much of their time waiting for memory accesses [1]. This also implies a significant additional cost in increased memory bandwidth, in the system bus load and the associated power consumption apart from increasing the average memory access time.
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
P. Baglietto, M. Maresca and M. Migliardi, “Image processing on high-performance RISC systems”, Proc. of the IEEE, vol. 84, no. 7, pp.917–929, July 1996.
D.C. Burger, J.R. Goodman and A. Kagi, “The declining effectiveness of dynamic caching for general purpose multiprocessor”, Technical Report, University of Wisconsin, Madison, no. 1261, 1995.
E. De Greef, “Storage size reduction for multimedia applications”, Doctoral Dissertation, Dept. of EE, K.U.Leuven, January 1998.
F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, A. Vandecappelle, “Custom Memory Management Methodology — Exploration of Memory Organization for Embedded Multimedia System Design”, ISBN 0-7923-8288-9, Kluwer Acad. Publ., Boston, 1998.
S. Gupta, M. Miranda, F. Catthoor, R. Gupta, “Analysis of high-level address code transformations”, In proc. of design automation and test in europe (DATE) conference, Paris, March 2000.
M. Kandemir, J. Ramanujam, A. Choudhary, “Improving cache locality by a combination of loop and data transformations”, IEEE trans. on computers, vol. 48, no. 2, pp. 159–167, 1999.
C. Kulkarni, F. Catthoor, H. De Man, “Code transformations for low power caching in embedded multimedia processors,”, Intnl. Parallel Proc. Symp.(IPPS/SPDP), Orlando FL, pp. 292–297, April 1998.
D. Kulkarni and M. Stumm, “Linear loop transformations in optimizing compilers for parallel machines”, The Australian computer journal, pp. 41–50, may 1995.
M. Lam, E. Rothberg and M. Wolf, “The cache performance and optimizations of blocked algorithms”, In Proc. 6th Intnl. Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IV), pp.63–74, Santa Clara, Ca., 1991.
C.L. Lawson and R.J. Hanson, “Solving least squares problems”, Classics in applied mathematics, SIAM, Philadelphia, 1995.
N. Manjikian and T. Abdelrahman, “Array data layout for reduction of cache con flicts”, Intl. Conference on Parallel and Distributed Computing Systems, 1995.
K.S. McKinley and O. Temam, “A quantitative analysis of loop nest locality”, Proc. of 8th Intnl. Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), Boston, MA, October 1996.
G.L. Nemhauser, L.A. Wolsey, “Integer and Combinatorial Optimization”, J. Wiley&Sons, New York, N.Y., 1988.
P.R. Panda, N.D. Dutt and A. Nicolau, “Memory data organization for improved cache performance in embedded processor applications”, In Proc. ISSS-96, pp.90–95, La Jolla, Ca., Nov 1996.
P.R. Panda, H. Nakamura, N.D. Dutt and A. Nicolau, “Augmented loop tiling with data alignment for improved cache performance”, IEEE trans. on computers, vol. 48, no. 2, pp. 142–149, 1999.
D.A. Patterson and J.L. Hennessy, “Computer architecture A quantitative approach”, Morgan Kaufmann Publishers Inc., San Francisco, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kulkarni, C., Catthoor, F., De Man, H. (2000). Advanced Data Layout Optimization for Multimedia Applications. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_25
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive