Sciweavers

6299 search results - page 14 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
PPOPP
2011
ACM
12 years 11 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...
HPCA
2000
IEEE
14 years 25 days ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
CEC
2005
IEEE
14 years 2 months ago
Dynamic salting route optimisation using evolutionary computation
Abstract- On marginal winter nights, highway authorities face a difficult decision as to whether or not to salt the road network. The consequences of making a wrong decision are s...
Hisashi Handa, Lee Chapman, Xin Yao
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
14 years 9 months ago
Indexing for Dynamic Abstract Regions
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
VISUALIZATION
2000
IEEE
14 years 24 days ago
On-the-Fly rendering of losslessly compressed irregular volume data
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
Chuan-Kai Yang, Tulika Mitra, Tzi-cker Chiueh