In this paper we introduce our estimation method for parallel execution times, based on
identifying separate “parts” of the work done by parallel programs. Our run time analysis …

Certains problèmes nécessitent des performances que seules les machines massivement
parallèles ou les méta-ordinateurs peuvent offrir. L'écriture d'algorithmes pour ce type de …

We present a calculus to formalize and give costs to parallel computations over
multidimensional dense arrays. The calculus extends a simple distribution calculus …

We have designed a functional data-parallel language called BSML for programming bulk
synchronous parallel (BSP) algorithms. Deadlocks and indeterminism are avoided and the …

This paper presents a new functional parallel language: Minimally Synchronous Parallel ML
(MSPML). The execution time can be estimated, dead-locks and indeterminism are avoided …

In this paper we estimate parallel execution times, based on identifying separate" parts" of
the work done by parallel programs. We assume that programs are described using …

Distributed applications running on clusters may be composed of several components with
very different performance requirements. The FlowVR middleware allows the developer to …

Abstract Minimally Synchronous Parallel ML is a functional parallel language whose
execution time can then be estimated and dead-locks and indeterminism are avoided …

This thesis presents design and implementation approaches for the parallel algorithms of
computer algebra. We use algorithmic skeletons and also further approaches, like data …

Réaliser une expérience dans le monde réel est une tâche soumisea de nombreuses
contraintes physiques, d'espace, de temps, de coût, etc. De nombreuses expériences sont …