{"id":7741,"date":"2019-08-09T14:05:32","date_gmt":"2019-08-09T21:05:32","guid":{"rendered":"https:\/\/www.hmc.edu\/about-hmc\/?p=7741"},"modified":"2019-08-09T14:05:32","modified_gmt":"2019-08-09T21:05:32","slug":"nsf-supports-computer-science-research","status":"publish","type":"post","link":"https:\/\/www.hmc.edu\/about\/2019\/08\/09\/nsf-supports-computer-science-research\/","title":{"rendered":"NSF Supports Computer Science Research"},"content":{"rendered":"<p>Researchers in many fields share a common problem: Searching giant parameter spaces is incredibly time consuming and inefficient. To help remedy this issue, the National Science Foundation has funded \u201cCNS Core: III: Medium: Collaborative Research: Optimizing and Understanding Large Parameter Spaces in Storage Systems,\u201d a project developed by computer science professor Geoff Kuenning and his Stony Brook University colleagues, computer science professors Klaus Mueller and Erez Zadok.<\/p>\n<p>\u201cA\u00a0parameter space is a mathematical concept referring to the total\u00a0number of choices available,\u201d Kuenning says.\u00a0\u201cFor example, if I have 10 shirts\u00a0and 10 pairs of pants, I have 10&#215;10 = 100 different outfits\u00a0because each pair of pants can be worn with 10 different shirts.\u00a0That&#8217;s great for wardrobe variety and for packing light, but\u00a0terrible if you&#8217;re trying to find the best shirt\/pants combination\u00a0by trial and error.\u00a0If you add 10 pairs of socks, 10 belts and\u00a010 hats, you&#8217;re up to 100,000 outfits generated by only 50 pieces\u00a0of clothing.\u00a0That&#8217;s a parameter space, which is what we&#8217;re trying\u00a0to search\u2014preferably not by trying on all 100,000 outfits!\u201d<\/p>\n<p>The team will test a combination of enhanced black box-optimization methods, machine learning and visual analytics on information systems from cloud data centers to smartphones to embedded systems, such as wireless routers.<\/p>\n<p>\u201cWe\u2019re figuring out ways to optimize existing software,\u201d says Kuenning. \u201cIn any storage system, the software has what we call knobs, parameters that the user can set in a search. Each system has many, many parameters that interact with each other in complicated ways, so trying to pick the best setting of all of these parameters to get the best performance for a specific situation is an overwhelming task.\u201d<\/p>\n<p>Beyond improving storage systems, a significant improvement to the performance of storage systems worldwide will save energy costs and benefit the environment. The project\u2019s comprehensive research agenda has the potential to make such optimization significantly simpler and far more effective, which can bring direct benefits to consumers, businesses and the U.S. government. \u201cAlthough our focus here is on storage systems, we expect that many of the lessons learned and some of the tools and techniques would apply to other domains, for example, optimizing networks or data centers,\u201d Kuenning says.<\/p>\n<p>In 2017, Kuenning\u2019s NSF-funded project \u201cCollaborative Research: CI-SUSTAIN: National File System Trace Repository,\u201d addressed a longstanding problem in the study of computer systems: the difficulty of providing workloads to drive the system being studied. Kuenning successfully developed and deployed the Storage Networking Industry Association\u2019s I\/O Tools, Traces and Analysis (IOTTA), a national repository for file system traces. The repository has proven its worth to the scientific community and is being used by researchers in a wide variety of projects. Initially, the life of the repository was expected to be only a few years, but its utility and popularity suggest that it will be needed for at least another decade, and possibly far longer.<\/p>\n<p>Kuenning\u2019s share of the current grant is $264,875 and includes support for two student researchers per year for four years. NSF grants are the largest share of external support for faculty research at Harvey Mudd College.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Researchers in many fields share a common problem: Searching giant parameter spaces is incredibly time consuming and inefficient. To help [&hellip;]<\/p>\n","protected":false},"author":145,"featured_media":7743,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[11,14,213,30],"class_list":["post-7741","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-computer-science","category-faculty","category-grant","category-students"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/posts\/7741","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/users\/145"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/comments?post=7741"}],"version-history":[{"count":0,"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/posts\/7741\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/media\/7743"}],"wp:attachment":[{"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/media?parent=7741"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hmc.edu\/about\/wp-json\/wp\/v2\/categories?post=7741"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}