Sciweavers

1156 search results - page 11 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
CONCURRENCY
2004
50views more  CONCURRENCY 2004»
13 years 10 months ago
Parallel operation of CartaBlanca on shared and distributed memory computers
N. T. Padial-Collins, W. B. VanderHeyden, D. Z. Zh...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICPP
2009
IEEE
14 years 5 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...
IPPS
1999
IEEE
14 years 2 months ago
Cashmere-VLM: Remote Memory Paging for Software Distributed Shared Memory
Software distributed shared memory (DSM) systems have successfully provided the illusion of shared memory on distributed memory machines. However, most software DSM systems use th...
Sandhya Dwarkadas, Robert Stets, Nikos Hardavellas...
SPAA
2009
ACM
14 years 7 months ago
Optimizing transactions for captured memory
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabat...