548 search results - page 56 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
124
click to vote
ICS
2001
Tsinghua U.
15 years 6 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
135
click to vote
EGH
2010
Springer
14 years 12 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
148
click to vote
IJHPCA
2008
15 years 1 months ago
2008
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
119
click to vote
CPM
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
133
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...