| タイトル | Automated problem scheduling and reduction of synchronization delay effects |
| 本文（外部サイト） | http://hdl.handle.net/2060/19870018011 |
| 著者（英） | Saltz, Joel H. |
| 著者所属（英） | NASA Langley Research Center|Yale Univ. |
| 発行日 | 1987-07-01 |
| 言語 | eng |
| 内容記述 | It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs. |
| NASA分類 | COMPUTER SYSTEMS |
| レポートNO | 87N27444
ICASE-87-22
NAS 1.26:178336
NASA-CR-178336 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/149277 |
