5640 search results - page 528 / 1128 » Parallelizing the Data Cube |
122
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
122
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
148
click to vote
IEEEPACT
2000
IEEE
15 years 9 months ago
2000
IEEE
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
166
click to vote
ICPP
1998
IEEE
15 years 9 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
103
click to vote
HICSS
1997
IEEE
15 years 9 months ago
1997
IEEE
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...