<node id="545161">
  <nid>545161</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1466005277</created>
  <changed>1475893083</changed>
  <title><![CDATA[PhD Defense by Sudarsun Kannan]]></title>
  <body><![CDATA[<p><strong>Title</strong>: OS Support for Heterogeneous Memory Management<br /> <br /> Sudarsun Kannan<br /> School of Computer Science<br /> College of Computing<br /> Georgia Institute of Technology<br /> <br /> <strong>Date</strong>: Friday, July 1st, 2016<br /> <strong>Time</strong>: 10 AM to 12 PM EST<br /> <strong>Location</strong>: KACB 3402<br /> <br /> <strong>Committee</strong>:<br /> Dr. Ada Gavrilovska (Advisor and Committee Chair, School of Computer Science, Georgia Tech)</p><p>Dr. Karsten Schwan (Advisor, School of Computer Science, Georgia Tech)</p><p>Dr. Umakishore Ramachandran (School of Computer Science, Georgia Tech)</p><p>Dr. Moinuddin Qureshi (School of Electrical and Computer Engineering, Georgia Tech)</p><p>Dr. Remzi H. Arpaci-Dusseau (Dept. of Computer Science, University of Wisconsin-Madison)</p><p>Dr. Greg Eisenhauer(School of Computer Science, Georgia Tech)</p><p><br /> <strong>Abstract:</strong><br /> To address the 'memory wall' problem of future systems, vendors are creating heterogeneous&nbsp;</p><p>memory structures, supplementing DRAM with on-chip stacked 3D-RAM and high capacity&nbsp;</p><p>non-volatile memory (NVM). Each of these technologies differs significantly in terms of density,&nbsp;</p><p>bandwidth, and latency. However,&nbsp;current operating systems (OSes) and&nbsp;</p><p>software stacks lack generic memory abstractions that can be uniformly used with different&nbsp;</p><p>memory types. This increases the software complexity&nbsp;resulting in limited performance and&nbsp;</p><p>efficiency benefits&nbsp;from the memory heterogeneity for both virtualized and non-virtualized&nbsp;</p><p>systems.&nbsp;To address&nbsp;these challenges, &nbsp;this thesis develops HeteroMem -- an OS design&nbsp;</p><p>for heterogeneous&nbsp;memory and makes the following contribution.</p><p>&nbsp;</p><p>First, HeteroMem introduces a unified OS abstraction for heterogeneous memories.&nbsp;</p><p>As a result, different memory technologies can extensively leverage the current advances&nbsp;</p><p>made for traditional memory management, thereby reducing software complexity, achieving&nbsp;</p><p>efficient use of hardware resources such as caches and TLBs, and permitting seamless&nbsp;</p><p>scaling across heterogeneous memory components. Second, HeteroMem incorporates novel&nbsp;</p><p>memory placement mechanisms focused on reducing data movement overheads. The&nbsp;</p><p>outcome is up to 2x improvement in application performance compared to the&nbsp;</p><p>state-of-the-art solutions.</p><p>&nbsp;</p><p>Furthermore, to exploit the persistence benefits from non-volatile memories, &nbsp;HeteroMem goes&nbsp;</p><p>beyond memory capacity scaling, to provide fast persistent object storage. Using NVMs for&nbsp;</p><p>persistence leads to new types of cache sharing and energy bottlenecks. We address&nbsp;</p><p>these bottlenecks&nbsp;via novel cache- and energy-efficient system software principles that do not&nbsp;</p><p>impact application correctness. Finally, for achieving maximum performance and reliability&nbsp;</p><p>gains with heterogeneous memory, we also explore the redesign of HPC, datacenter, and&nbsp;</p><p>end-user applications.</p><p>&nbsp;</p><p></p><p>&nbsp;</p><p>&nbsp;</p><p>&nbsp;</p><p> </p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[OS Support for Heterogeneous Memory Management]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2016-07-01T11:00:00-04:00]]></value>
      <value2><![CDATA[2016-07-01T13:00:00-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
