Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. Fail-stutter fault tolerance. In Proc. 8th Workshop on Hot Topics in Operating Systems, pages 33--38, Elmau/Oberbayern, Germany, May 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Datamation 2001: - Sorting Odyssey Florentina Self-citation (Arpaci-dusseau) (Correct)
....2000 2002 Time (seconds) Year Datamation results during the past 15 years Tsukerman Weinberger Nyberg Arpaci Dusseau Buonadonna Azuma Popovici, Bent, Forney Figure 1: 15 years of Datamation. jobs are particularly sensitive to performance fluctuations that occur in large scale systems [3]. Thus, if the Datamation sort runs consistently well upon a given platform, conclusions can be drawn on the ability of the platform to avoid or tolerate the presence of such perturbations. In tuning the sort for our Linux based cluster ofPCs platform, we found that three elements were crucial in ....
Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. Fail-Stutter Fault Tolerance. In The 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.
Storage-Aware Caching: Revisiting Caching for Heterogeneous .. - Brian Forney Andrea (2002) (3 citations) Self-citation (Arpaci-dusseau) (Correct)
....are as effective, yet simpler, than proposals in those research areas. Our study is set in the context of a network attached disk system. Network attached disks are an increasingly important storage paradigm, and present clients with both static and dynamic forms of performance heterogeneity [5, 6, 13]. However, the algorithms we develop are general and can be applied across a broader range of storage devices. Our main results are as follows. We show storageaware caching is significantly more performance robust than cost oblivious caching and as robust as a leading web caching algorithm. Since ....
....work. Thus, dynamic partitioning is needed, in which the ratio of partition sizes adjusts as the requests are monitored. Dynamic partitioning have the following three benefits. First, dynamic partitioning can adjust to the dynamic performance variations, or faults, common in modern devices [6]. Second, dynamic partitioning can react to contention at devices due to hotspots in workloads. Finally, dynamic partitioning can compensate for the fact that the performance ratios across devices can change as a function of the access patterns. Dynamic partitioning can be divided into eager ....
R. H. Arpaci-Dusseau and A. C. Arpaci-Dusseau. Fail-Stutter Fault Tolerance. In Workshop on Hot Topics in Operating Systems (HotOS 8), Schloss Elmau, Germany, May 2001.
Datamation 2001: A Sorting Odyssey - Florentina Popovici John (2001) Self-citation (Arpaci-dusseau) (Correct)
....as SMPs [8] Second, Datamation is an example of an interactive parallel application. For parallelism to become commonplace, interactive applications must become a reality. Third, interactive parallel jobs are particularly sensitive to performance fluctuations that occur in large scale systems [3]. Thus, if the Datamation sort runs consistently well upon 0.1 1 10 100 1000 1986 1988 1990 1992 1994 1996 1998 2000 2002 Time (seconds) Year Datamation results during the past 15 years Tsukerman Weinberger Nyberg Arpaci Dusseau Buonadonna Azuma Popovici, Bent, Forney Figure 1: 15 ....
Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. Fail-Stutter Fault Tolerance. In The 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.
Session State: Beyond Soft State - Benjamin Ling Emre (2004) (3 citations) (Correct)
No context found.
Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. Fail-stutter fault tolerance. In Proc. 8th Workshop on Hot Topics in Operating Systems, pages 33--38, Elmau/Oberbayern, Germany, May 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC