{"382391":{"#nid":"382391","#data":{"type":"event","title":"CSE Faculty Candidate Seminar - Grey Ballard - Reducing Computation and Communication in Scientific Computing","body":[{"value":"\u003Cp class=\u0022p1\u0022\u003E\u003Cstrong\u003ETitle:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003EReducing Computation and Communication in Scientific Computing\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003EBecause of the availability of increasingly powerful computers, computational science is playing a significant role in the analysis of complex systems across disciplines, from simulations of climate change to social network analysis.\u0026nbsp; While the applications are wide-ranging, solutions to these problems share many mathematical and computational techniques in common. In this talk I\u2019ll focus on numerical linear algebra, one of the key tools in this field, and I\u2019ll discuss recent innovations in developing faster algorithms for fundamental matrix computations that maintain the numerical accuracy of the results.\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003EOn today\u2019s computers, the running time of an algorithm depends not only on the number of operations it performs, but also on its communication requirements (i.e., how much data it moves up and down the memory hierarchy and between processors).\u0026nbsp;\u0026nbsp; I\u2019ll demonstrate that by reformulating standard approaches and reducing communication costs, we can improve the efficiency of many matrix computations, including algorithms for solving linear systems, least squares problems, eigenvalue problems, and parallelization of Strassen\u0027s matrix multiplication algorithm.\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003EI\u2019ll also talk about the prospects of using computer-aided search to discover new algorithms for matrix multiplication that perform asymptotically fewer operations (and require less data movement) than Strassen\u2019s algorithm, as well as some other future directions for this research.\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u003Cstrong\u003EBio:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003EGrey Ballard is currently a Truman Fellow at Sandia National Labs in Livermore, BA.\u0026nbsp; He received his Ph.D in 2013 from the Computer Science Division (EECS Department) at the University of California Berkeley.\u0026nbsp; He worked in the BeBOP group and Parallel Computing Laboratory under advisor James Demmel.\u0026nbsp; Before coming to Berkeley, he received his BS in math and computer science at Wake Forest University in 2006 and his MA in math at Wake Forest in 2008.\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003EHis research interests include numerical linear algebra, high performance computing, and computational science, particularly in developing algorithmic ideas that translate to improved implementations and more efficient software.\u0026nbsp; His work has been recognized with the SIAM Linear Algebra Prize and two conference best paper awards, at SPAA and IPDPS, he received the C.V. Ramamoorthy Distinguished Research Award at UC Berkeley, and his Ph.D thesis was recognized by the ACM Doctoral Dissertation Award \u2013 Honorable Mention. \u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p3\u0022\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"CSE Faculty Candidate Seminar - Grey Ballard - Reducing Computation and Communication in Scientific Computing"}],"uid":"28150","created_gmt":"2015-02-26 14:12:12","changed_gmt":"2017-04-13 21:19:56","author":"Birney Robert","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2015-02-27T13:00:00-05:00","event_time_end":"2015-02-27T14:00:00-05:00","event_time_end_last":"2015-02-27T14:00:00-05:00","gmt_time_start":"2015-02-27 18:00:00","gmt_time_end":"2015-02-27 19:00:00","gmt_time_end_last":"2015-02-27 19:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"hg_media":{"382401":{"id":"382401","type":"image","title":"Grey Ballard","body":null,"created":"1449246231","gmt_created":"2015-12-04 16:23:51","changed":"1475894393","gmt_changed":"2016-10-08 02:39:53","alt":"Grey Ballard","file":{"fid":"75313","name":"ballard-headshot.jpeg","image_path":"\/sites\/default\/files\/images\/ballard-headshot.jpeg","image_full_path":"http:\/\/tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/ballard-headshot.jpeg","mime":"image\/jpeg","size":104855,"path_740":"http:\/\/tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/ballard-headshot.jpeg?itok=t4a7qUcB"}}},"media_ids":["382401"],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50877","name":"School of Computational Science and Engineering"}],"categories":[],"keywords":[{"id":"11559","name":"CSE computational science engineering"},{"id":"119621","name":"CSE Faculty Candidate Seminar"},{"id":"119631","name":"Grey Ballard"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78751","name":"Undergraduate students"},{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDarrell Grier\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:dgrier@cc.gatech.edu\u0022\u003Edgrier@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}