238 search results - page 3 / 48 » Optimistic parallelism benefits from data partitioning |
PPOPP
2010
ACM
14 years 1 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
COORDINATION
2004
Springer
13 years 10 months ago
2004
Springer
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
PPOPP
1995
ACM
13 years 8 months ago
1995
ACM
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
ICWS
2010
IEEE
13 years 6 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
PADS
2004
ACM
13 years 10 months ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...