<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic why bin-hopping algorithm could improve cache performance? in Intel® Moderncode for Parallel Architectures</title>
    <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/why-bin-hopping-algorithm-could-improve-cache-performance/m-p/829393#M1475</link>
    <description>The only reference I found regarding bin hopping is &lt;A href="http://d3s.mff.cuni.cz/publications/HockoKalibera-Submitted.pdf"&gt;http://d3s.mff.cuni.cz/publications/HockoKalibera-Submitted.pdf&lt;/A&gt;. If you've already read that, you may need to find a technical library to discover more.</description>
    <pubDate>Fri, 28 May 2010 01:04:09 GMT</pubDate>
    <dc:creator>robert-reed</dc:creator>
    <dc:date>2010-05-28T01:04:09Z</dc:date>
    <item>
      <title>why bin-hopping algorithm could improve cache performance?</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/why-bin-hopping-algorithm-could-improve-cache-performance/m-p/829392#M1474</link>
      <description>why bin-hopping could improve cache performance?&lt;BR /&gt;bin-hopping is one of page allocation algorithms.successive pages of processor are placed to successive bins,it is possible to hop some bins.&lt;BR /&gt;i am confused about the principle of bin hopping.&lt;BR /&gt;&lt;P&gt;i should make full use of locality and temporal of processor,but bin-hopping algorithm place pages to successive bins.the placed pages will be still suitable for locality principle ? as we know,each bin contains some sets,each set contain cache line.each cache line contain some pages.&lt;/P&gt;&lt;P&gt;if the pages of process are placed to different bins ,the locality of process is still good ?&lt;/P&gt;&lt;P&gt;i don't know how to understand "bin-hopping could improve performance "?&lt;/P&gt;&lt;P&gt;thank you for reading and your explanation.&lt;/P&gt;</description>
      <pubDate>Fri, 30 Apr 2010 02:12:20 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/why-bin-hopping-algorithm-could-improve-cache-performance/m-p/829392#M1474</guid>
      <dc:creator>kewenpan</dc:creator>
      <dc:date>2010-04-30T02:12:20Z</dc:date>
    </item>
    <item>
      <title>why bin-hopping algorithm could improve cache performance?</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/why-bin-hopping-algorithm-could-improve-cache-performance/m-p/829393#M1475</link>
      <description>The only reference I found regarding bin hopping is &lt;A href="http://d3s.mff.cuni.cz/publications/HockoKalibera-Submitted.pdf"&gt;http://d3s.mff.cuni.cz/publications/HockoKalibera-Submitted.pdf&lt;/A&gt;. If you've already read that, you may need to find a technical library to discover more.</description>
      <pubDate>Fri, 28 May 2010 01:04:09 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/why-bin-hopping-algorithm-could-improve-cache-performance/m-p/829393#M1475</guid>
      <dc:creator>robert-reed</dc:creator>
      <dc:date>2010-05-28T01:04:09Z</dc:date>
    </item>
  </channel>
</rss>

