5640 search results - page 178 / 1128 » Parallelizing the Data Cube |
162
click to vote
HPCC
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
166
click to vote
EGC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we propose a new approach for scheduling data parallel applications on the Grid using irregular array distributions. We implement the scheduler as a new case study fo...
151
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory result...
179
click to vote
CAIP
1995
Springer
15 years 10 months ago
1995
Springer
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
171
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...