Compositional Memory Systems for Multimedia Communicating Tasks

Computer Science – Hardware Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted on behalf of EDAA (http://www.edaa.com/)

Scientific paper

Conventional cache models are not suited for real-time parallel processing because tasks may flush each other's data out of the cache in an unpredictable manner. In this way the system is not compositional so the overall performance is difficult to predict and the integration of new tasks expensive. This paper proposes a new method that imposes compositionality to the system?s performance and makes different memory hierarchy optimizations possible for multimedia communicating tasks when running on embedded multiprocessor architectures. The method is based on a cache allocation strategy that assigns sets of the unified cache exclusively to tasks and to the communication buffers. We also analytically formulate the problem and describe a method to compute the cache partitioning ratio for optimizing the throughput and the consumed power. When applied to a multiprocessor with memory hierarchy our technique delivers also performance gain. Compared to the shared cache case, for an application consisting of two jpeg decoders and one edge detection algorithm 5 times less misses are experienced and for an mpeg2 decoder 6.5 times less misses are experienced.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Compositional Memory Systems for Multimedia Communicating Tasks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compositional Memory Systems for Multimedia Communicating Tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compositional Memory Systems for Multimedia Communicating Tasks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-431667

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.