Sciweavers

695 search results - page 48 / 139
» Cache based fault recovery for distributed systems
Sort
View
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
14 years 3 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
HPCA
2007
IEEE
14 years 8 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...
IPPS
1999
IEEE
14 years 24 days ago
Reducing System Overheads in Home-based Software DSMs
Software DSM systems su er from the high communication and coherence-induced overheads that limit performance. This paper introduces our e orts in reducing system overheads of a h...
Weiwu Hu, Weisong Shi, Zhimin Tang
IPPS
2006
IEEE
14 years 2 months ago
Load balancing in the presence of random node failure and recovery
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cha...
ICS
2007
Tsinghua U.
14 years 2 months ago
Cooperative cache partitioning for chip multiprocessors
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...
Jichuan Chang, Gurindar S. Sohi