DMCA
Scheduling Of Regular And Irregular Computations: A System and Applications (1995)
BibTeX
@MISC{Gerasoulis95schedulingof,
author = {Apostolos Gerasoulis and Jia Jiao and Tao Yang},
title = {Scheduling Of Regular And Irregular Computations: A System and Applications},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study the performance of task graph scheduling for both regular and irregular parallel computation. We present a scheduling tool named PYRROS, which takes as an input a task graph and a compile time estimation of computation and communication weights. It then produces a schedule and a parallel code based on this schedule. We analyze the effect of compile time errors to run time scheduling performance. For coarse grain task graphs small errors at compile time have a minimal impact in run time performance. We use PYRROS to produce parallel code for Gauss Jordan(GJ) and Gaussian Elimination (GE), sparse matrix computation and Fast Multipole method for irregular n-body simulations. The performance for GJ and GE on dense matrix computation is comparable to optimized hand written codes. For irregular problems such as n-body, scheduling overhead could become significant, but because of the iterative nature of such problems the overhead can be amortized over many iterations. And the overall...
Keyphrases
irregular computation task graph parallel code run time performance iterative nature gauss jordan dense matrix computation compile time fast multipole method communication weight many iteration irregular n-body simulation minimal impact optimized hand scheduling tool gaussian elimination irregular parallel computation compile time estimation compile time error irregular problem sparse matrix computation
