A bridging model for parallel computation
Communications of the ACM
Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
A methodology for the development and the support of massively parallel programs
Programming languages for parallel processing
Structured development of parallel programs
Structured development of parallel programs
BSPlib: The BSP programming library
Parallel Computing
Skel-BSP: Performance Portability for Skeletal Programming
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Using BSP to optimize Data Distribution in Skeleton Programs
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
A Transformational Framework for Skeletal Programs: Overview and Case Study
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Functional Skeletons for Parallel Coordination
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Optimising Skeletal-Stream Parallelism on a BSP Computer
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Paper: Performance parameters and benchmarking of supercomputers
Parallel Computing
Programming with BSP homomorphisms
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
The paper describes the Skel-BSP Global Optimizer (GO), a compile-time technique tuning the structure of skeletal programs to the characteristics of the target architecture. The GO uses a set of optimization rules predicting the costs of each skeleton. The optimization rules refer to a set of implementation templates developed on top of the EdD-BSP (a variant of the BSP model). The paper describes the Program Annotated Tree representation and the set of transformation rules utilized by the GO to modify the starting program. The optimization phases: balancing, scaling and augmenting are presented and explained running the GO on a cluster of PCs for an image analysis toy-program.