<?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 bin hopping algorithm in Intel® Moderncode for Parallel Architectures</title>
    <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820541#M1252</link>
    <description>You found the same online paper that I did. It doesn't have an algorithm, as you've found.&lt;BR /&gt;&lt;BR /&gt;Have you tried the reference [12] cited in the paper?&lt;BR /&gt;&lt;BR /&gt;Kessler, R.E., Hill, M.D.: Page placement algorithms for large real-indexed caches. &lt;EM&gt;ACM Trans. Comput. Syst.&lt;/EM&gt; 10 (1992) 338359.&lt;BR /&gt;&lt;BR /&gt;From "An Empirical Study of the Effects of Careful Page Placement in Linux" by Bahadur, et al (&lt;A href="http://portal.acm.org/ft_gateway.cfm?id=275365&amp;amp;type=pdf"&gt;http://portal.acm.org/ft_gateway.cfm?id=275365&amp;amp;type=pdf&lt;/A&gt;), I found this:&lt;BR /&gt;&lt;BR /&gt;&lt;BLOCKQUOTE&gt;&lt;P&gt;In &lt;EM&gt;dynamic coloring&lt;/EM&gt;, bin selection is based upon some dynamic estimate of each bins activity level. Without special hardware such as that proposed in [J. Baker. The Effects of Virtual Page Placement on Cache Miss Ratios. M.S. Thesis, Department of Computer Science, Clemson University, Clemson SC, 1992], accurate estimates may be impossible to obtain. The principle of temporal locality indicates that a bin that has been recently assigned a new page is likely to experience relatively high activity. This observation motivates the round robin assignment of bins which is commonly known as &lt;EM&gt;bin hopping&lt;/EM&gt;. Two variations of bin hopping have been studied and reported upon: global bin hopping in which the page fault manager simply maintains a single next-bin identifier and local bin hopping in which a next-bin identifier is maintained for each process.&lt;/P&gt;&lt;/BLOCKQUOTE&gt;&lt;BR /&gt;I would also suggest trying texts on virtural memory systems.&lt;BR /&gt;&lt;BR /&gt;--clay</description>
    <pubDate>Wed, 02 Jun 2010 22:56:25 GMT</pubDate>
    <dc:creator>ClayB</dc:creator>
    <dc:date>2010-06-02T22:56:25Z</dc:date>
    <item>
      <title>bin hopping algorithm</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820539#M1250</link>
      <description>where i can get the entire algorithm for bin hopping?</description>
      <pubDate>Thu, 13 May 2010 04:15:27 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820539#M1250</guid>
      <dc:creator>Biswabandan_Panda</dc:creator>
      <dc:date>2010-05-13T04:15:27Z</dc:date>
    </item>
    <item>
      <title>bin hopping algorithm</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820540#M1251</link>
      <description>i did not get u,but as i know&lt;BR /&gt; Bin hopping optimizes the virtual-to-physical map-ping for accesses that target repeated sequences of vir- tual memory locations. In practice, consecutively al- located physical pages that support consecutively allo- cated virtual pages are selected not to collide in the. Bin hopping therefore exploits temporal locality of applications.&lt;BR /&gt;&lt;BR /&gt;</description>
      <pubDate>Sat, 15 May 2010 09:59:15 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820540#M1251</guid>
      <dc:creator>Biswabandan_Panda</dc:creator>
      <dc:date>2010-05-15T09:59:15Z</dc:date>
    </item>
    <item>
      <title>bin hopping algorithm</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820541#M1252</link>
      <description>You found the same online paper that I did. It doesn't have an algorithm, as you've found.&lt;BR /&gt;&lt;BR /&gt;Have you tried the reference [12] cited in the paper?&lt;BR /&gt;&lt;BR /&gt;Kessler, R.E., Hill, M.D.: Page placement algorithms for large real-indexed caches. &lt;EM&gt;ACM Trans. Comput. Syst.&lt;/EM&gt; 10 (1992) 338359.&lt;BR /&gt;&lt;BR /&gt;From "An Empirical Study of the Effects of Careful Page Placement in Linux" by Bahadur, et al (&lt;A href="http://portal.acm.org/ft_gateway.cfm?id=275365&amp;amp;type=pdf"&gt;http://portal.acm.org/ft_gateway.cfm?id=275365&amp;amp;type=pdf&lt;/A&gt;), I found this:&lt;BR /&gt;&lt;BR /&gt;&lt;BLOCKQUOTE&gt;&lt;P&gt;In &lt;EM&gt;dynamic coloring&lt;/EM&gt;, bin selection is based upon some dynamic estimate of each bins activity level. Without special hardware such as that proposed in [J. Baker. The Effects of Virtual Page Placement on Cache Miss Ratios. M.S. Thesis, Department of Computer Science, Clemson University, Clemson SC, 1992], accurate estimates may be impossible to obtain. The principle of temporal locality indicates that a bin that has been recently assigned a new page is likely to experience relatively high activity. This observation motivates the round robin assignment of bins which is commonly known as &lt;EM&gt;bin hopping&lt;/EM&gt;. Two variations of bin hopping have been studied and reported upon: global bin hopping in which the page fault manager simply maintains a single next-bin identifier and local bin hopping in which a next-bin identifier is maintained for each process.&lt;/P&gt;&lt;/BLOCKQUOTE&gt;&lt;BR /&gt;I would also suggest trying texts on virtural memory systems.&lt;BR /&gt;&lt;BR /&gt;--clay</description>
      <pubDate>Wed, 02 Jun 2010 22:56:25 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/bin-hopping-algorithm/m-p/820541#M1252</guid>
      <dc:creator>ClayB</dc:creator>
      <dc:date>2010-06-02T22:56:25Z</dc:date>
    </item>
  </channel>
</rss>

