3660 search results - page 332 / 732 » Parallel Program Archetypes |
202
click to vote
SC
2003
ACM
16 years 22 hour ago
2003
ACM
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
177
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We have built an eight node SMP cluster called COMPaS (Cluster Of Multi-Processor Systems), each node of which is a quadprocessor Pentium Pro PC. We have designed and implemented a...
206
click to vote
ICS
1997
Tsinghua U.
15 years 11 months ago
1997
Tsinghua U.
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
153
click to vote
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 10 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
159
click to vote
JPDC
2006
15 years 6 months ago
2006
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...