Skip to main content
Conference ProceedingsOPEN ACCESS

Programming with BSP homomorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8097 LNCS 446-457
DOI: 10.1007/978-3-642-40047-6_46
4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Legaux, J., Hu, Z., Loulergue, F., Matsuzaki, K., & Tesson, J. (2013). Programming with BSP homomorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 446–457). https://doi.org/10.1007/978-3-642-40047-6_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free