Smith, Frank Anderson ; Jeffrey S. Scroggs, Committee Member,Edward W. Davis, Committee Member,Rex A. Dwyer, Committee Member,Robert E. Funderlic, Committee Chair,Carla D. Savage, Committee Member,Smith, Frank Anderson ; Jeffrey S. Scroggs ; Committee Member ; Edward W. Davis ; Committee Member ; Rex A. Dwyer ; Committee Member ; Robert E. Funderlic ; Committee Chair ; Carla D. Savage ; Committee Member
The performance of parallel computers can be greatly affected by a user's choices of data distribution and logical processor configuration. Selecting optimal choices for such user specifiable parameters may be easier if the performance of the target machine can be predicted by a performance model. Models for parallel performance on the IBM SP for grid structured problems are considered.Such problems are ubiquitous in scientific computing and frequently are characterized by a nearest neighbor communication pattern.Bounds are derived for the size of the solution space of data distributions and logical processor configurations for problems with nearest neighbor communication. Proofs are derived that exclude a substantial number of non-optimal choices of data distribution and logical processor configuration.Algorithms are given that are intended to predict parallelperformance for a model application and allow the user to select optimal choices for parameters that can be specified.Experimental evidence is presented that suggests that performance on the SP is characterized fairly accurately by a specific model. Experimental evidence also suggests that an algorithm exists to optimize a user's choices of data distribution and logical processor configuration for grid structured problems on the SP.
【 预 览 】
附件列表
Files
Size
Format
View
Modeling, Predicting, And OptimizingParallel Performance Of Grid Stuctured Problems