Sciweavers

4171 search results - page 458 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
PPOPP
2010
ACM
16 years 4 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...
199
Voted
PLDI
2003
ACM
16 years 3 days ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
175
Voted
VLDB
2001
ACM
109views Database» more  VLDB 2001»
15 years 11 months ago
Analyzing energy behavior of spatial access methods for memory-resident data
The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight, together with performance considerations. Energy-conscious design is...
Ning An, Anand Sivasubramaniam, Narayanan Vijaykri...
202
Voted
MOBICOM
2010
ACM
15 years 7 months ago
Bartendr: a practical approach to energy-aware cellular data scheduling
Cellular radios consume more power and suffer reduced data rate when the signal is weak. According to our measurements, the communication energy per bit can be as much as 6x highe...
Aaron Schulman, Vishnu Navda, Ramachandran Ramjee,...
156
Voted
SPAA
1998
ACM
15 years 11 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang