Sciweavers

210 search results - page 14 / 42
» A Scalable Parallel Graph Coloring Algorithm for Distributed...
Sort
View
ICDCS
1996
IEEE
13 years 12 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
14 years 1 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran
SPAA
2010
ACM
14 years 14 days ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
PPOPP
2011
ACM
12 years 10 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...