CINXE.COM
ACM-IEEE CS George Michael Memorial HPC Fellowships
<!DOCTYPE html> <html lang="en" class=" no-js"> <head> <!-- Google Consent Mode --> <script data-cookieconsent="ignore"> window.dataLayer = window.dataLayer || []; function gtag(){ dataLayer.push(arguments); } gtag("consent", "default", { ad_storage: "denied", analytics_storage: "denied", functionality_storage: "denied", personalization_storage: "denied", security_storage: "granted", wait_for_update: 500 }); gtag("set", "ads_data_redaction", true); gtag("set", "url_passthrough", false); </script> <!-- End Google Consent Mode--> <!-- Google Tag Manager --> <script data-cookieconsent="ignore"> (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-5BVDRXH'); </script> <!-- End Google Tag Manager --> <!-- Cookiebot CMP--> <script id="Cookiebot" src="https://consent.cookiebot.com/uc.js" data-cbid="9bb7fc8b-05a2-4292-85e6-45213b19c5ff" data-blockingmode="auto" type="text/javascript" ></script> <!-- End Cookiebot CMP --> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> <meta charset="utf-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no"/> <link rel="stylesheet" href="/css/acm.css?antiCache=1716999351349" type="text/css"/> <link rel="stylesheet" href="/css/print.css?antiCache=1716999351349" type="text/css" media="print"/> <script type="text/javascript" src="/js/classList.js"></script> <script type="text/javascript" src="/js/webfontloader.js"></script> <script type="text/javascript" src="/js/analytics.js?="></script> <script data-cookieconsent="ignore" type="text/javascript" src="/js/modernizr.js"></script> <link rel="shortcut icon" href="/catalog/favicon.ico?v=10"> <meta class="foundation-data-attribute-namespace"> <meta class="foundation-mq-xxlarge"> <meta class="foundation-mq-xlarge-only"> <meta class="foundation-mq-xlarge"> <meta class="foundation-mq-large-only"> <meta class="foundation-mq-large"> <meta class="foundation-mq-medium-only"> <meta class="foundation-mq-medium"> <meta class="foundation-mq-small-only"> <meta class="foundation-mq-small"> <meta class="foundation-mq-topbar"> <title>ACM-IEEE CS George Michael Memorial HPC Fellowships</title> <meta property="og:title" content="2024 ACM-IEEE CS George Michael Memorial HPC Fellowships Recipients Ke Fan of the University of Illinois at Chicago and Daniel Nichols of the University of Maryland"/> <meta name="description" content="Information about ACM-IEEE CS George Michael Memorial HPC Fellowships"/> <meta property="og:description" content="ACM, the Association for Computing Machinery, and the IEEE Computer Society announced today that Ke Fan of the University of Illinois at Chicago and Daniel Nichols of the University of Maryland are the recipients of the 2024 ACM-IEEE CS George Michael Memorial HPC Fellowships. The George Michael Memorial Fellowship honors exceptional PhD students throughout the world whose research focus is high-performance computing (HPC) applications, networking, storage, or large-scale data analytics. Fan is recognized for her research in three key areas of high-performance computing: optimizing the performance of MPI collectives, enhancing the performance of irregular parallel I/O operations, and improving the scalability of performance introspection frameworks. Nichols is recognized for advancements in machine-learning based performance modeling and the advancement of large language models for HPC and scientific codes."/> <meta property="og:type" content="website"/> <meta property="og:image" content="https://awards.acm.org/binaries/content/gallery/acm/ctas/awards/gmm-hpc-fellowships-2024.jpg"/> <meta name="twitter:card" content="summary_large_image"/> <meta name="twitter:site" content="@theofficialacm"/> <meta name="twitter:title" content="2024 ACM-IEEE CS George Michael Memorial HPC Fellowships Recipients Ke Fan of the University of Illinois at Chicago and Daniel Nichols of the University of Maryland"/> <meta name="twitter:description" content="Read the news release: https://www.acm.org/media-center/2024/august/george-michael-fellowship-recipients-2024"/> <meta name="twitter:image" content="https://awards.acm.org/binaries/content/gallery/acm/ctas/awards/gmm-hpc-fellowships-2024.jpg"/> <meta property="og:url" content="https://awards.acm.org/xpages/hpc-fellows/index"/> <!-- Global site tag (gtag.js) - Google Ads: 968097012 --> <script async src="https://www.googletagmanager.com/gtag/js?id=AW-968097012"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'AW-968097012'); </script> <!-- Global site tag (gtag.js) - Google Ads: 968097012 --> <script async src="https://www.googletagmanager.com/gtag/js?id=AW-968097012"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('set', 'linker', { 'domains': ['acm.org/','cvent.com/'], 'accept_incoming': true }); gtag('js', new Date()); gtag('config', 'AW-968097012'); </script></head> <body> <!-- Google Tag Manager (noscript) --> <noscript><iframe data-cookieblock-src="https://www.googletagmanager.com/ns.html?id=GTM-5BVDRXH" data-cookieconsent="marketing" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript> <!-- End Google Tag Manager (noscript) --> <!-- place holder --><div id="header" class="row"> <nav class="top-bar eyebrow show-for-medium-up" data-topbar data-options="is_hover: false"> <section class="top-bar-section"> <div id="skiptocontent"><a href="#SkipTarget">skip to main content</a></div> <ul class="right"> <li><a href="https://www.acm.org" title="ACM Home">ACM Home</a></li> <li><a href="http://amturing.acm.org" title="ACM A.M. Turing Award">ACM A.M. Turing Award</a></li> <li><a href="http://www.acm.org/turing-award-50" title="Turing 50">Turing 50</a></li> <li><a href="http://dl.acm.org" title="Digital Library">Digital Library</a></li> <li><a href="http://cacm.acm.org" title="CACM">CACM</a></li> <li><a href="http://queue.acm.org" title="Queue">Queue</a></li> <li><a href="http://technews.acm.org" title="TechNews">TechNews</a></li> </ul> </section> </nav> <div class="clearfix utilities-area"> <div class="logo-section"> <div class="navbar-header show-for-large-up"> <a class="navbar-brand" href="https://www.acm.org"> <img alt="ACM Logo" class="img-responsive" title="Home" src="/binaries/content/gallery/global/top-menu/acm_logo_tablet.svg"> </a> </div> <div class="navbar-header hide-for-large-up"> <a href=""> <img alt="ACM Logo" class="img-responsive hide-for-large-up" title="Home" src="/binaries/content/gallery/global/top-menu/acm_logo_mobile.svg"> </a> </div> </div> <div id="acm-description" class="column large-5 show-for-large-up"> <div> ACM recognizes excellence<!-- We're an international society of educators, scientists, technologists and engineers dedicated to the advancement of computer science. We offer a world-class <a href="#">Digital Library</a>, <a href="#">publications</a>, <a href="#">conferences</a>, and more. --> </div> </div> <div id="ctas-and-search" class="column large-5 medium-6 no-pad-left ctas-and-search"> <ul class="block-grid right"> <li><a href="/">Home</a></li> <li><a href="/award-recipients">Award Recipients</a></li> <li><a href="/contact-us">Contact Us</a></li> <li class="hide-for-small"> <form class="acm-search-form" id="form_1"> <label for="input_1"> <span class="visually-hidden">Search Input</span> </label> <input type="text" name="q" id="input_1" class="acm-searchbox-input st-default-search-input"/> <label for="search-site_1" class="toggle"> <span class="visually-hidden">Search Submit</span> <i class="fa fa-search left"></i> <input type="button" class="acm-searchbox-submit left" value="Search" name="search-site_1" id="search-site_1" /> </label> </form> </li> </ul> </div> </div> <script type="text/javascript"> (function(w,d,t,u,n,s,e){w['SwiftypeObject']=n;w[n]=w[n]||function(){ (w[n].q=w[n].q||[]).push(arguments);};s=d.createElement(t); e=d.getElementsByTagName(t)[0];s.async=1;s.src=u;e.parentNode.insertBefore(s,e); })(window,document,'script','//s.swiftypecdn.com/install/v2/st.js','_st'); _st('install','RXEmTxVGH--uT5UYK-Dy','2.0.0'); </script> <nav class="top-bar main-nav" data-topbar data-options="is_hover: false"> <ul class="title-area"> <li class="toggle-topbar menu-icon"><a href="#"><span></span> </a></li> </ul> <section id="mobile-nav-topbar" class="top-bar-section"> <div class="mobile-links"> <div class="btn-group"> <a class="btn btn-primary" role="button" href="/">Home</a> <a class="btn btn-primary" role="button" href="/award-recipients">Award Recipients</a> <a class="btn btn-primary" role="button" href="/contact-us">Contact Us</a> </div> <div class="mobile-search"> <form class="acm-search-form" id="mobile_form_1"> <i class="fa fa-search left"></i> <label class="" for="search_mobile_1">Search</label> <input type="text" id="search_mobile_1" class="acm-searchbox-input st-default-search-input" name="q"/> </form> </div> </div> <ul> <li class="has-dropdown not-click"><a href="#">ACM Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/" class="first">Awards Home</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/about/turing-laureates-spotlight" title="Spotlight on Turing Laureates" >Spotlight on Turing Laureates</a></li> <li><a href="/turing" title="ACM A.M. Turing Award" >ACM A.M. Turing Award</a></li> <li><a href="/acm-prize" title="ACM Prize in Computing" >ACM Prize in Computing</a></li> <li><a href="/thacker" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a></li> <li><a href="/allen" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/barroso" title="ACM Luiz André Barroso Award" >ACM Luiz André Barroso Award</a></li> <li><a href="/distinguished-service" title="ACM Distinguished Service Award" >ACM Distinguished Service Award</a></li> <li><a href="/doctoral-dissertation" title="ACM Doctoral Dissertation Award" >ACM Doctoral Dissertation Award</a></li> <li><a href="/eckert-mauchly" title="ACM-IEEE CS Eckert-Mauchly Award" >ACM-IEEE CS Eckert-Mauchly Award</a></li> <li><a href="/hopper" title="ACM Grace Murray Hopper Award" >ACM Grace Murray Hopper Award</a></li> <li><a href="/bell" title="ACM Gordon Bell Prize" >ACM Gordon Bell Prize</a></li> <li><a href="/bell-climate" title="ACM Gordon Bell Prize for Climate Modelling" >ACM Gordon Bell Prize for Climate Modelling</a></li> <li><a href="international-science-and-engineering-fair" title="International Science and Engineering Fair" >International Science and Engineering Fair</a></li> <li><a href="/kanellakis" title="ACM Paris Kanellakis Theory and Practice Award" >ACM Paris Kanellakis Theory and Practice Award</a></li> <li><a href="/karlstrom" title="ACM Karl V. Karlstrom Outstanding Educator Award" >ACM Karl V. Karlstrom Outstanding Educator Award</a></li> <li><a href="/kennedy" title="ACM-IEEE CS Ken Kennedy Award" >ACM-IEEE CS Ken Kennedy Award</a></li> <li><a href="/lawler" title="ACM Eugene L. Lawler Award" >ACM Eugene L. Lawler Award</a></li> <li><a href="/hpc-fellows" title="ACM-IEEE CS George Michael Memorial HPC Fellowships" >ACM-IEEE CS George Michael Memorial HPC Fellowships</a></li> <li><a href="/newell" title="ACM AAAI Allen Newell Award" >ACM AAAI Allen Newell Award</a></li> <li><a href="/outstanding-contribution" title="Outstanding Contribution to ACM Award" >Outstanding Contribution to ACM Award</a></li> <li><a href="/policy" title="ACM Policy Award" >ACM Policy Award</a></li> <li><a href="/president" title="ACM Presidential Award" >ACM Presidential Award</a></li> <li><a href="/computational-science" title="SIAM/ACM Prize in Computational Science and Engineering" >SIAM/ACM Prize in Computational Science and Engineering</a></li> <li><a href="/software-system" title="ACM Software System Award" >ACM Software System Award</a></li> <li><a href="/athena" title="ACM Athena Lecturer Award" >ACM Athena Lecturer Award</a></li> <li><a href="/cutler-bell" title="ACM/CSTA Cutler-Bell Prize for High School Computing" >ACM/CSTA Cutler-Bell Prize for High School Computing</a></li> <li><a href="/sponsors" title="Sponsors of ACM Awards" >Sponsors of ACM Awards</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Awards</p> <h2 id="h-GivingCreditwhereCreditIsDue" style="color: rgb(51, 51, 51); text-align: left;">Giving Credit where Credit Is Due</h2> <div class="clearfix" style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;"> <p>ACM recognizes excellence through its eminent awards for technical and professional achievements and contributions in computer science and information technology. It also names as Fellows and Distinguished Members those members who, in addition to professional accomplishments, have made significant contributions to ACM's mission. ACM awards recognize achievements by young computing professionals, educators, theoretical computer scientists, software systems innovators, and pioneers who have made humanitarian and cross-discipline contributions.</p> </div></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://www.nobelprize.org/prizes/physics/2024/press-release/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/geoffrey-hinton.jpg" alt="2024 Nobel Prize in Physics recipient Geoffrey Hinton"></a><div class="cta-text"> <a href='https://www.nobelprize.org/prizes/physics/2024/press-release/' target='_blank'>Geoffrey Hinton Awarded the 2024 Nobel Prize in Physics</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://awards.acm.org/barroso' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-luiz-andre-barroso-award.jpg" alt="Image promoting the ACM Luiz André Barroso Award"></a><div class="cta-text"> <a href='https://awards.acm.org/barroso' target='_blank'>ACM Announces Luiz André Barroso Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-fellows-member-badge.jpg" alt="acm-fellows-member-badge.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' >ACM Names 2023 Fellows</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Advanced Member Grades</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/advanced-member-grades" class="first">Advanced Grades of Membership</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/fellows" title="ACM Fellows" >ACM Fellows</a></li> <li><a href="/distinguished-members" title="ACM Distinguished Members" >ACM Distinguished Members</a></li> <li><a href="/senior-members" title="ACM Senior Members" >ACM Senior Members</a></li> <li><a href="/fellows/faq" title="ACM Fellows FAQ" >ACM Fellows FAQ</a></li> <li><a href="/distinguished-members/faq" title="ACM Distinguished Members FAQ" >ACM Distinguished Members FAQ</a></li> <li><a href="/senior-members/faq" title="ACM Senior Members FAQ" >ACM Senior Members FAQ</a></li> <li><a href="/fellows/committee" title="ACM Fellows Committee" >ACM Fellows Committee</a></li> <li><a href="/distinguished-members/committee" title="ACM Distinguished Member Committee" >ACM Distinguished Member Committee</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">ACM Advanced Grades of Membership</p> <p>The ACM <span style="color: rgb(51, 51, 51); line-height: 20.8px; text-align: left;">Advanced Grades of Membership program </span>recognizes the achievements of ACM members through all stages of their career.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-fellows-member-badge.jpg" alt="acm-fellows-member-badge.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/media-center/2024/january/fellows-2023' >ACM Names 2023 Fellows</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/bulletins/2024/january/distinguished-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-distinguished-member-badge.jpg" alt="acm-distinguished-member-badge.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/articles/bulletins/2024/january/distinguished-2023' >ACM Names 2023 Distinguished Members</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">SIG Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/sig-awards" class="first">About SIG Awards</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/sig-awards/sigaccess" title="SIGACCESS" >SIGACCESS</a></li> <li><a href="/sig-awards/sigact" title="SIGACT" >SIGACT</a></li> <li><a href="/sig-awards/sigada" title="SIGAda" >SIGAda</a></li> <li><a href="/sig-awards/sigai" title="SIGAI" >SIGAI</a></li> <li><a href="/sig-awards/sigapp" title="SIGAPP" >SIGAPP</a></li> <li><a href="/sig-awards/sigarch" title="SIGARCH" >SIGARCH</a></li> <li><a href="/sig-awards/sigbed" title="SIGBED" >SIGBED</a></li> <li><a href="/sig-awards/sigbio" title="SIGBio" >SIGBio</a></li> <li><a href="/sig-awards/sigcas" title="SIGCAS" >SIGCAS</a></li> <li><a href="/sig-awards/sigchi" title="SIGCHI" >SIGCHI</a></li> <li><a href="/sig-awards/sigcomm" title="SIGCOMM" >SIGCOMM</a></li> <li><a href="/sig-awards/sigcse" title="SIGCSE" >SIGCSE</a></li> <li><a href="/sig-awards/sigda" title="SIGDA" >SIGDA</a></li> <li><a href="/sig-awards/sigdoc" title="SIGDOC" >SIGDOC</a></li> <li><a href="/sig-awards/sigecom" title="SIGEcom" >SIGEcom</a></li> <li><a href="/sig-awards/sigevo" title="SIGEVO" >SIGEVO</a></li> <li><a href="/sig-awards/sigir" title="SIGIR" >SIGIR</a></li> <li><a href="/sig-awards/siggraph" title="SIGGRAPH" >SIGGRAPH</a></li> <li><a href="/sig-awards/sighpc" title="SIGHPC" >SIGHPC</a></li> <li><a href="/sig-awards/sigkdd" title="SIGKDD" >SIGKDD</a></li> <li><a href="/sig-awards/siglog" title="SIGLOG" >SIGLOG</a></li> <li><a href="/sig-awards/sigmetrics" title="SIGMETRICS" >SIGMETRICS</a></li> <li><a href="/sig-awards/sigmicro" title="SIGMICRO" >SIGMICRO</a></li> <li><a href="/sig-awards/sigmis" title="SIGMIS" >SIGMIS</a></li> <li><a href="/sig-awards/sigmm" title="SIGMM" >SIGMM</a></li> <li><a href="/sig-awards/sigmobile" title="SIGMOBILE" >SIGMOBILE</a></li> <li><a href="/sig-awards/sigmod" title="SIGMOD" >SIGMOD</a></li> <li><a href="/sig-awards/sigops" title="SIGOPS" >SIGOPS</a></li> <li><a href="/sig-awards/sigplan" title="SIGPLAN" >SIGPLAN</a></li> <li><a href="/sig-awards/sigsac" title="SIGSAC" >SIGSAC</a></li> <li><a href="/sig-awards/sigsam" title="SIGSAM" >SIGSAM</a></li> <li><a href="/sig-awards/sigsim" title="SIGSIM" >SIGSIM</a></li> <li><a href="/sig-awards/sigsoft" title="SIGSOFT" >SIGSOFT</a></li> <li><a href="/sig-awards/siguccs" title="SIGUCCS" >SIGUCCS</a></li> <li><a href="/sig-awards/sigweb" title="SIGWEB" >SIGWEB</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About SIG Awards</p> <p><span style="color: rgb(34, 34, 34); font-family: Verdana; font-size: 14px; line-height: 16.8px; text-align: start;">ACM's Special Interest Groups (SIGs) regularly cite outstanding individuals for their contributions in more than 30 distinct technological fields.</span></p></div> </li> <li class="infonav__ctaList"> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Regional Awards</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/regional-awards" class="first">About Regional Awards</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/india-doctoral-dissertation" title="ACM India Doctoral Dissertation" >ACM India Doctoral Dissertation</a></li> <li><a href="/acm-india-ecr" title="ACM India Early Career Researcher" >ACM India Early Career Researcher</a></li> <li><a href="/acm-india-occw" title="ACM India Outstanding Contributions in Computing by a Woman" >ACM India Outstanding Contributions in Computing by a Woman</a></li> <li><a href="/acm-india-occe" title="ACM India Outstanding Contribution to Computing Education" >ACM India Outstanding Contribution to Computing Education</a></li> <li><a href="/ipsj-acm-global" title="IPSJ/ACM Award for Early Career Contributions to Global Research" >IPSJ/ACM Award for Early Career Contributions to Global Research</a></li> <li><a href="/ccf-acm-ai" title="CCF-ACM Award for Artificial Intelligence" >CCF-ACM Award for Artificial Intelligence</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Regional Awards</p> <p>ACM recognizes the contributions of individuals working primarily within specific regions of the world through awards given by its regional councils, and through partnerships with international societies.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/ecr-award-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/siddharth-barman.jpg" alt="siddharth-barman.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/ecr-award-2023' >ACM India ECR 2023 Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2023/limaye-occw-2023' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/nutan-limaye.jpg" alt="nutan-limaye.jpg"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2023/limaye-occw-2023' >ACM India OCCW 2023 Award</a></div> </div> <div class="infonav__ctaList-cta"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/occe-award-2024' ><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/people/meenakshi-dsouza-poa.jpg" alt="OCCE 2024 award recipient Meenakshi D'Souza"></a><div class="cta-text"> <a href='https://www.acm.org/articles/acm-india-bulletins/2024/occe-award-2024' >ACM India OCCE 2024 Award</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Nominations</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/award-nominations" class="first">Award Nominations</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/turing/nominations" title="ACM A.M. Turing Award" >ACM A.M. Turing Award</a></li> <li><a href="/acm-prize/nominations" title="ACM Prize in Computing" >ACM Prize in Computing</a></li> <li><a href="/thacker/nominations" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a></li> <li><a href="/fran-allen-nominations" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/barroso/nominations" title="ACM Luiz André Barroso Award" >ACM Luiz André Barroso Award</a></li> <li><a href="/distinguished-service/nominations" title="ACM Distinguished Service Award" >ACM Distinguished Service Award</a></li> <li><a href="/doctoral-dissertation/nominations" title="ACM Doctoral Dissertation Award" >ACM Doctoral Dissertation Award</a></li> <li><a href="/eckert-mauchly/nominations" title="ACM-IEEE CS Eckert-Mauchly Award" >ACM-IEEE CS Eckert-Mauchly Award</a></li> <li><a href="/bell/nominations" title="ACM Gordon Bell Prize" >ACM Gordon Bell Prize</a></li> <li><a href="/hopper/nominations" title="ACM Grace Murray Hopper Award" >ACM Grace Murray Hopper Award</a></li> <li><a href="/kanellakis/nominations" title="ACM Paris Kanellakis Theory and Practice Award" >ACM Paris Kanellakis Theory and Practice Award</a></li> <li><a href="/karlstrom/nominations" title="ACM Karl V. Karlstrom Outstanding Educator Award" >ACM Karl V. Karlstrom Outstanding Educator Award</a></li> <li><a href="/kennedy/nominations" title="ACM-IEEE CS Ken Kennedy Award" >ACM-IEEE CS Ken Kennedy Award</a></li> <li><a href="/lawler/nominations" title="ACM Eugene L. Lawler Award" >ACM Eugene L. Lawler Award</a></li> <li><a href="/hpc-fellows/nominations" title="ACM-IEEE CS George Michael Memorial HPC Fellowships" >ACM-IEEE CS George Michael Memorial HPC Fellowships</a></li> <li><a href="/outstanding-contribution/nominations" title="Outstanding Contribution to ACM Award" >Outstanding Contribution to ACM Award</a></li> <li><a href="/newell/nominations" title="ACM AAAI Allen Newell Award" >ACM AAAI Allen Newell Award</a></li> <li><a href="/policy/nominations" title="ACM Policy Award" >ACM Policy Award</a></li> <li><a href="/computational-science/nominations" title="SIAM/ACM Prize in Computational Science and Engineering" >SIAM/ACM Prize in Computational Science and Engineering</a></li> <li><a href="/software-system/nominations" title="ACM Software System Award" >ACM Software System Award</a></li> <li><a href="/athena/nominations" title="ACM Athena Lecturer Award" >ACM Athena Lecturer Award</a></li> <li><a href="/cutler-bell/nominations" title="ACM/CSTA Cutler-Bell Prize in High School Computing" >ACM/CSTA Cutler-Bell Prize in High School Computing</a></li> <li><a href="/fellows/nominations" title="ACM Fellows" >ACM Fellows</a></li> <li><a href="/distinguished-members/nominations" title="ACM Distinguished Members" >ACM Distinguished Members</a></li> <li><a href="/senior-members/nominations" title="ACM Senior Members" >ACM Senior Members</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">Awards Nominating Process</p> <h2 id="h-GivingCreditwhereCreditIsDue">How to Nominate</h2> <p>Award nominations deadlines occur throughout the year, with a heavy concentration in January. Please refer to the Nomination Process page for each award, which includes not only information about the deadline but also guidance for preparing each type of nomination. ACM's <a href="/conflict-of-interest">conflict-of-interest guidelines</a> apply to all award nominations.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Honors and Ethics</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/policy-for-honors" class="first">Policy for Honors Conferred by ACM</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/policies-and-procedures" title="Policies and Procedures for Honors Conferred by ACM" >Policies and Procedures for Honors Conferred by ACM</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">ACM Honors and Ethics</p> <p> ACM formally recognizes individuals for significant contributions to the field, ACM, or its interests. ACM expects individuals it honors to abide by the ACM Code of Ethics and Professional Conduct. Learn about ACM's policies and procedures for integrating expectations of ethical behaviour and ACM Awards. </p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Awards Committees</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/committees" class="first">ACM Awards Committee</a> <ul class="infonav__linkList-list clearfix"> <li><a href="/turing/committee" title="ACM A.M. Turing Award Committee" >ACM A.M. Turing Award Committee</a></li> <li><a href="/acm-prize/committee" title="ACM Prize in Computing Committee" >ACM Prize in Computing Committee</a></li> <li><a href="/thacker/committee" title="ACM Charles P. "Chuck" Thacker Breakthrough in Computing Committee" >ACM Charles P. "Chuck" Thacker Breakthrough in Computing Committee</a></li> <li><a href="/allen/committee" title="ACM Frances E. Allen Award" >ACM Frances E. Allen Award</a></li> <li><a href="/distinguished-service/committee" title="ACM Distinguished Service Award Committee" >ACM Distinguished Service Award Committee</a></li> <li><a href="/doctoral-dissertation/committee" title="ACM Doctoral Dissertation Award Committee" >ACM Doctoral Dissertation Award Committee</a></li> <li><a href="/eckert-mauchly/committee" title="ACM-IEEE CS Eckert Mauchley Award Committee" >ACM-IEEE CS Eckert Mauchley Award Committee</a></li> <li><a href="/bell/committee" title="ACM Gordon Bell Prize Committee" >ACM Gordon Bell Prize Committee</a></li> <li><a href="/hopper/committee" title="ACM Grace Murray Hopper Award Committee" >ACM Grace Murray Hopper Award Committee</a></li> <li><a href="/kanellakis/committee" title="ACM Paris Kanellakis Theory and Practice Award Committee" >ACM Paris Kanellakis Theory and Practice Award Committee</a></li> <li><a href="/karlstrom/committee" title="ACM Karl V. Karlstrom Outstanding Educator Award Committee" >ACM Karl V. Karlstrom Outstanding Educator Award Committee</a></li> <li><a href="/kennedy/committee" title="ACM-IEEE CS Ken Kennedy Award Committee" >ACM-IEEE CS Ken Kennedy Award Committee</a></li> <li><a href="/lawler/committee" title="ACM Eugene L. Lawler Award Committee" >ACM Eugene L. Lawler Award Committee</a></li> <li><a href="/hpc-fellows/committee" title="ACM-IEEE CS George Michael Memorial HPC Fellowships Committee" >ACM-IEEE CS George Michael Memorial HPC Fellowships Committee</a></li> <li><a href="/newell/committee" title="ACM AAAI Allen Newell Award Committee" >ACM AAAI Allen Newell Award Committee</a></li> <li><a href="/outstanding-contribution/committee" title="Outstanding Contribution to ACM Award Committee" >Outstanding Contribution to ACM Award Committee</a></li> <li><a href="/policy/committee" title="ACM Policy Award Committee" >ACM Policy Award Committee</a></li> <li><a href="/computational-science/committee" title="SIAM/ACM Prize in Computational Science and Engineering Committee" >SIAM/ACM Prize in Computational Science and Engineering Committee</a></li> <li><a href="/software-system/committee" title="ACM Software System Award Committee" >ACM Software System Award Committee</a></li> <li><a href="/athena/committee" title="ACM Athena Lecturer Award Committee" >ACM Athena Lecturer Award Committee</a></li> <li><a href="/india-doctoral-dissertation/committee" title="ACM India Doctoral Dissertation Award Committee" >ACM India Doctoral Dissertation Award Committee</a></li> <li><a href="/fellows/committee" title="ACM Fellows Committee" >ACM Fellows Committee</a></li> <li><a href="/distinguished-members/committee" title="ACM Distinguished Member Committee" >ACM Distinguished Member Committee</a></li> <li><a href="/senior-members/committee" title="ACM Senior Member Committee" >ACM Senior Member Committee</a></li> <li><a href="/awards-committees/conflict-of-interest" title="Conflict of Interest Guidelines" >Conflict of Interest Guidelines</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">About ACM Awards Committees</p> <p>At the core of the ACM Awards program is a dedicated group of volunteers who serve on the committees of the ACM Awards to recognize individuals for their excellence in the computing fields</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/awards-ctte-co-chairs.jpg" alt="awards-ctte-co-chairs.jpg"><div class="cta-text"> </div> </div> </li> </ul> </div> </li> <li class="has-dropdown not-click"><a href="#">Establishing an Award</a> <div class="dropdown clearfix"> <ul class="infonav clearfix"> <li class="infonav__linkList clearfix"> <a href="/guides" class="first">Policies and Guide for Establishing an ACM Award</a> <ul class="infonav__linkList-list clearfix"> <li><a href="http://www.acm.org/publications/policies/guidelines-best-paper-award" title="ACM Publications Board Guidelines for Establishing a Best Paper Award for ACM Periodicals" >ACM Publications Board Guidelines for Establishing a Best Paper Award for ACM Periodicals</a></li> </ul> </li> <li class="infonav__landingPage"> <div> <p class="first">Policies and Guide</p> <p>ACM welcomes proposals for the establishment of new awards, to recognize contributions based on merit, service, or for an outstanding paper.</p></div> </li> <li class="infonav__ctaList"> <div class="infonav__ctaList-cta"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/acm-w-rising-star-award.jpg" alt="acm-w-rising-star-award.jpg"></a><div class="cta-text"> <a href='https://women.acm.org/awards/rising-star-award/' target='_blank'>Call for ACM-W Rising Star Award Nominations</a></div> </div> <div class="infonav__ctaList-cta"> <a href='/policy-for-honors' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/og-awards.jpg" alt="og-awards.jpg"></a><div class="cta-text"> <a href='/policy-for-honors' target='_blank'>ACM Honors & Ethics</a></div> </div> </li> </ul> </div> </li> </ul> </section> </nav> </div> <div id="main" > <div class="banner-container"> <div> <div> <div class="acm-banner-container" style="background: url(/binaries/bannerlarge/content/gallery/acm/banners/7_awards_acm_banner.jpg) no-repeat center 0 / 130% #000;"> <div class="gradient-wrapper" style="background: url('/binaries/content/gallery/global/gradient.png') repeat-x center 0 / 130% transparent;"></div> <div class="overlay" style="background: url('/binaries/content/gallery/global/tintpattern.png') repeat 0 0;"></div> <div class="row"> <div class="columns large-12 medium-12 banner-content"> <p class="banner-heading"> <small>Student Contributions</small> ACM-IEEE CS George Michael Memorial HPC Fellowships</p> <p>Exceptional PhD students focusing on HPC applications, networking, storage, or large-scale data analysis</p><a class="button" href="hpc-fellows/award-recipients" > Award Recipients</a> <a class="button" href="/hpc-fellows/nominations" > How to Nominate</a> <a class="button" href="hpc-fellows/committee" > Committee Members</a> </div> </div> </div> </div> </div> </div> <div class="article" id="maincontent"> <article class="has-edit-button" id="SkipTarget" tabindex="-1"> <div class="row"> <div class="columns small-12 zone-1"> <div> <div> <ul class="breadcrumbs"> <li><a href="/">Home</a></li> <li class="current"> <a href="/hpc-fellows">ACM-IEEE CS George Michael Memorial HPC Fellowships</a> </li> </ul> </div> </div> </div> </div> <div class="row"> <div class="columns large-8 medium-8 small-12 zone-2"> <div> <div> <div class="articles"> <div class="landing"> <h1> About ACM-IEEE CS George Michael Memorial HPC Fellowships</h1> <p>Endowed in memory of George Michael, one of the founders of the SC Conference series, the ACM IEEE-CS George Michael Memorial Fellowships honor exceptional PhD students throughout the world whose research focus areas are in high performance computing, networking, storage, and large-scale data analysis. ACM, the IEEE Computer Society, and the SC Conference support this award. </p> <p>Fellowship recipients are selected each year based on overall potential for research excellence, the degree to which technical interests align with those of the HPC community, academic progress to date, recommendations by their advisor and others, and a demonstration of current and anticipated use of HPC resources. The Fellowship includes a $5,000 honorarium, plus travel and registration to receive the award at the annual SC conference.<br /> </p></div> </div> </div> <div> <h2> Recent HPC Fellowships News</h2> <div class="awards-winners__related-content"> <h3> Ke Fan and Daniel Nichols Named Recipients of the 2024 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><strong>New York, NY</strong>, <strong>August 14, 2024</strong> – ACM, the Association for Computing Machinery, and the IEEE Computer Society announced today that <a href="https://awards.acm.org/award-recipients/fan_1600404" target="_blank">Ke Fan</a> of the University of Illinois at Chicago and <a href="https://awards.acm.org/award-recipients/nichols_7206136" target="_blank">Daniel Nichols</a> of the University of Maryland are the recipients of the 2024 ACM-IEEE CS George Michael Memorial HPC Fellowships. The George Michael Memorial Fellowship honors exceptional PhD students throughout the world whose research focus is high-performance computing (HPC) applications, networking, storage, or large-scale data analytics.</p> <p>Fan is recognized for her research in three key areas of high-performance computing: optimizing the performance of MPI collectives, enhancing the performance of irregular parallel I/O operations, and improving the scalability of performance introspection frameworks. Nichols is recognized for advancements in machine-learning based performance modeling and the advancement of large language models for HPC and scientific codes.</p> <p><strong>Ke Fan</strong></p> <p>Fan’s research focuses on improving the performance of data movement associated with collective communication and parallel file I/O operations on large-scale supercomputers. Her most recent focus has been on two main areas: (1) Optimizing inter-process data movement, particularly in the context of all-to-all collectives, where all processes engage in data exchange. In this area, she has developed a new class of parameterized hierarchal algorithms that substantially improve the performance of both uniform and non-uniform all-to-all collectives. (2) Optimizing parallel I/O, targeting applications that generate unbalanced, irregular I/O workloads. Fan has specifically developed spatially aware data aggregation techniques that enhance load balancing and improve overall parallel I/O performance.</p> <p>In addition to these two areas, she has made significant progress in improving the scalability of performance introspection frameworks, which help developers understand data movement capabilities in HPC systems. With these new insights, developers can identify bottlenecks and optimize performance at scale.</p> <p><strong>Daniel Nichols </strong></p> <p>Nichols’ research is broadly centered around the intersection of machine learning (ML) and high-performance computing. His most recent focus has been on two main areas: (1) developing novel ML-based performance models to make use of all available performance data when making predictions about code runtime properties, and (2) adapting state of the art large language model (LLM) techniques to HPC applications. By utilizing recent advances in representation learning and further advancing them to handle the unique challenges of performance modeling, Nichols’ research seeks to develop models that make use of all available data when predicting performance. This research has the potential to significantly improve both the quality and applicability of performance models.</p> <p>By adapting LLM’s to HPC applications, Nichols’ work has improved their performance on HPC development tasks. He has created scientific and parallel code capable LLMs and methods for improving the quality of current models for HPC. This is part of his goal towards creating specialized LLMs to solve software complexities and allow scientists to focus on their domain research and less on the intricacies of HPC development.</p> <p><a href="https://awards.acm.org/hpc-fellows">The ACM-IEEE CS George Michael Memorial HPC Fellowship</a> is endowed in memory of George Michael, one of the founders of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage, or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend the <a href="https://supercomputing.org/">SC conference</a>, where the Fellowships are formally presented.</p></div> </div> <div class="awards-winners__related-content"> <h3> James Gregory Pauloski, Rohan Basu Roy, and Hua Huang Named Recipients of 2023 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><strong>New York, NY</strong>, <strong>October 26, 2023</strong> – ACM, the Association for Computing Machinery, and the IEEE Computer Society announced today that <a href="https://awards.acm.org/award-recipients/pauloski_0917739">James Gregory Pauloski</a> of the University of Chicago and <a href="https://awards.acm.org/award-recipients/roy_3266018">Rohan Basu Roy</a> of Northeastern University are the recipients of <a href="https://awards.acm.org/hpc-fellows"> the 2023 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. <a href="https://awards.acm.org/award-recipients/huang_9314522">Hua Huang</a> of the Georgia Institute of Technology received an Honorable Mention. Pauloski is recognized for developing systems for optimal HPC resource usage from scalable optimization methods for deep learning training to data fabrics for sophisticated applications spanning heterogeneous resources. Roy is recognized for enhancing the productivity of computational scientists and environmental sustainability of HPC with novel methods and tools exploiting cloud computing and on-premise HPC resources. Huang is recognized for contributions to high performance parallel matrix algorithms and implementations and their application to quantum chemistry calculations.</p> <p><strong>J. Gregory Pauloski</strong></p> <p>Pauloski’s aim is to build tools that are approachable and easily used by HPC novices and experts alike.</p> <p>His research approaches HPC from two aspects: efficient large scale machine learning (ML) training, and data fabrics that support distributed and federated scientific applications. The rapid increase in demand for AI tools (e.g., ChatGPT, LaMDA, etc.) has promoted scalable deep learning to a core challenge for HPC. Pauloski has made advancements in system software and algorithms to efficiently use novel hardware systems for AI applications. He has also worked on the development of federated applications which span heterogeneous systems composed of specialized accelerators, edge devices, cloud compute, and HPC. Pauloski’s work on data fabrics enables autonomous actors to communicate efficiently and reliably, independent of location.</p> <p>In addition to his technical contributions, Pauloski’s colleagues have cited his work as a role model and mentor for younger students.</p> <p><strong>Rohan Basu Roy</strong></p> <p>Roy designs new tools and methods for enhancing HPC programmer productivity and making large-scale computing systems more cost-effective and environmentally sustainable.</p> <p>The key challenges computational scientists face include the time required to performance-tune their code and the time required to efficiently provision and utilize computing resources. To address these challenges, Roy has designed HPC performance auto-tuner tools to significantly improve the program productivity. Roy’s research contributions include the first demonstration of significant productivity and performance advantages of the serverless computing model for complex scientific workflows, including quick elasticity in the cloud (eliminating the long queue wait time), ease of use, and opportunistic co-location for better resource utilization.</p> <p>Opportunistic co-location of workloads in the cloud reduces the carbon footprint of on-premise HPC cluster/supercomputer -- Roy continues to aim toward improving the environmental sustainability of HPC systems as their carbon footprint is increasing rapidly.</p> <p><strong>Hua Huang</strong></p> <p>Huang has focused on developing new algorithms and implementations for high-performance matrix computations. His research problems have mostly come from the area of quantum chemistry and electronic structure calculations. Huang’s innovations have been integrated into widely used codes such as Psi4, NWChem, and SPARC, as well as a proxy application, GTFock, from Georgia Tech.</p> <p>His many contributions include developing a high-performance, multi-purpose, rank-structured matrix library for multiple scientific computing tasks, designing innovative parallel algorithms for large-scale matrix operations, etc. He also introduced new optimization strategies for constructing the Fock and density matrices in quantum chemistry calculations.</p> <p><strong>About the ACM IEEE CS George Michael Memorial Fellowship</strong></p> <p><a href="https://awards.acm.org/hpc-fellows">The ACM-IEEE CS George Michael Memorial HPC Fellowship</a>is endowed in memory of George Michael, one of the founders of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage, or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend the <a href="https://supercomputing.org/">SC conference</a>, where the Fellowships are formally presented.</p> <p> </p></div> </div> <div class="awards-winners__related-content"> <h3> Marcin Copik and Masado Alexander Recipients of 2022 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><strong>New York, NY, October 19, 2022</strong> – ACM, the Association for Computing Machinery, and the IEEE Computer Society announced today that <a href="https://awards.acm.org/award_winners/Copik_0675555">Marcin Copik</a> of ETH Zurich of ETH Zurich and <a href="https://awards.acm.org/award_winners/Ishii_8844894">Masado Alexander Ishii</a> of the University of Utah are the recipients of the <a href="https://awards.acm.org/hpc-fellows"> 2022 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. <a href="https://awards.acm.org/award_winners/Lockhart_3395802">Shelby Lockhart</a> of the University of Illinois at Urbana-Champaign received an Honorable Mention. </p> <p><strong>Marcin Copik </strong><br /> Copik’s research bridges the gap between high-performance programming and serverless computing. He is bringing the Function-as-a-Service (FaaS) programming model into the HPC domain by developing high-performance software and hardware solutions for the serverless stack. By solving the fundamental performance challenges of FaaS, he is building a fast, efficient programming model that brings innovative cloud techniques into HPC data centers, allowing users to benefit from pay-as-you-go billing and helping operators to decrease running costs and their environmental impact.To that end, he has been working on tailored solutions for different levels of the FaaS computing stack, from computing and network devices up to high-level optimizations and efficient system designs. He has also proposed a new design for serverless platforms that applies HPC practices such as low-latency networking, data locality, and efficient communication.</p> <p><strong>Masado Alexander Ishii</strong><br /> Ishii is the main developer for the University of Utah’s Dendro-KT framework for four-dimensional adaptivity and parallel in time formulations. Given the ever-increasing levels of parallelism in the largest machines, parallelizing across space is not sufficient—and in many cases the inability to parallelize in time is the biggest bottleneck for several important problems. The Dendro-KT framework addresses this problem and also enables the development of high-orders and variable order in time formulation (similar to p-refinement). Working with collaborators, Ishii has also been involved in developing methods and codes for large-scale fluid simulations around complex objects, including a case with multiple complex objects, to evaluate COVID-19 transmission risk in classrooms.</p> <p><strong>Shelby Lockhart</strong><br /> Lockhart has made contributions in parallel communication, core parallel numerical algorithms, and advancing capabilities of large-scale predictive simulation. Her focus has been on modeling performance in heterogeneous settings, with an eye on redesigning the message communication “under-the-hood” (aspects of the high-performance architecture that are not readily visible) as well as looking at fundamental algorithmic changes in order to significantly improve achievable performance. Among her research highlights, she has provided detailed communication models to drive the selection of message routing, yielding impressive improvements across a range of problem types. She has also presented a strategy for achieving impressive reductions in communication costs in graphic processing unit (GPU) systems by communication through the host, accounting for different data volumes and GPU counts. Additionally, Lockhart’s thesis work on fixed point solvers has made important contributions to the Suite of Nonlinear and Differential/Algebraic Equation Solvers (SUNDIALS) project.</p> <p>The ACM-IEEE CS George Michael Memorial HPC Fellowship is endowed in memory of George Michael, one of the founders of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage, or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend the <a href="https://supercomputing.org">SC conference</a>, where the Fellowships are formally presented.</p></div> </div> <div class="awards-winners__related-content"> <h3> 2021 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award_winners/hidayetoglu_3419436">Mert Hidayetoglu</a> of the University of Illinois at Urbana-Champaign and <a href="/award_winners/patel_8561554">Tirthak Patel</a> of Northeastern University are the recipients of the <a href="https://awards.acm.org/hpc-fellows">2021 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. Hidayetoglu is recognized for contributions in scalable sparse applications using fast algorithms and hierarchical communication on supercomputers with multi-GPU nodes. Patel is recognized for contributions toward making the current error-prone quantum computing systems more usable and helping HPC programmers solve computationally challenging problems.</p> <p><strong>Mert Hidayetoglu</strong><br /> Sparse operations are the main computational workload for numerous scientific, AI and graph analytics applications. Most of the time, the costs of computation and communication for distributed sparse operations constitute an overall performance bottleneck.</p> <p>Hidayetoglu’s research investigates this bottleneck at two specific points: memory accesses and communication. He has proposed and demonstrated two novel techniques: sparse matrix tiling and hierarchical communications. The first technique, sparse matrix tiling, accelerates sparse matrix multiplication on a single GPU by the preprocessing of sparse data access patterns and constructs necessary data structures accordingly. The second technique, hierarchical communications, eliminates the communication bottleneck , which typically dominates end-to-end execution time when large problems at terabyte (TB) scale fit on only hundreds of GPUs. Hidayetoglu’s technique performs sparse communications (depending on the sparsity pattern of the matrix) locally-first to reduce the costly data communication across nodes.</p> <p>Hidayetoglu has successfully demonstrated these techniques in award-winning applications, including large-scale X-ray imaging at Argonne National Laboratory and accelerated sparse deep neural network inference at IBM. Related papers at SC20 and HPEC20 won the best paper award and the Sparse Challenge championship title, respectively.</p> <p><strong>Tirthak Patel</strong><br /> Patel's research addresses the challenge of erroneous program executions on quantum computers and provides robust solutions to improve their reliability. Despite rapid progress in quantum computing, prohibitively high noise on existing near-term intermediate-scale quantum (NISQ) computers remains a fundamental roadblock in the wider adoption of quantum computing. Due to the high noise, program executions on existing quantum computers produce erroneous program outputs. Quantum computing programmers largely lack the tools to estimate the correct output from these noisy program executions.</p> <p>Patel, advised by Devesh Tiwari at Northeastern University, is designing cross-layer system software for extracting meaningful output from erroneous executions on quantum computers. In particular, he first led the effort to benchmark and characterize the performance of different quantum algorithms on IBM quantum computers. Patel leveraged insights gained from this measurement-based experimental effort to inform the design of his novel tools and methods, including VERITAS, QRAFT, UREQA, and DisQ.</p> <p>For example, his technique VERITAS demonstrates how carefully-designed statistical methods can mitigate errors post-program execution and help programmers deduce the correct program output effectively. Patel's other solution, QRAFT, leverages the reversibility property of quantum operations to deduce the correct program output, even when the program is executed on qubits with relatively high error rates. Both approaches relieve programmers and compilers from the burden of selecting the qubits with the least error rate, a significant departure from existing approaches in this area. Patel's work lowers the barrier to entry into quantum computing for HPC programmers by open-sourcing multiple novel datasets and system software frameworks.</p></div> </div> <div class="awards-winners__related-content"> <h3> 2020 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award_winners/cheshmi_7648822">Kazem Cheshmi</a> of the University of Toronto, <a href="/award_winners/vardhan_2682145">Madhurima Vardhan</a> Duke University, and <a href="/award_winners/zhou_9901476">Keren Zhou</a> of Rice University are the recipients of the <a href="https://awards.acm.org/hpc-fellows">2020 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. Cheshmi is recognized for his work building a Sympiler that automatically generates efficient parallel code for sparse scientific applications on supercomputers. Vardhan is recognized for her work developing a memory-light massively parallel computational fluid dynamic algorithm using routine clinical data to enable high-fidelity simulations at ultrahigh resolutions. Zhou is recognized for his work developing performance tools for GPU-accelerated applications. The Fellowships are jointly presented by ACM and the IEEE Computer Society.</p> <p><strong>Kazem Cheshmi</strong><br /> In mathematics, a matrix is a grid (represented in a table of rows and columns) that is used to store, track and manipulate various kinds of data. In computer science, matrices are especially used in graphics, where an image is represented as a matrix in which each datapoint on the matrix table would directly correspond to the color and/or intensity of a given pixel. Matrix computations have a wide range of practical uses. For example, a 3D graphics programmer would hold all the datapoints related to an image as elements of the matrix and might make matrix computations to cause the image to rotate or scale. Matrix computations also play an essential role in computer vision, a branch of AI in which a computer learns to identify an image.</p> <p>Historically, mathematicians would develop algorithms for matrix computations, and software engineers would write programs to make the algorithms run on powerful parallel computers. However, the emergence of massive datasets has meant that traditional approaches to matrix computation are often inadequate for the enormous matrices, requiring complex algorithms that are increasingly used today in areas such as data analytics, machine learning, and high performance computing.</p> <p>To address this problem, Cheshmi has developed Sympiler, a domain-specific compiler (a program that translates the source code from a programming language to a code the computer can understand). Cheshmi’s Sympiler generates high performance codes for sparse numerical methods and can process complex matrix computations derived from massive datasets. Sympiler is extended to nonlinear optimization algorithms and performs faster than existing nonlinear optimization tools and is scalable to some of the most powerful high performance computers. Cheshmi’s work was also accepted to <a href="https://s2020.siggraph.org" target="_blank">SIGGRAPH 2020</a>, where he demonstrated how he is using Sympiler in robotics and graphics applications.</p> <p><strong>Madhurima Vardhan</strong><br /> Despite recent advances, cardiovascular disease (CVD) remains the leading cause of deaths worldwide. In the field of high performance computing, some researchers develop algorithms that are processed on powerful supercomputers to create visual simulations of complex biological processes. These simulations can be useful tools to help researchers better understand how to treat disease. Currently, a form of simulation called a computational fluid dynamic (CFD) simulation is used in health clinics to provide noninvasive diagnosis of CVDs.</p> <p>However, existing state-of-the-art CFD simulations do not provide high-fidelity real-time diagnosis of CVDs. These limitations stem from a variety of factors, including problems with model accuracy based on the patient images that comprise the datasets; the extensive memory requirements of these kinds of simulations; the long runtimes on high performance computers that are required for these kinds of simulations; and teaching physicians how to effectively use these simulations.</p> <p>To address these problems, Vardhan is developing a new kind CFD algorithm using routine patient image datasets that can develop high-fidelity simulations at ultra-high resolutions. Her algorithm is memory-light (that is, using less memory than existing algorithms), and massively parallel (proven to scale on supercomputers). As part of her PhD work, she also completed a study to determine how physicians interact with simulation data, and how physician behavior might be modified in treatment planning.</p> <p><strong>Keren Zhou</strong><br /> In the last 10 years, graphics processing units (GPUs) have become a critical component in high performance computing systems. For example, five of the top 10 supercomputers in the world today use GPUs to accelerate the performance of applications in various domains. These systems must be designed to avoid common GPU performance problems, and identifying specific performance problems can be challenging.</p> <p>Working with his advisor John Mellor-Crummey and others, Zhou has taken the lead in developing performance tools for GPU-accelerated supercomputing to help programmers detect program inefficiencies and provide optimization advice.</p> <p>Their work has already been well received in academia and industry. Zhou and his colleagues have published three papers in top-tier conference proceedings. They are also collaborating with GPU vendors, including AMD, Intel, and NVIDIA; they have submitted a collection of bug reports and offered advice about how to improve their GPU hardware and software measurement interfaces.</p> <p><strong>About the ACM-IEEE CS George Michael Memorial HPC Fellowship</strong><br /> The ACM-IEEE CS George Michael Memorial HPC Fellowship is endowed in memory of George Michael, one of the founding fathers of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and is presented at <a href="https://sc20.supercomputing.org/">SC20</a>, which is being held virtually this year.</p> <p> </p></div> </div> <div class="awards-winners__related-content"> <h3> 2019 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award_winners/fernando_6319723">Milinda Shayamal Fernando</a> of the University of Utah and <a href="/award_winners/smith_1466537">Staci A. Smith</a> of the University of Arizona are the recipients of the <a href="https://awards.acm.org/hpc-fellows">2019 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. Fernando is recognized for his work on high performance algorithms for applications in relativity, geosciences and computational fluid dynamics (CFD). Smith is recognized for her work developing a novel dynamic rerouting algorithm on fat-tree interconnects. The Fellowships are jointly presented by ACM and the IEEE Computer Society.</p> <p><strong>Milinda Fernando</strong><br /> New discoveries in science and engineering are partially driven by simulations on high performance computers―especially when physical experiments would be unfeasible or impossible. Fernando’s research is focused on developing algorithms and computational codes that enable the effective use of modern supercomputers by scientists working in many disciplines</p> <p>His key objectives include: making making computer simulations on high performance computers easy to use (by using symbolic interfaces and autonomous code generation); portable (so they can be run across different computer architectures); high-performing (because they make efficient use of computing resources); and scalable (so that they can solve larger problems on next next-generation machines).</p> <p>Fernando’s work has enabled improved applications in areas of computational relativity and gravitational wave (GW) astronomy. In the universe, when two supermassive black holes merge, they bring along corresponding clouds of stars, gas and dark matter. Modeling these events requires powerful computational tools that consider all the physical effects of such a merger. While recent algorithms and codes to develop simulations of black hole mergers have been developed, they were limited because they could only handle simulations when the masses of the two black holes were comparable. Fernando developed algorithms and code for mergers of black holes, or neutron stars, of vastly different mass ratios. These computational simulations help scientists understand the early universe as well as what is going on at the heart of galaxies.</p> <p><strong>Staci Smith</strong><br /> A general problem in high performance computing occurs when multiple distinct jobs running on supercomputers send messages at the same time, and these messages interfere with each other. This inter-job interference can significantly degrade a computer’s performance.</p> <p>Smith’s first research paper in this area, “Mitigating Inter-Job Interference Using Adaptive Flow-Aware Routing,” received a Best Student Paper nomination at SC18, the premiere supercomputing conference. Her paper had two goals: to explore the causes of network interference between jobs (in order to model that interference); and to develop a mitigation strategy to alleviate the interference.</p> <p>As a result of this work, Smith recently developed a new routing algorithm for fat-tree interconnects called Adaptive Flow-Aware Routing (AFAR), which improves execution time up to 46% when compared to other default routing algorithms. As part of her ongoing PhD research, she continues to develop algorithms to improve the performance and efficiency of HPC workloads.</p> <p><strong>About the ACM-IEEE CS George Michael Memorial HPC Fellowship</strong><br /> The ACM-IEEE CS George Michael Memorial HPC Fellowship is endowed in memory of George Michael, one of the founding fathers of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend <a href="https://sc19.supercomputing.org/">SC19</a> in Denver, Colorado, November 17-22, 2019, where the Fellowships will be formally presented.</p> <p> </p></div> </div> <div class="awards-winners__related-content"> <h3> 2018 ACM-IEEE CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award_winners/gesenhues_7632114" target="_blank">Linda Gesenhues</a> (Federal University of Rio de Janeiro) and <a href="/award_winners/hohnerbach_4790118" target="_blank">Markus Höhnerbach</a> (RWTH Aachen University) are the recipients of the <a href="https://awards.acm.org/hpcfell" target="_blank">2018 ACM-IEEE CS George Michael Memorial HPC Fellowships</a>. Gesenhues is being recognized for her work on finite element simulation of turbidity currents with an emphasis on non-Newtonian fluids. Höhnerbach is being recognized for his work on portable optimizations of complex molecular dynamics codes. The Fellowships are jointly presented by ACM and the IEEE Computer Society.</p> <p>Gesenhues’ work on turbidity currents may be a useful tool for scientists studying underwater volcanoes, earthquakes or other geological phenomena occurring on the sea floor. Fluids, including water, become turbid when the concentration of particles, such as sediment, rises to a particular threshold. Because of their density, turbid fluids move differently than non-turbid fluids—frequently cascading downward as they are impacted by gravity. The presence of turbid currents can indicate that mud and sand have been loosened from collapsing slopes, earthquakes, or other phenomena. For these reasons, scientists regularly place turbidity sensors on the sea floor to monitor geologic activity.</p> <p>A challenge of understanding turbidity currents is cataloging the range of possible movements a fluid may make based on the variables in its surrounding environment. For this reason, employing supercomputers, which can process trillions of possible permutations, is an effective approach. The objective of Gesenhues’ PhD project is to obtain a model for numerical simulation of turbidity currents that can predict the characteristics of such flows using non-Newtonian fluid behavior. Non-Newtonian fluids have a higher resistance to deformation than Newtonian fluids; for example, shampoo (a non-Newtonian fluid) loses its shape more slowly than water (a Newtonian fluid).</p> <p>Thus far, Gesenhues has developed a “solver” (a numerical model) for a 2D simulation of turbidity currents that has been implemented, established and verified. Recently, she augmented her 2D solver to a 3D model. Here, first tests on small 3D benchmark applications were made, including a column collapse.</p> <p>Markus Höhnerbach’s research focuses on creating simulations for many-body potentials in molecular dynamics (MD) simulations. MD simulations are an indispensable research tool in computational chemistry, biology and materials science. In an MD simulation, individual atoms are moved time-step by time-step according to the forces derived from so-called potential, which is the mathematical law that governs the interactions between atoms. The general idea of Höhnerbach’s PhD project is to develop methods and tools to make the implementation of MD simulations simple and correct by design while generating fast code for a multiple of platforms. For example, in his paper, “The Vectorization of the Tersoff Multi-Body Potential: An Exercise in Performance Portability,” he demonstrated the performance of a type of MD simulations in a wide variety of platforms and processors.</p> <p>Recently, Höhnerbach has been working with MD simulations for the adaptive intermolecular reactive bond order (AIREBO) potential, which is frequently used to study carbon nanotubes. Many believe carbon nanotubes hold great potential for the future of computer architecture. Höhnerbach wrote a code for the AIREBO potential that has achieved 3x to 4x speedups when performing realistic large-scale runs on current supercomputers.</p> <p>The ACM-IEEE CS George Michael Memorial HPC Fellowship is endowed in memory of George Michael, one of the founding fathers of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend <a href="https://sc18.supercomputing.org/">SC18</a> in Dallas, Texas, November 11-16, 2018, where the Fellowships will be formally presented.</p></div> </div> <div class="awards-winners__related-content"> <h3> 2017 ACM/IEEE George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award_winners/smith_0810320" target="_blank">Shaden Smith</a> (University of Minnesota) and <a href="/award_winners/you_9763281" target="_blank">Yang You</a> (University of California, Berkeley) are the recipients of the 2017 <a href="https://awards.acm.org/hpcfell" target="_blank">ACM/IEEE-CS George Michael Memorial HPC Fellowships</a>. Smith is being recognized for his work on efficient and parallel large-scale sparse tensor factorization for machine learning applications. You is being recognized for his work on designing accurate, fast, and scalable machine learning algorithms on distributed systems.</p> <p>Shaden Smith’s research is in the general area of parallel and high performance computing with a special focus on developing algorithms for sparse tensor factorization. Sparse tensor factorization facilitates the analysis of unstructured and high dimensional data.</p> <p>Smith has made several fundamental contributions that have already advanced the state of the art on sparse tensor factorization algorithms. For example, he developed serial and parallel algorithms in the area of Canonical Polyadic Decomposition (CPD) that are over five times faster than existing open source and commercial approaches. He also developed algorithms for Tucker decompositions that are up to 21 times faster and require 28 times less memory than existing algorithms. Smith’s algorithms can efficiently operate on systems containing a small number of multi-core/manycore processors to systems containing tens of thousands of cores.</p> <p>Yang You’s research interests include scalable algorithms, parallel computing, distributed systems and machine learning. As computers increasingly use more time and energy to transfer data (i.e., communicate), the invention or identification of algorithms that reduce communication within systems is becoming increasingly essential. In well-received research papers, You has made several fundamental contributions that reduce the communications between levels of a memory hierarchy or between processors over a network.</p> <p>In his most recent work, “Scaling Deep Learning on GPU and Knights Landing Clusters,” You’s goal is to scale up the speed of training neural networks so that networks which are relatively slow to train can be redesigned for high performance clusters. This approach has reduced the percentage of communication from 87% to 14% and resulted in a five-fold increase in speed.</p> <p>The ACM/IEEE-CS George Michael Memorial HPC (GMM) Fellowship is endowed in memory of George Michael, one of the founding fathers of the SC Conference series. The fellowship honors exceptional PhD students throughout the world whose research focus is on high performance computing applications, networking, storage or large-scale data analytics using the most powerful computers that are currently available. The Fellowship includes a $5,000 honorarium and travel expenses to attend <a href="http://sc17.supercomputing.org/" target="_blank">SC17</a> in Denver Colorado, November 12-17, 2017, where the GMM Fellowships will be formally presented.</p></div> </div> <div class="awards-winners__related-content"> <h3> 2016 ACM/IEEE George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><a href="/award-winners/rudi_2566052">Johann Rudi</a> of The Institute for Computational Engineering and Sciences (The University of Texas at Austin) and <a href="/award-winners/huebl_0215441">Axel Huebl</a> of Helmholtz-Zentrum Dresden-Rossendorf (Technical University of Dresden) are the recipients of the 2016<a href="/hpc-fellows"> ACM/IEEE George Michael Memorial HPC Fellowships</a>. Rudi is recognized for his work on a recent project, “Extreme-Scale Implicit Solver for Nonlinear, Multiscale, and Heterogeneous Stokes Flow in the Earth’s Mantle,” while Huebl is recognized for his work, “Scalable, Many-core Particle-in-cell Algorithms to Simulate Next Generation Particle Accelerators and Corresponding Large-scale Data Analytics.”</p> <p>Johann Rudi’s recent research has focused on modeling, analysis and development of algorithms for studying the earth’s mantle convection by means of large-scale simulations on high-performance computers. Mantle convection is the fundamental physical process within the earth’s interior responsible for the thermal and geological evolution of the planet, including plate tectonics.</p> <p>Rudi, along with colleagues from Switzerland and the United States, presented a paper on mantle convection at SC15, the International Conference for High Performance Computing, that was awarded the ACM Gordon Bell Prize. Rudi and his team developed new computational methods that are capable of processing difficult problems based on partial differential equations, such as mantle convection, with optimal algorithmic performance at extreme scales.</p> <p>Axel Huebl is a computational physicist who specializes in next-generation, laser plasma-based particle accelerators. Huebl and others reinvented the particle-in-cell algorithm to simulate plasma-physics with 3D simulations of unprecedented detail on leadership-scale many-core supercomputers such as Titan (ORNL).</p> <p>Through this line of research, Huebl also derives models to understand and predict promising regimes for applications such as radiation therapy of cancer with laser-driven ion beams. Interacting closely with experimental scientists, their simulations are showing that plasma-based particle accelerators may yield numerous scientific advances in industrial and medical applications. Huebl was part of a team that were Gordon-Bell prize finalists at SC13.</p></div> </div> <div class="awards-winners__related-content"> <h3> Two Students Named Recipients of ACM/IEEE-CS George Michael Memorial HPC Fellowships</h3> <div class="awards-winners__related-content-body"> <p><strong><a href="/award-winners/besta_8931638">Maciej Besta</a></strong>, a PhD student in the Scalable Parallel Computing Lab led by Professor Torsten Hoefler at ETH Zurich, won recognition for his project, "Accelerating Large-Scale Distributed Graph Computations." During first year as a PhD student, Besta successfully completed several projects related to various HPC subdomains, which secured Besta the first Google European Doctoral Fellowship in Parallel Computing.</p> <p>Besta's research interests focus on improving the performance of large-scale graph processing in both traditional scientific domains and in the emerging big data computations. Besta and his advisor also collaborate with researchers from the Georgia institute of Technology on designing a novel on-chip topology for future massively parallel manycore architectures that improves the performance of network traffic patterns present in graph processing workloads.</p> <p><strong><a href="/award-winners/malhotra_5867423">Dhairya Malhotra</a></strong>, a PhD student at the University of Texas at Austin actively working in the field of high performance computing, won recognition for his project, "Scalable Algorithms for Evaluating Volume Potentials." As an undergraduate intern, Malhotra was part of the group that won the 2010 ACM Gordon Bell Prize for "Petascale Direct Numerical Simulation of Blood Flow on 200K Cores and Heterogeneous Architectures," where he had implemented performance critical GPU code using CUDA.</p> <p>Malhotra's research focuses on developing fast scalable solvers for elliptic PDEs such as Poisson, Stokes and Helmholtz equations. Additionally, a significant contribution of Malhotra's research has been development of the pvfmm library (Parallel Volume Fast Multipole Method) for evaluating volume potentials efficiently.</p></div> </div> <div class="awards-winners__related-content"> <h3> Harshitha Menon, Alexander Breuer Awarded George Michael Memorial HPC Fellowships for 2014</h3> <div class="awards-winners__related-content-body"> <p>Harshitha Menon was recognized for her project "Scalable Load Balancing and Adaptive Run Time Techniques" and Alexander Breuer</a> for his project "Petascale High Order Earthquake Simulations."</p> <p><a href="https://awards.acm.org/award_winners/menon_1820686">Harshitha Menon </a>is a PhD candidate at University of Illinois Urbana-Champaign, advised by Prof. Laxmikant V. Kale. She researches on developing scalable load balancing algorithms and adaptive run time techniques to improve the performance of large scale dynamic applications. In addition, Harshitha works on optimizing performance of N-body codes, such as the cosmology simulation application ChaNGa, which is a collaborative research project between UIUC and University of Washington.</p> <p><a href="https://awards.acm.org/award_winners/breuer_5428801">Alexander Breuer </a>received his diploma in mathematics in 2011 at Technische Universität München (TUM) and is a fourth year doctoral candidate - advised by Prof. Dr. Michael Bader - at the Chair of Scientific Computing at TUM. In 2012 Alexander and his colleagues established a close collaboration between leading experts in computational science and seismology. Declared goal of this international collaboration is one of the grand challenges in seismic modeling: "Multi-physics ground motion simulation for earthquake-engineering, including the complete dynamic rupture process and 3D seismic wave propagation with frequencies resolved beyond 5 Hz".</p> <p>Alexander’s research covers optimizations in the entire simulation pipeline, which includes node-level performance leveraging SIMD-paradigms, hybrid and heterogeneous parallelization up to machine-size and co-design of numerics and large-scale optimizations. In 2014 Alexander and his collaborators have been awarded with the PRACE ISC Award and received an ACM Gordon Bell nomination for their outstanding end-to-end performance reengineering of the SeisSol software package.</p></div> </div> </div> </div> </div> <div class="columns large-4 medium-4 small-12 zone-3"> <div> <div> <div class="articles single-cta"> <div class="two-col-alt article-block"> <div class="row" data-equalizer=""> <div class="large-12 medium-12 small-12 columns"> <div class="cta shadowed " data-equalizer-watch=""> <div class="row" style="margin: inherit;"> <div class="medium-12 columns d-table top-cta"> <div class="text-wrap"> <span class="article-category">Awards & Recognition</span> <h2 class="text-left"><a href='https://awards.acm.org/hpc-fellows' target='_blank'>ACM Announces 2024 ACM-IEEE CS George Michael Memorial HPC Fellowship Recipients</a></h2> <div class="dek"> <p><a href="https://awards.acm.org/award-recipients/fan_1600404" target="_blank"><strong>Ke Fan</strong></a> of the University of Illinois at Chicago and <a href="https://awards.acm.org/award-recipients/nichols_7206136" target="_blank"><strong>Daniel Nichols</strong></a> of the University of Maryland are the <a href="https://awards.acm.org/hpc-fellows" target="_blank">2024 ACM-IEEE CS George Michael Memorial HPC Fellowship</a> recipients.The George Michael Memorial Fellowship honors exceptional PhD students throughout the world whose research focus is high-performance computing (HPC) applications, networking, storage, or large-scale data analytics. The Fellowships will be formally presented at the <a href="https://sc24.supercomputing.org" target="_blank">International Conference for High Performance Computing, Networking, Storage, and Analysis</a> (SC24) in November.</p></div> </div> <a href='https://awards.acm.org/hpc-fellows' target='_blank'><img src="/binaries/ctaimagelarge/content/gallery/acm/ctas/awards/gmm-hpc-fellowships-2024.jpg" alt="IEEE CS George Michael Memorial HPC Fellowships Recipients Ke Fan and Daniel Nichols" /></a></div> </div> </div></div> </div> </div> </div> </div> <div> <div class="articles single-cta"> <div class="two-col-alt article-block"> <div class="row" data-equalizer=""> <div class="large-12 medium-12 small-12 columns"> <div class="cta shadowed " data-equalizer-watch=""> <div class="row" style="margin: inherit;"> <div class="medium-12 columns d-table top-cta"> <div class="text-wrap"> <h2 class="text-left"></h2> <div class="dek"> <div> <div class="panel awards-navigation"> <h2 class="sidebar-header"><a href="/list-of-awards">Full List of ACM Awards</a></h2> </div> </div></div> </div> </div> </div> </div></div> </div> </div> </div> </div> <div> <div class="panel awards-navigation"> <h2 class="sidebar-header">ACM Awards by Category</h2> <div class="data-list"> <dl class="awards-navigation__accordion accordion" data-accordion> <dd class="accordion-navigation"> <a href="#awards_96_0" class="awards-navigation__link"> <h3>Career-Long Contributions</h3> </a> <div id="awards_96_0" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/turing">ACM A.M. Turing Award</a> <hr> <a class="awards-navigation__link" href="/distinguished-service">ACM Distinguished Service Award</a> <hr> <a class="awards-navigation__link" href="/fellows">ACM Fellows</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_96_1" class="awards-navigation__link"> <h3>Early-to-Mid-Career Contributions</h3> </a> <div id="awards_96_1" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/hopper">ACM Grace Murray Hopper Award</a> <hr> <a class="awards-navigation__link" href="/acm-prize">ACM Prize in Computing</a> <hr> <a class="awards-navigation__link" href="/distinguished-members">ACM Distinguished Member</a> <hr> <a class="awards-navigation__link" href="/senior-members">ACM Senior Member</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_96_2" class="awards-navigation__link"> <h3>Specific Types of Contributions</h3> </a> <div id="awards_96_2" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/thacker">ACM Charles P. "Chuck" Thacker Breakthrough in Computing Award</a> <hr> <a class="awards-navigation__link" href="/lawler">ACM Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics</a> <hr> <a class="awards-navigation__link" href="/allen">ACM Frances E. Allen Award for Outstanding Mentoring</a> <hr> <a class="awards-navigation__link" href="/bell">ACM Gordon Bell Prize</a> <hr> <a class="awards-navigation__link" href="/bell-climate">ACM Gordon Bell Prize for Climate Modeling</a> <hr> <a class="awards-navigation__link" href="/barroso">ACM Luiz André Barroso Award</a> <hr> <a class="awards-navigation__link" href="/karlstrom">ACM Karl V. Karlstrom Outstanding Educator Award</a> <hr> <a class="awards-navigation__link" href="/kanellakis">ACM Paris Kanellakis Theory and Practice Award</a> <hr> <a class="awards-navigation__link" href="/policy">ACM Policy Award</a> <hr> <a class="awards-navigation__link" href="/president">ACM Presidential Award</a> <hr> <a class="awards-navigation__link" href="/software-system">ACM Software System Award</a> <hr> <a class="awards-navigation__link" href="/athena">ACM Athena Lecturer Award</a> <hr> <a class="awards-navigation__link" href="/newell">ACM AAAI Allen Newell Award</a> <hr> <a class="awards-navigation__link" href="/eckert-mauchly">ACM-IEEE CS Eckert-Mauchly Award</a> <hr> <a class="awards-navigation__link" href="/kennedy">ACM-IEEE CS Ken Kennedy Award</a> <hr> <a class="awards-navigation__link" href="/outstanding-contribution">Outstanding Contribution to ACM Award</a> <hr> <a class="awards-navigation__link" href="/computational-science">SIAM/ACM Prize in Computational Science and Engineering</a> <hr> <a class="awards-navigation__link" href="/programming-systems-and-languages-paper">ACM Programming Systems and Languages Paper Award</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_96_3" class="awards-navigation__link"> <h3>Student Contributions</h3> </a> <div id="awards_96_3" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/doctoral-dissertation">ACM Doctoral Dissertation Award</a> <hr> <a class="awards-navigation__link" href="/hpc-fellows">ACM-IEEE CS George Michael Memorial HPC Fellowships</a> <hr> <a class="awards-navigation__link" href="/cutler-bell">ACM/CSTA Cutler-Bell Prize in High School Computing</a> <hr> <a class="awards-navigation__link" href="/international-science-and-engineering-fair">International Science and Engineering Fair</a> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_96_4" class="awards-navigation__link"> <h3>Regional Awards</h3> </a> <div id="awards_96_4" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/india-doctoral-dissertation">ACM India Doctoral Dissertation Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-ecr">ACM India Early Career Researcher Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-occw">ACM India Outstanding Contributions in Computing by a Woman Award</a> <hr> <a class="awards-navigation__link" href="/acm-india-occe">ACM India Outstanding Contribution to Computing Education Award</a> <hr> <a class="awards-navigation__link" href="/ipsj-acm-global">IPSJ/ACM Award for Early Career Contributions to Global Research</a> <hr> <a class="awards-navigation__link" href="/ccf-acm-ai">CCF-ACM Award for Artificial Intelligence</a> </div> </dd> <dd class="accordion-navigation"> <a href="/sig-awards" class="awards-navigation__link--title awards-navigation__link state-disabled"> <h3>SIG Awards</h3> </a> <div id="awards_96_5" class="awards-navigation__content content"> </div> </dd> <dd class="accordion-navigation"> <a href="#awards_96_6" class="awards-navigation__link"> <h3>How Awards Are Proposed</h3> </a> <div id="awards_96_6" class="awards-navigation__content content"> <a class="awards-navigation__link" href="/guides">Establishing an ACM Award</a> <hr> <a class="awards-navigation__link" href="https://www.acm.org/publications/policies/guidelines-best-paper-award">Establishing a Best Paper Award for ACM Periodicals</a> </div> </dd> </dl> </div> </div> </div> </div> </div> </div> <div class="row"> <div class="columns small-12 zone-4"> <div> </div> </div> </div> </article> </div> </div> <div class="row"> <footer> <nav> <div class="footer-nav"> <ul class="footer-nav-lists"> <li> About ACM</li> <li><a href="https://www.acm.org/about-acm" title="About ACM">About ACM</a></li> <li><a href="https://www.acm.org/about-acm/get-involved" title="About ACM">Volunteer</a></li> </ul> <ul class="footer-nav-lists"> <li> Membership</li> <li><a href="https://www.acm.org/membership/join-acm" title="Membership">Join ACM</a></li> <li><a href="https://www.acm.org/membership/acm-membership-renewal" title="Membership">Renew My Membership</a></li> <li><a href="https://www.acm.org/membership/membership-options" title="Membership">Membership Options</a></li> <li><a href="https://www.acm.org/membership/membership-benefits" title="Membership">Membership Benefits</a></li> <li><a href="https://www.acm.org/membership/myacm-at-a-glance" title="Membership">MyACM Sign In</a></li> </ul> <ul class="footer-nav-lists"> <li> Publications</li> <li><a href="https://www.acm.org/publications/about-publications" title="Publications">About Publications</a></li> <li><a href="https://www.acm.org/publications/digital-library" title="Publications">Digital Library</a></li> <li><a href="https://dl.acm.org/pubs.cfm" title="Publications">Submit a Paper</a></li> </ul> <ul class="footer-nav-lists"> <li> Chapters</li> <li><a href="https://www.acm.org/chapters/chapter-administrative-interface" title="Chapters">Chapter Admin Interface</a></li> <li><a href="https://www.acm.org/chapters/local-activities" title="Chapters">Chapter Activities Calendar</a></li> <li><a href="https://www.acm.org/chapters/start-chapter" title="Chapters">Start a Chapter</a></li> </ul> <ul class="footer-nav-lists"> <li> Awards</li> <li><a href="/about" title="Awards">About ACM's Awards</a></li> </ul> <ul class="footer-nav-lists"> <li> Conferences</li> <li><a href="https://www.acm.org/conferences" title="Conferences">ACM's Conferences</a></li> </ul> <ul class="footer-nav-lists"> <li> Code of Ethics</li> <li><a href="https://www.acm.org/code-of-ethics" title="Code of Ethics">ACM's Code of Ethics</a></li> <li><a href="https://www.acm.org/code-of-ethics/enforcement-procedures" title="Code of Ethics">Enforcement Procedures</a></li> </ul> <ul class="footer-nav-lists"> <li> Media Center</li> <li><a href="https://www.acm.org/media-center" title="Media Center">ACM Media Center</a></li> </ul> </div> </nav> <div> <div> <div class="logo_social_group"> <hr /> <img src='/binaries/content/gallery/acm/logos/logo_footer_acm.png' alt='ACM Logo' /> <ul class="footer__social"> <li> <a href="https://www.facebook.com/AssociationForComputingMachinery/" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_facebook.png" alt="Facebook logo" /> </a> </li> <li> <a href="https://twitter.com/theofficialacm" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_x_twitter.png" alt="Twitter logo" /> </a> </li> <li> <a href="https://www.linkedin.com/company/association-for-computing-machinery" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_linkedin.png" alt="LinkedIn logo" /> </a> </li> <li> <a href="https://www.reddit.com/user/TheOfficialACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_reddit.png" alt="Reddit" /> </a> </li> <li> <a href="https://www.youtube.com/user/TheOfficialACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_youtube.png" alt="YouTube logo" /> </a> </li> <li> <a href="https://www.instagram.com/theofficialacm/" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_instagram.png" alt="Instagram" /> </a> </li> <li> <a href="https://www.flickr.com/photos/theofficialacm" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_flickr.png" alt="Flickr" /> </a> </li> <li> <a href="https://mastodon.acm.org/@ACM" target="_blank"> <img src="/binaries/content/gallery/acm/social-media/icon_mastodon.png" alt="Mastodon" /> </a> </li> </ul> </div> </div> </div> <div> <div> <ul class="footer__legal clearfix"> <li><a href="/">Home</a></li> <li><a href="/sitemap">Sitemap</a></li> <li><a href="https://www.acm.org/about-acm/contact-us">Contact Us</a></li> <li><a href="https://www.acm.org/membership/acm-hq-contact">Member Service</a></li> <li><a href="https://www.acm.org/about-acm/privacy-policy">Privacy Policy</a></li> <li><a href="https://www.acm.org/accessibility">Accessibility</a></li> <li><a href="https://www.acm.org/cookie-declaration">Cookie Declaration</a></li> <li class="footer__copyright">Copyright © 2024, ACM, Inc</li> </ul> </div> </div> </footer> </div> <!-- Scripts --> <script data-cookieconsent="ignore" type="text/javascript" src="/js/acm.js?antiCache=1716999351349"></script> <script>$(document).foundation();</script> <script type="text/javascript" src="//s7.addthis.com/js/300/addthis_widget.js#pubid=ra-5654b74db1437702" async="async"></script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-CM2RT513Q1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){ dataLayer.push(arguments); } gtag('js', new Date()); gtag('config', 'G-CM2RT513Q1'); </script> </body> </html>