105 search results - page 2 / 21 » Hyperplane Partitioning: An Approach to Global Data Partitio... |
IPPS
2007
IEEE
13 years 10 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
IPPS
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...