A BSP Approach to the Scheduling of Tightly-Nested Loops

Authors:
Radu Calinescu
Affiliations:
-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 7
Cited 1

A bridging model for parallel computation

Communications of the ACM
General purpose parallel computing

Lectures on parallel computation
(Pen)-ultimate tiling?

Integration, the VLSI Journal
Compiler transformations for high-performance computing

ACM Computing Surveys (CSUR)
The parallel execution of DO loops

Communications of the ACM
A Loop Transformation Theory and an Algorithm to Maximize Parallelism

IEEE Transactions on Parallel and Distributed Systems
Bulk Synchronous Parallel Scheduling of Uniform Dags

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II

1-Optimality of static BSP computations: scheduling independent chains as a case study

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the scheduling of uniform-dependence loop nests within the framework of the bulk-synchronous parallel (BSP) model. Two broad classes of tightly-nested loops are identified in the paper and scheduled according to the BSP discipline, and the resulting schedules are analysed in terms of the BSP cost model.