4747 search results - page 321 / 950 » Shuffle Memory System |
137
click to vote
VLDB
1990
ACM
15 years 9 months ago
1990
ACM
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
139
click to vote
RECOSOC
2007
15 years 6 months ago
2007
Code Compression has been shown to be efficient in minimizing the memory requirements for embedded systems as well as in power consumption reduction and performance improvement. I...
141
click to vote
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 4 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
219
click to vote
PVM
2010
Springer
15 years 3 months ago
2010
Springer
A major trend in HPC is the escalation toward manycore, where systems are composed of shared memory nodes featuring numerous processing units. Unfortunately, with scale comes compl...
189
Voted
WDAG
2010
Springer
15 years 2 months ago
2010
Springer
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...