Sciweavers

1156 search results - page 156 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ICDCS
2002
IEEE
14 years 1 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
VEE
2012
ACM
232views Virtualization» more  VEE 2012»
12 years 4 months ago
DVM: towards a datacenter-scale virtual machine
As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenterscale programming has become an imperative research age...
Zhiqiang Ma, Zhonghua Sheng, Lin Gu, Liufei Wen, G...
PPOPP
2009
ACM
14 years 9 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
ISPAN
2008
IEEE
14 years 3 months ago
M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network
- Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems ...
Tsung-Han Lin, Tsung-Hsuan Ho, Yu-Wei Chan, Yeh-Ch...
SC
2009
ACM
14 years 3 months ago
Scalable work stealing
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
James Dinan, D. Brian Larkins, P. Sadayappan, Srir...