1023 search results - page 3 / 205 » Benchmarking Memory Performance with the Data Cube Operator |
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
CLUSTER
2007
IEEE
13 years 10 months ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
SC
2000
ACM
13 years 10 months ago
2000
ACM
We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory syste...
VLDB
1999
ACM
13 years 10 months ago
1999
ACM
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...