78 search results - page 3 / 16 » Automatic memory partitioning: increasing memory parallelism... |
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
SIGMOD
2012
ACM
11 years 7 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
PARELEC
2006
IEEE
13 years 11 months ago
2006
IEEE
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...