Sciweavers

822 search results - page 36 / 165
» Contention in shared memory algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Optimizing File Availability in Peer-to-Peer Content Distribution
Abstract— A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittentlyconnected nodes that cooperate to share files. Because ...
Jussi Kangasharju, Keith W. Ross, David A. Turner
HPCA
2007
IEEE
14 years 9 months ago
A Scalable, Non-blocking Approach to Transactional Memory
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
Hassan Chafi, Jared Casper, Brian D. Carlstrom, Au...
PODC
2010
ACM
14 years 21 days ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran
IPPS
1992
IEEE
14 years 27 days ago
CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension
This paper presents a hybrid shared memory architecture which combines the scalability of a multistage interconnection network with the contention reduction benefits of coherent c...
Matthew K. Farrens, Arvin Park, Allison Woodruff
ANSS
2004
IEEE
14 years 17 days ago
Optimized Dissemination of Highly Anticipated Content over an Itinerary Based P2P Network
As the Internet evolved, peer-to-peer networks became one of the major enabling technologies. Alternative solutions for several issues emerged with the use o this technology. Such...
Konstantinos G. Zerfiridis, Helen D. Karatza