Sciweavers

282 search results - page 18 / 57
» Reliability and Scheduling on Systems Subject to Failures
Sort
View
HPDC
2010
IEEE
14 years 11 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
EUROSYS
2006
ACM
15 years 7 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
14 years 8 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...
CODES
2009
IEEE
15 years 4 months ago
FRA: a flash-aware redundancy array of flash storage devices
Since flash memory has many attractive characteristics such as high performance, non-volatility, low power consumption and shock resistance, it has been widely used as storage med...
Yangsup Lee, Sanghyuk Jung, Yong Ho Song