6939 search results - page 643 / 1388 » Algorithm Engineering for Parallel Computation |
151
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
166
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...
164
click to vote
CONCUR
1998
Springer
15 years 11 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
179
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
150
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance d...