2609 search results - page 160 / 522 » Optimizing for parallelism and data locality |
196
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
133
Voted
TPDS
2002
15 years 13 days ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
94
Voted
SPAA
2010
ACM
15 years 1 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
101
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In distributed hybrid computing systems, traditional sequential processors are loosely coupled with reconfigurable hardware for optimal performance. This loose coupling proves to...
86
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
a This paper presents a novel Adaptive Dynamic Gridbased Data Distribution Management (DDM) scheme, which we refer to as ADGB. The main objective of our protocol is to optimize DDM...