6105 search results - page 198 / 1221 » A Parallel Algorithm for Bound-Smoothing |
160
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
173
click to vote
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...
154
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
163
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
177
click to vote
COLOGNETWENTE
2008
15 years 7 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...