Sciweavers

7092 search results - page 641 / 1419
» Parallelizing constraint programs
Sort
View
PADL
2010
Springer
16 years 3 months ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen
IPPS
2007
IEEE
16 years 21 days ago
OS Mechanism for Continuation-based Fine-grained Threads on Dedicated and Commodity Processors
Fine-grained multithreading based on a natural model, such as dataflow model, is promising in achieving high efficiency and high programming productivity. In this paper, we disc...
Shigeru Kusakabe, Satoshi Yamada, Mitsuhiro Aono, ...
SC
2003
ACM
15 years 11 months ago
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
IPPS
1998
IEEE
15 years 10 months ago
COMPaS: A Pentium Pro PC-based SMP Cluster and Its Experience
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...
Yoshio Tanaka, Motohiko Matsuda, Makoto Ando, Kazu...
ICS
1997
Tsinghua U.
15 years 10 months ago
Iteration Space Slicing and Its Application to Communication Optimization
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 ...
William Pugh, Evan Rosser