{"52555":{"#nid":"52555","#data":{"type":"event","title":"HPC Seminar: Professor Milind Kulkarni","body":[{"value":"\u003Cp\u003EHPC Seminar\u003C\/p\u003E\n\u003Cp\u003EBy: Professor Milind Kulkarni\u003C\/p\u003E\n\u003Cp\u003EUniversity of Texas at Austin\u003C\/p\u003E\n\u003Cp\u003EDate: Thursday, February 26, 2009\u003C\/p\u003E\n\u003Cp\u003ETime: 11:00pm-12:00pm\u003C\/p\u003E\n\u003Cp\u003ELocation: Klaus 1456\u003C\/p\u003E\n\u003Cp\u003EFor more information please contact: Dr. Rich Vuduc; \u003Ca href=\u0022mailto:richie@cc.gatech.edu\u0022\u003Erichie@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\n\u003Cp\u003E\u00a0\u003Cbr \/\u003E\u0022The Galois System: Parallelizing Irregular Applications\u0022\u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E\n\u003Cp\u003EAbstract:\u00a0 With the advent of multicore processors, the challenge of increasing program performance has become one of parallelization. While much research over the past three decades has focused on parallelizing dense-array and matrix programs, far less attention has been paid to irregular programs, which operate over pointer-based data structures such as trees and graphs, where traditional approaches have largely failed to uncover significant amounts of parallelism. In this talk, I will show that irregular programs do, indeed, have large amounts of parallelism, and that this type of parallelism, which I call \u0022amorphous data-parallelism,\u0022 can be exploited efficiently and easily.\u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E\n\u003Cp\u003EI will describe the Galois system, which uses high-level abstractions to expose amorphous data-parallelism in sequential irregular programs, and uses semantic properties of these programs to perform automatic parallelization. I will then present a number of optimizations which allow programmers to exploit locality in pointer-based data structures to improve scalability and reduce overheads. I will show that the Galois approach is able to extract significant amounts of parallelism from amorphous data-parallel programs with little programmer effort.\u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/users.ices.utexas.edu\/~milind\/\u0022\u003Ehttp:\/\/users.ices.utexas.edu\/~milind\/\u003C\/a\u003E \u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E\n\u003Cp\u003E~~~~~~~~~~~~~~~~~~\u003C\/p\u003E\n\u003Cp class=\u0022MsoPlainText\u0022\u003EYou are cordially invited to attend a reception that will follow the seminar to chat informally with faculty and students. Refreshments will be provided.\u003C\/p\u003E\n\u003Cp align=\u0022center\u0022\u003E\u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E\n\u003Cp align=\u0022center\u0022\u003E\u003C\/p\u003E\n\u003Cp\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":"","uid":"27154","created_gmt":"2010-02-11 15:51:52","changed_gmt":"2016-10-08 01:49:53","author":"Louise Russo","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2009-02-26T10:00:00-05:00","event_time_end":"2009-02-26T11:00:00-05:00","event_time_end_last":"2009-02-26T11:00:00-05:00","gmt_time_start":"2009-02-26 15:00:00","gmt_time_end":"2009-02-26 16:00:00","gmt_time_end_last":"2009-02-26 16:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"Lometa Mitchell","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}