2609 search results - page 135 / 522 » Optimizing for parallelism and data locality |
212
Voted
CGF
2011
14 years 7 months ago
2011
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
106
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...
124
click to vote
ICDCS
2011
IEEE
14 years 10 days ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
106
click to vote
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a high-performance Distributed Shared Memory system called VODCA, which supports a novel View-Oriented Parallel Programming on cluster computers. One advantage...
87
Voted
SPAA
1990
ACM
15 years 4 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...