<node id="690019">
  <nid>690019</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1777058178</created>
  <changed>1777058206</changed>
  <title><![CDATA[PhD Proposal by Bodhisatwa Chatterjee]]></title>
  <body><![CDATA[<p><strong>Title</strong>: Predicting Dynamic Program Behavior with Compiler-Guided Machine Learning</p><p>&nbsp;</p><p><strong>Date</strong>: Monday, April 27th, 2026</p><p><strong>Time</strong>: 1:00 - 3:00 PM EST</p><p><strong>Location</strong>: Klaus 2108</p><p><strong>Virtual Link</strong>: Zoom (<a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgatech.zoom.us%2Fj%2F92124146699%3Fpwd%3DHZbNuDUQntsJGfjLNaflLph0oQVl3E.1&amp;data=05%7C02%7Ctm186%40gtvault.onmicrosoft.com%7Cd265fca0ab844136646208dea16de20b%7C482198bbae7b4b258b7a6d7f32faa083%7C1%7C0%7C639125690515632063%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&amp;sdata=zx4POYmFkHu208kt1ZwHcF4GBBrWmj9JCPj%2FxFmFOfk%3D&amp;reserved=0">https://gatech.zoom.us/j/92124146699?pwd=HZbNuDUQntsJGfjLNaflLph0oQVl3E.1</a>)</p><p>&nbsp;</p><p><strong>Bodhisatwa Chatterjee</strong><br>Ph.D. Student</p><p>School of Computer Science</p><p>College of Computing</p><p>Georgia Institute of Technology</p><p>&nbsp;</p><p><strong>Committee:</strong></p><p>Dr. Santosh Pande (Advisor) – School of Computer Science, Georgia Institute of Technology</p><p>Dr. Qirun Zhang – School of Computer Science, Georgia Institute of Technology</p><p>Dr. Vijay Ganesh – School of Computer Science, Georgia Institute of Technology</p><p>Dr. Willow Ahrens – School of Computer Science, Georgia Institute of Technology</p><p>&nbsp;</p><p>&nbsp;</p><p>Abstract</p><p>&nbsp;</p><p>Accurate knowledge of program execution behavior is critical for both compiler optimizations and system-level resource management. However, modern workloads exhibit complex, input-dependent behavior with irregular control flow and dynamic phase changes, making static reasoning inadequate. While dynamic optimization techniques offer an alternative, their high analysis overhead often negates potential performance gains. In this work, we propose <em>lightweight predictive techniques that leverage runtime values and machine learning models to estimate loop characteristics in a just-in-time manner at loop boundaries</em>. Although such predictions do not provide strict guarantees, we demonstrate empirically that they enable a range of “soft” optimizations that yield significant performance improvements.</p><p>&nbsp;</p><p>In our first work, we showcase <strong>Compiler-Guided Cache Apportioning System (Com-CAS)</strong>&nbsp;for effectively apportioning the shared Last-Level Cache (LLC), through the <em>use of runtime and compile-time cooperative framework</em>. In our second work, we extend this approach to estimate trip count for irregular loops, and present<strong>&nbsp;Beacons Framework</strong>, an end-to-end system that estimates dynamic loop characteristics and leverages them for proactive workload scheduling.</p><p>&nbsp;</p><p>In our third work, we introduce<strong>&nbsp;Phaedrus</strong>, a framework for profile-driven software optimization via predictive modeling of dynamic application behavior. Phaedrus combines <em>application profile generalization</em>&nbsp;and <em>application profile synthesis</em>, integrating generative deep learning models and LLMs with static compiler analysis to predict function calls and control-flow behavior. This enables profile-guided optimization without a priori profiling, and demonstrates performance gains over traditional offline profiling approaches.</p><p>&nbsp;</p><p>Finally, we propose to extend this research along two complementary directions. First, we investigate <em>selective instrumentation and fine-grained prediction</em>&nbsp;for software optimization, where loops are categorized based on their dynamic trip count characteristics, and predictive models are selectively developed only for computationally intensive regions to enable superior profile-guided optimizations while minimizing overhead. Secondly, we plan to leverage <em>domain knowledge and large language models in understanding program intent</em>&nbsp;and map it to more efficient algorithmic variants tailored to specific inputs.&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Predicting Dynamic Program Behavior with Compiler-Guided Machine Learning]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Predicting Dynamic Program Behavior with Compiler-Guided Machine Learning</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2026-04-27T13:00:00-04:00]]></value>
      <value2><![CDATA[2026-04-27T15:00:33-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[Klaus 2108]]></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>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
