120 search results - page 10 / 24 » Optimizing irregular shared-memory applications for distribu... |
PPOPP
2010
ACM
14 years 4 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...
FCCM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
CF
2009
ACM
14 years 2 months ago
2009
ACM
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
PPOPP
1997
ACM
13 years 11 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
JLP
2007
13 years 7 months ago
2007
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java’s memory model and allows multithreaded Java progr...