Sciweavers

1415 search results - page 134 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
PPOPP
2010
ACM
15 years 11 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
SCHOLARPEDIA
2011
14 years 5 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
ICS
1999
Tsinghua U.
15 years 6 months ago
An experimental evaluation of tiling and shackling for memory hierarchy management
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
Induprakas Kodukula, Keshav Pingali, Robert Cox, D...
IPPS
2007
IEEE
15 years 8 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
120
Voted
IPPS
1999
IEEE
15 years 6 months ago
Large Scale Simulation of Particulate Flows
Simulations of particles in fluid flows are of great interest to numerous industries using sedimentation, fluidization, lubricated transport, and hydraulic fracturing of hydrocarb...
Ahmed H. Sameh, Vivek Sarin