6105 search results - page 66 / 1221 » A Parallel Algorithm for Bound-Smoothing |
162
click to vote
ICCS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, a...
163
click to vote
WG
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
154
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
138
click to vote
CASES
2009
ACM
16 years 20 days ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
282
click to vote
ICDCN
2011
Springer
14 years 9 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...