Portable and architecture independent parallel performance tuning using BSP. A call-graph profiling tool has been designed and implemented to analyse the efficiency of programs written in BSPlib. This tool highlights computation and communication imbalance in parallel programs, exposing portions of program code which are amenable to improvement. A unique feature of this profiler is that it uses the bulk synchronous parallel cost model, thus providing a mechanism for portable and architecture-independent parallel performance tuning. In order to test the capabilities of the model on a real-world example, the performance characteristics of an SQL query processing application are investigated on a number of different parallel architectures.

References in zbMATH (referenced in 42 articles , 1 standard article )

Showing results 21 to 40 of 42.
Sorted by year (citations)
  1. Goldman, Alfredo; Mounie, Gregory; Trystram, Denis: 1-optimality of static BSP computations: Scheduling independent chains as a case study. (2003)
  2. Tong, Weiqin; Ding, Jingbo; Cai, Lizhi: A parallel programming environment on grid (2003)
  3. Aldinucci, Marco: Automatic program transformation: the META tool for skeleton-based languages (2002)
  4. Beran, Martin: Pipelined decomposable BSP computers (2002)
  5. Hains, Gaétan; Loulergue, Frédéric: Functional bulk synchronous parallel programming using the BSMLlib library (2002)
  6. Jarvis, S. A.; Hill, J. M. D.; Siniolakis, C. J.; Vasilev, V. P.: Portable and architecture independent parallel performance tuning using BSP. (2002)
  7. Jie, Wei; Cai, Wentong; Turner, Stephen J.: POEMS: A parallel object-oriented environment for multi-computer systems (2002)
  8. Stewart, A.; Clint, M.; Gabarró, J.: Algebraic rules for reasoning about BSP programs (2002)
  9. van Heukelum, A.; Barkema, G. T.; Bisseling, R. H.: DNA electrophoresis studied with the cage model (2002)
  10. González, Jesús A.; León, Coromoto; Piccoli, Fabiana; Printista, Marcela; Roda, José L.; Rodríguez, Casiano; de Sande, Francisco: Performance prediction of oblivious BSP programs (2001)
  11. He, Xin; Huang, Chun-Hsi: Communication efficient BSP algorithm for all nearest smaller values problem (2001)
  12. Inda, Márcia A.; Bisseling, Rob H.: A simple and efficient parallel FFT algorithm using the BSP model (2001)
  13. Inda, Márcia A.; Bisseling, Rob H.; Maslen, David K.: On the efficient parallel computation of Legendre transforms (2001)
  14. Meyer auf der Heide, Friedhelm; Wanka, Rolf: Parallel bridging models and their impact on algorithm design (2001)
  15. Talia, Domenico: Models and trends in parallel programming (2001)
  16. Donaldson, S. R.; Hill, J. M. D.; Skillicorn, D. B.: BSP clusters: High performance, reliable and very low cost (2000)
  17. Granvilliers, Laurent; Hains, Gaétan: A conservative scheme for parallel interval narrowing (2000)
  18. Keßler, Christoph W.: NestStep: Nested parallelism and virtual shared memory for the BSP model (2000)
  19. Hammond, Kevin (ed.); Michaelson, Greg (ed.): Research directions in parallel functional programming (1999)
  20. Huang, Linpeng; Sun, Yongqiang; Yuan, Wei: Hierarchical bulk synchronous parallel model and performance optimization. (1999) ioport