登入
選單
返回
Google圖書搜尋
Improving Parallel Program Performance Using Critical Path Analysis
Andrew W. Kwan
Lubomir Bic
Daniel D. Gajski
出版
Information and Computer Science, University of California, Irvine
, 1989
URL
http://books.google.com.hk/books?id=CLY0OgAACAAJ&hl=&source=gbs_api
註釋
Abstract: "A programming tool that performs analysis of critical paths for parallel programs has been developed. This tool determines the critical path for the program as scheduled onto a parallel computer with P processing elements, the critical path for the program expressed as a data flow graph (when maximal parallelism can be expressed), and the minimum number of processing elements (P[subscript opt]) needed to obtain maximum program speedup. Experiments were performed using several versions of a Gaussian elimination program to examine how speedup varied with changes in granularity and critical path length.