628 search results - page 28 / 126 » Tying Memory Management to Parallel Programming Models |
150
click to vote
IFL
2001
Springer
15 years 8 months ago
2001
Springer
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
142
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
148
Voted
WOMPAT
2001
Springer
15 years 8 months ago
2001
Springer
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
156
click to vote
PC
2012
13 years 12 months ago
2012
This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how ...
124
click to vote
HIPC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...