5640 search results - page 280 / 1128 » Parallelizing the Data Cube |
115
click to vote
VISUALIZATION
1996
IEEE
15 years 8 months ago
1996
IEEE
We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are desc...
135
click to vote
PADS
1996
ACM
15 years 8 months ago
1996
ACM
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...
117
click to vote
JSA
2006
15 years 4 months ago
2006
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
152
click to vote
NPC
2010
Springer
15 years 2 months ago
2010
Springer
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
151
click to vote
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...