2754 search results - page 427 / 551 » Distributed Weighted Matching |
155
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Current parallelizing compilers for message-passing machines only support a limited class of data-parallel applications. One method for eliminating this restriction is to combine ...
162
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
132
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
146
Voted
ICS
1994
Tsinghua U.
15 years 8 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
149
click to vote
ICPP
1992
IEEE
15 years 8 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...