Sciweavers

1156 search results - page 109 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
SPAA
2010
ACM
13 years 10 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
SC
2004
ACM
14 years 3 months ago
Predicting and Evaluating Distributed Communication Performance
–Application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter- and intra-node communication in a c...
Kirk W. Cameron, Rong Ge
SPAA
2009
ACM
14 years 10 months ago
NZTM: nonblocking zero-indirection transactional memory
This workshop paper reports work in progress on NZTM, a nonblocking, zero-indirection object-based hybrid transactional memory system. NZTM can execute transactions using best-eff...
Fuad Tabba, Mark Moir, James R. Goodman, Andrew W....
HPCA
2001
IEEE
14 years 10 months ago
Automatically Mapping Code on an Intelligent Memory Architecture
This paper presents an algorithm to automatically map code on a generic intelligent memory system that consists of a host processor and a simpler memory processor. To achieve high...
Jaejin Lee, Yan Solihin, Josep Torrellas
SPAA
2012
ACM
12 years 20 days ago
SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools
We present a highly-scalable non-blocking producer-consumer task pool, designed with a special emphasis on lightweight synchronization and data locality. The core building block o...
Elad Gidron, Idit Keidar, Dmitri Perelman, Yonatha...