6105 search results - page 67 / 1221 » A Parallel Algorithm for Bound-Smoothing |
206
click to vote
MICRO
2012
IEEE
13 years 3 months ago
2012
IEEE
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
133
click to vote
PAAPP
1998
15 years 1 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
105
click to vote
EUROPAR
2003
Springer
15 years 6 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
117
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using...
154
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...