Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML

Authors:
Frédéric Gava
Affiliations:
Laboratory of Algorithms, Complexity and Logic, University of Paris XII,
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 5
Cited 0

The Paderborn University BSP (PUB) library

Parallel Computing
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Parallel superposition for bulk synchronous parallel ML

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Bulk synchronous parallel ML: modular implementation and performance prediction

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Inferring cost equations for recursive, polymorphic and higher-order functional programs

IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bulk-Synchronous Parallel ML (BSML) is a functional data-parallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, avoids deadlocks and nondeterminism. This paper presents the implementation of a new primitive for BSML which can express divide-and-conquer algorithms.