Add to ORKGThe aim of this paper is to show how to parallelize a compute intensive application in mathematics (Group Theory) for an institutional Desktop Grid platform coordinated by a meta-grid middleware named BonjourGrid. The paper is twofold: first of all, it shows how to parallelize a sequential program for a multicore CPU which participates in the computation and second it demonstrates the effort for launching multiple instances of the solutions for the mathematical problem with the BonjourGrid middleware. BonjourGrid is a fully decentralized Desktop Grid middleware. The main results of the paper are: a) an efficient multi-threaded version of a sequential program to compute Littlewood-Richardson coefficients, namely the Multi-LR program and b) a...
Abstract. Algebraic multigrid methods for large, sparse linear systems are a necessity in many compu...
In the 1990s the Beowulf project smoothed to way for massively paral-lel computing as access to para...
The idea using polynomial factorization for speeding up the computation of Buchberger's Gröbner...
International audienceThe aim of this paper is to show how to parallelize a compute intensive applic...
This paper demonstrates that it is possible to obtain good, scalable parallel performance by coordin...
The InteGrade middleware intends to exploit the idle time of computing resources in computer laborat...
Abstract Efficiently solving large sparse linear systems on loosely coupled net-works of computers i...
Abstract—In this paper we present the design of a fast middleware for high performance computing on ...
SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids....
This paper demonstrates that it is possible to obtain good, scalable parallel performance by coordi...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
International audienceIn this paper, we focus on a distributed and parallel programming paradigm for...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
This paper describes a very high-level approach that aims to orchestrate sequential components writt...
This paper shows how a high level matrix programming language may be used to perform Monte Carlo sim...
Abstract. Algebraic multigrid methods for large, sparse linear systems are a necessity in many compu...
In the 1990s the Beowulf project smoothed to way for massively paral-lel computing as access to para...
The idea using polynomial factorization for speeding up the computation of Buchberger's Gröbner...
International audienceThe aim of this paper is to show how to parallelize a compute intensive applic...
This paper demonstrates that it is possible to obtain good, scalable parallel performance by coordin...
The InteGrade middleware intends to exploit the idle time of computing resources in computer laborat...
Abstract Efficiently solving large sparse linear systems on loosely coupled net-works of computers i...
Abstract—In this paper we present the design of a fast middleware for high performance computing on ...
SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids....
This paper demonstrates that it is possible to obtain good, scalable parallel performance by coordi...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
International audienceIn this paper, we focus on a distributed and parallel programming paradigm for...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
This paper describes a very high-level approach that aims to orchestrate sequential components writt...
This paper shows how a high level matrix programming language may be used to perform Monte Carlo sim...
Abstract. Algebraic multigrid methods for large, sparse linear systems are a necessity in many compu...
In the 1990s the Beowulf project smoothed to way for massively paral-lel computing as access to para...
The idea using polynomial factorization for speeding up the computation of Buchberger's Gröbner...