<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">86284</controlfield>
        <controlfield tag="005">20200716101439.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1016/j.jpdc.2018.11.005</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">109699</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2019-109699</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">Díaz, J.</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">ReD: A reuse detector for content selection in exclusive shared last-level caches</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2019</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">The reference stream reaching a chip multiprocessor Shared Last-Level Cache (SLLC) shows poor temporal locality, making conventional cache management policies inefficient. Few proposals address this problem for exclusive caches. In this paper, we propose the Reuse Detector (ReD), a new content selection mechanism for exclusive hierarchies that leverages reuse locality at the SLLC, a property that states that blocks referenced more than once are more likely to be accessed in the near future. Being placed between each L2 private cache and the SLLC, ReD prevents the insertion of blocks without reuse into the SLLC. It is designed to overcome problems affecting similar recent mechanisms (low accuracy, reduced visibility window and detector thrashing). ReD improves performance over other state-of-the-art proposals (CHAR, Reuse Cache and EAF cache). Compared with the baseline system with no content selection, it reduces the SLLC miss rate (MPI) by 10.1% and increases harmonic IPC by 9.5%.</subfield>
        </datafield>
        <datafield tag="536" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/T58-17R</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO/TIN2014-52608-REDC</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO/TIN2015-65316-P</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO/TIN2016-76635-C2-1-R</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">All rights reserved</subfield>
            <subfield code="u">http://www.europeana.eu/rights/rr-f/</subfield>
        </datafield>
        <datafield tag="590" ind1=" " ind2=" ">
            <subfield code="a">2.296</subfield>
            <subfield code="b">2019</subfield>
        </datafield>
        <datafield tag="592" ind1=" " ind2=" ">
            <subfield code="a">0.525</subfield>
            <subfield code="b">2019</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">COMPUTER SCIENCE, THEORY &amp; METHODS</subfield>
            <subfield code="b">35 / 108 = 0.324</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q2</subfield>
            <subfield code="e">T1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Artificial Intelligence</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computer Networks and Communications</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Hardware and Architecture</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Software</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Theoretical Computer Science</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q3</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/acceptedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Monreal, T.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-5916-7898</subfield>
            <subfield code="a">Ibáñez, P.</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Llabería, J.M.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-5976-1352</subfield>
            <subfield code="a">Viñals, V.</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">5007</subfield>
            <subfield code="2">035</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Dpto. Informát.Ingenie.Sistms.</subfield>
            <subfield code="c">Área Arquit.Tecnología Comput.</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">125 (2019), 106-120</subfield>
            <subfield code="p">J. parallel distrib. comput.</subfield>
            <subfield code="t">JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING</subfield>
            <subfield code="x">0743-7315</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">310563</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/86284/files/texto_completo.pdf</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">25985</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/86284/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:86284</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2020-07-16-08:57:15</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>