Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Recent Advances in Parallel Algorithms

Speaker  Grey Ballard, Andrew Lenharth, and Madan Musuvathi

Affiliation  Sandia National Laboratories, University of Texas at Austin, Microsoft Research

Host  Madan Musuvathi

Duration  01:26:03

Date recorded  15 July 2014

Parallelism abounds in modern hardware—from the datacenter to multi-cores, GPUs, and FPGAs. On the other hand, important algorithms, such as graph algorithms, dynamic programming, and finite-state machine processing involve fine-grained dependencies and do not directly map on to this parallel hardware. Harnessing the parallelism available for these algorithms requires new algorithms, new programming languages, and new runtime systems. This session will present recent advances in this area and will serve as forum for bringing together researchers from diverse disciplines—such as algorithms, programming languages, compilers and runtime, machine-learning, architecture, and systems—into this exciting research area.

©2014 Microsoft Corporation. All rights reserved.
By the same speakers
Learn more
> Recent Advances in Parallel Algorithms