Sciweavers

33 search results - page 6 / 7
» Worst-Case Optimal Tree Layout in a Memory Hierarchy
Sort
View
PLDI
1995
ACM
13 years 9 months ago
Unifying Data and Control Transformations for Distributed Shared Memory Machines
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
Michal Cierniak, Wei Li
TJS
2002
135views more  TJS 2002»
13 years 5 months ago
HPCVIEW: A Tool for Top-down Analysis of Node Performance
Although it is increasingly difficult for large scientific programs to attain a significant fraction of peak performance on systems based on microprocessors with substantial instr...
John M. Mellor-Crummey, Robert J. Fowler, Gabriel ...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 27 days ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
CN
2002
82views more  CN 2002»
13 years 6 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
EGH
2011
Springer
12 years 6 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...