By Topic

An analysis of cache performance of multimedia applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xu, Z. ; Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA ; Sohoni, S. ; Rui Min ; Hu, Y.

Multimedia applications are fast becoming one of the dominating workloads for modern computer systems. Since these applications normally have large data sets and seem to have little data-reuse, a commonly held belief is that they have poor memory behavior compared to traditional programs and that current cache architectures cannot handle them well. It is therefore important to quantitatively characterize the memory behavior of these applications in order to provide insights for future design and research of memory systems. However, very few results on this topic have been published. We analyze the cache behavior of a group of representative multimedia applications. These programs include a subset of the popular MediaBench suite and several large multimedia programs running on the Linux, Windows 98, and TruUnix operating systems. We performed extensive measurement and trace-driven simulation experiments. We then compared the memory utilization of these programs to that of the SPEC2000 applications. We found that multimedia applications actually have better cache behavior than SPEC2000 programs. The following three factors contribute to the high cache hit rates of multimedia applications: First, most multimedia applications apply block-partitioning algorithms to the input data and work on small blocks of data that easily fit in the cache. Second, within these blocks, there is significant data reuse as well as spatial locality. Third, a large number of references generated by multimedia applications are to their internal data structures, which are relatively small and can easily fit in reasonably sized caches.

Published in:

Computers, IEEE Transactions on  (Volume:53 ,  Issue: 1 )