| Автор | SINHAROY, BALARAM |
| Автор | SZYMANSKI, BOLESLAW K. |
| Дата выпуска | 1994 |
| dc.description | Data parallelism, in which the same operation is performed on many elements of an n-dimensional array, is one of the most powerful methods of extracting parallelism in scientific computation. One form of data parallelism involves defining a sequence of parallel wavefronts of a computation. Each wavefront consists of an (n - l)-dimcnsional subarray of the evaluated array and all wavefront elements are evaluated simultaneously. Different wavefronts result in different performance, so the question arises how to determine the wavefronts that result in the minimum computation time. Wavefront determination should define also allocation of wavefront elements to processors.In this paper we present efficient algorithms for determining the optimum wavefront and for partitioning it into sections assigned to individual processors. Presented algorithms are applicable to computations that are defined over two or higher dimensional arrays and are executed on distributed memory machines interconnected into a one or two-dimensional processor array. |
| Формат | application.pdf |
| Издатель | Taylor & Francis Group |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Тема | Parallel programming |
| Тема | data dependence |
| Тема | algorithm transformation |
| Тема | uniform dependence algorithm |
| Тема | compile-time scheduling |
| Тема | hyperplane |
| Тема | D.1.3 |
| Тема | D.3.4 |
| Тема | D.4.1 |
| Название | FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION |
| Тип | research-article |
| DOI | 10.1080/10637199408915404 |
| Print ISSN | 1063-7192 |
| Журнал | Parallel Algorithms and Applications |
| Том | 2 |
| Первая страница | 5 |
| Последняя страница | 26 |
| Аффилиация | SINHAROY, BALARAM; Large Scale Computing Division, IBM Corporation |
| Аффилиация | SZYMANSKI, BOLESLAW K.; Department of Computer Science, Rensselaer Polytechnic Institute |
| Выпуск | 1-2 |
