Programming with BSP homomorphisms

  • Authors:
  • Joeffrey Legaux;Zhenjiang Hu;Frédéric Loulergue;Kiminori Matsuzaki;Julien Tesson

  • Affiliations:
  • LIFO, Université d'Orléans, France;National Institute of Informatics, Tokyo, Japan;LIFO, Université d'Orléans, France;Kochi University of Technology, Kochi, Japan;LACL, UPEC, Université Paris Est, France

  • Venue:
  • Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Algorithmic skeletons in conjunction with list homomorphisms play an important role in formal development of parallel algorithms. We have designed a notion of homomorphism dedicated to bulk synchronous parallelism. In this paper we derive two application using this theory: sparse matrix vector multiplication and the all nearest smaller values problem. We implement a support for BSP homomorphism in the Orléans Skeleton Library and experiment it with these two applications.