{"507491":{"#nid":"507491","#data":{"type":"event","title":"CSE Faculty Candidate Seminar - Scott Beamer: Understanding and Improving Graph Algorithm Performance","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003EOverview:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EGraph processing is experiencing a renewed surge of interest as applications have emerged or grown in importance in social networks analysis, recognition and the sciences. Graph algorithms are notoriously difficult to execute efficiently, so there has been a considerable effort in improving the performance of processing large graphs for these applications.\u003C\/p\u003E\u003Cp\u003EAs an architect specializing for a particular workload, I will describe my vertically integrated research on improving graph algorithm performance. This ranges from algorithms with a new approach to breadth-first search to architecture with a detailed graph workload characterization. In between, this includes a graph domain-specific language, a performance model, and a benchmark suite. I will conclude the talk with my intended future directions of making architecture more communication-centric.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EBio:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EScott Beamer is a Computer Architecture Ph.D. candidate at the University of Calf., Berkeley advised by Krste Asanovi\u0107 and David Patterson. He is currently investigating how to accelerate graph algorithms through software optimization and hardware specialization. In the past, he looked into how to best use monolithically integrated silicon photonics to create memory interconnects. He received his bachelor\u0027s of science in Electrical Engineering and Computer Science and a master\u0027s of science in Computer Science, both from UC Berkeley.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EIn this talk, Scott Beamer, a Ph.D candidate at University of Calif., Berkeley, will describe research on improving graph algorithm performance.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"Faculty candidate presents information understanding and improving graph algorithm performance"}],"uid":"28781","created_gmt":"2016-02-29 15:30:41","changed_gmt":"2017-04-13 21:16:27","author":"Anna Stroup","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2016-03-09T09:00:00-05:00","event_time_end":"2016-03-09T10:00:00-05:00","event_time_end_last":"2016-03-09T10:00:00-05:00","gmt_time_start":"2016-03-09 14:00:00","gmt_time_end":"2016-03-09 15:00:00","gmt_time_end_last":"2016-03-09 15:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50877","name":"School of Computational Science and Engineering"}],"categories":[],"keywords":[{"id":"119621","name":"CSE Faculty Candidate Seminar"},{"id":"168425","name":"Scott Beamer"}],"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":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EJason Riedy:\u0026nbsp;jason.riedy@cc.gatech.edu\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}