Compositional Memory Systems for Multimedia Communicating Tasks

Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005) 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 t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Molnos, A. M, Heijligers, M. J. M, Cotofana, S. D, Van Eijndhoven, J. T. J
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Molnos, A. M
Heijligers, M. J. M
Cotofana, S. D
Van Eijndhoven, J. T. J
description Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005) 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.
doi_str_mv 10.48550/arxiv.0710.4658
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0710_4658</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0710_4658</sourcerecordid><originalsourceid>FETCH-LOGICAL-a658-6a0639e7720e3a166b88963798ea69cf84c6e621a6d0d6769a2217cae3b8fa013</originalsourceid><addsrcrecordid>eNotj7FOwzAURb0woNKdCfkH0tpx82xPVRVRQGrFQPboNXlBVuO4slNE_p4GmK50dXWuDmOPUqw2pijEGuO3-1oJPRdQmHu2LYO_hORGFwbs-ZF8iBP_mNJIPvEuRH689qPz1Drkt62_Dq7B0Q2fvMJ0Tg_srsM-0fI_F6zaP1fla3Z4f3krd4cMbzcZoABlSetckEIJcDLGgtLWEIJtOrNpgCCXCK1oQYPFPJe6QVIn06GQasGe_rC_AvUlOo9xqmeRehZRP5FbQyE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Compositional Memory Systems for Multimedia Communicating Tasks</title><source>arXiv.org</source><creator>Molnos, A. M ; Heijligers, M. J. M ; Cotofana, S. D ; Van Eijndhoven, J. T. J</creator><creatorcontrib>Molnos, A. M ; Heijligers, M. J. M ; Cotofana, S. D ; Van Eijndhoven, J. T. J</creatorcontrib><description>Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005) 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.</description><identifier>DOI: 10.48550/arxiv.0710.4658</identifier><language>eng</language><subject>Computer Science - Hardware Architecture ; Computer Science - Multimedia</subject><creationdate>2007-10</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0710.4658$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0710.4658$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Molnos, A. M</creatorcontrib><creatorcontrib>Heijligers, M. J. M</creatorcontrib><creatorcontrib>Cotofana, S. D</creatorcontrib><creatorcontrib>Van Eijndhoven, J. T. J</creatorcontrib><title>Compositional Memory Systems for Multimedia Communicating Tasks</title><description>Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005) 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.</description><subject>Computer Science - Hardware Architecture</subject><subject>Computer Science - Multimedia</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7FOwzAURb0woNKdCfkH0tpx82xPVRVRQGrFQPboNXlBVuO4slNE_p4GmK50dXWuDmOPUqw2pijEGuO3-1oJPRdQmHu2LYO_hORGFwbs-ZF8iBP_mNJIPvEuRH689qPz1Drkt62_Dq7B0Q2fvMJ0Tg_srsM-0fI_F6zaP1fla3Z4f3krd4cMbzcZoABlSetckEIJcDLGgtLWEIJtOrNpgCCXCK1oQYPFPJe6QVIn06GQasGe_rC_AvUlOo9xqmeRehZRP5FbQyE</recordid><startdate>20071025</startdate><enddate>20071025</enddate><creator>Molnos, A. M</creator><creator>Heijligers, M. J. M</creator><creator>Cotofana, S. D</creator><creator>Van Eijndhoven, J. T. J</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20071025</creationdate><title>Compositional Memory Systems for Multimedia Communicating Tasks</title><author>Molnos, A. M ; Heijligers, M. J. M ; Cotofana, S. D ; Van Eijndhoven, J. T. J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a658-6a0639e7720e3a166b88963798ea69cf84c6e621a6d0d6769a2217cae3b8fa013</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Computer Science - Hardware Architecture</topic><topic>Computer Science - Multimedia</topic><toplevel>online_resources</toplevel><creatorcontrib>Molnos, A. M</creatorcontrib><creatorcontrib>Heijligers, M. J. M</creatorcontrib><creatorcontrib>Cotofana, S. D</creatorcontrib><creatorcontrib>Van Eijndhoven, J. T. J</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Molnos, A. M</au><au>Heijligers, M. J. M</au><au>Cotofana, S. D</au><au>Van Eijndhoven, J. T. J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Compositional Memory Systems for Multimedia Communicating Tasks</atitle><date>2007-10-25</date><risdate>2007</risdate><abstract>Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005) 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.</abstract><doi>10.48550/arxiv.0710.4658</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.0710.4658
ispartof
issn
language eng
recordid cdi_arxiv_primary_0710_4658
source arXiv.org
subjects Computer Science - Hardware Architecture
Computer Science - Multimedia
title Compositional Memory Systems for Multimedia Communicating Tasks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T03%3A51%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Compositional%20Memory%20Systems%20for%20Multimedia%20Communicating%20Tasks&rft.au=Molnos,%20A.%20M&rft.date=2007-10-25&rft_id=info:doi/10.48550/arxiv.0710.4658&rft_dat=%3Carxiv_GOX%3E0710_4658%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true