HPC Seminar: Professor Milind Kulkarni

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Thursday February 26, 2009 - Friday February 27, 2009
      10:00 am - 10:59 am
  • Location: Klaus 1456
  • Phone: (404) 385-4785
  • URL:
  • Email: lometa@cc.gatech.edu
  • Fee(s):
    N/A
  • Extras:
Contact
Lometa Mitchell
Summaries

Summary Sentence: No summary sentence submitted.

Full Summary: No summary paragraph submitted.

HPC Seminar

By: Professor Milind Kulkarni

University of Texas at Austin

Date: Thursday, February 26, 2009

Time: 11:00pm-12:00pm

Location: Klaus 1456

For more information please contact: Dr. Rich Vuduc; richie@cc.gatech.edu

 
"The Galois System: Parallelizing Irregular Applications"

Abstract:  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 "amorphous data-parallelism," can be exploited efficiently and easily.

I 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.

http://users.ices.utexas.edu/~milind/

~~~~~~~~~~~~~~~~~~

You are cordially invited to attend a reception that will follow the seminar to chat informally with faculty and students. Refreshments will be provided.

Additional Information

In Campus Calendar
No
Groups

College of Computing

Invited Audience
No audiences were selected.
Categories
No categories were selected.
Keywords
No keywords were submitted.
Status
  • Created By: Louise Russo
  • Workflow Status: Published
  • Created On: Feb 11, 2010 - 10:51am
  • Last Updated: Oct 7, 2016 - 9:49pm