David A. Bader
IEEE Fellow
AAAS Fellow
Professor
College of Computing
Georgia Tech
Atlanta, GA 30332


 
 

 

High-Performance Algorithm Engineering for Parallel Computation

The emerging discipline of algorithm engineering has primarily focused on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used implementations. As parallel computing becomes ubiquitous, we need to extend algorithm engineering techniques to parallel computation. Such an extension adds significant complications. After a short review of algorithm engineering achievements for sequential computing, we review the various complications caused by parallel computing, present some examples of successful efforts, and give a personal view of possible future research.

Publication History

Versions of this paper appeared as:
  1. D.A. Bader, B.M.E. Moret, and P. Sanders, ``High-Performance Algorithm Engineering for Parallel Computation,'' Experimental Algorithmics, Lecture Notes of Computer Science, 2547:1-23, 2002.

Download this report in Adobe PDF

 

 
 

Last updated: July 25, 2004

 




Computational Biology



Parallel Computing



Combinatorics