2432 search results - page 16 / 487 » Using simple abstraction to reinvent computing for paralleli... |
GRID
2006
Springer
14 years 9 months ago
2006
Springer
Abstract Parallel asynchronous iterative algorithms relax synchronization and communication requirements, and can potentially extend Desktop Grids beyond embarrassingly parallel ap...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Message progression schemes that enable communication and computation to be overlapped have the potential to improve the performance of parallel applications. With curre...
PACT
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. In this paper, we apply a competitive coevolutionary approach using loosely coupled genetic algorithms to a distributed optimization of the Rosenbrock's function. Th...
IEEECIT
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that...