5640 search results - page 100 / 1128 » Parallelizing the Data Cube |
PPOPP
2003
ACM
14 years 2 months ago
2003
ACM
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...
CONCURRENCY
2004
2004
User transparency: a fully sequential programming model for efficient data parallel image processing
13 years 8 months ago
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
DOLAP
2004
ACM
14 years 2 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
CODES
2010
IEEE
13 years 6 months ago
2010
IEEE
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...