Title :
A BSP approach to the scheduling of tightly-nested loops
Author_Institution :
Comput. Lab., Oxford Univ., UK
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
Keywords :
parallel programming; processor scheduling; program compilers; BSP cost model; BSP discipline; bulk-synchronous parallel model; loop nests; scheduling; tightly-nested loops; uniform-dependence; Code standards; Concurrent computing; Costs; Encoding; Laboratories; Parallel architectures; Parallel processing; Parallel programming; Phase change random access memory; Processor scheduling;
Conference_Titel :
Parallel Processing Symposium, 1997. Proceedings., 11th International
Conference_Location :
Genva
Print_ISBN :
0-8186-7793-7
DOI :
10.1109/IPPS.1997.580954
