Program generation for the all-pairs shortest path problem

A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly complex computing platforms. Examples include ATLAS, SPIRAL, and the codelet generator in FFTW. Each of these generators produces highly optimized source code directly from a problem specification. In this paper, we extend this list by a program generator for the well-known FloydWarshall (FW) algorithm that solves the all-pairs shortest path problem, which is important in a wide range of engineering applications. As the first contribution, we derive variants of the FW algorithm that make it possible to apply many of the optimization techniques developed for matrix-matrix multiplication. The second contribution is the actual program generator, which uses tiling, loop unrolling, and SIMD vectorization combined with a hill climbing search to produce the best code (float or integer) for a given platform. Using th...

• Type: Conference
• Year: 2006
• Where: IEEEPACT
• Authors: Sung-Chul Han, Franz Franchetti, Markus Püschel
• Keywords: All-pairs Shortest Path Problem, Domain-specific Program Generators, Hardware, IEEEPACT 2006, Program Generator