- Sponsor:
- sigops
No abstract available.
Proceeding Downloads
Higher SLA satisfaction in datacenters with continuous VM placement constraints
In a virtualized datacenter, the Service Level Agreement for an application restricts the Virtual Machines (VMs) placement. An algorithm is in charge of maintaining a placement compatible with the stated constraints.
Conventionally, when a placement ...
Using big data for more dependability: a cellular network tale
There are many large infrastructures that instrument everything from network performance metrics to user activities. However, the collected data are generally used for long-term planning instead of improving reliability and user experience in real time. ...
An untold story of redundant clouds: making your service deployment truly reliable
To enhance the reliability of cloud services, many application providers leverage multiple cloud providers for redundancy. Unfortunately, such techniques fail to recognize that seemingly independent redundant clouds may share third-party infrastructure ...
Towards transparent hardening of distributed systems
In distributed systems, errors such as data corruption or arbitrary changes to the flow of programs might cause processes to propagate incorrect state across the system. To prevent error propagation in such systems, an efficient and effective technique ...
Towards Byzantine fault tolerant publish/subscribe: a state machine approach
More than a decade of research has gone into techniques aimed at tolerating arbitrary failures in client/server interaction, using consensus based replication. These works made Byzantine fault tolerance possible [5], competitive [18], robust [7], and ...
Towards privacy-preserving fault detection
In this paper, we discuss the problem of detecting general faults in distributed systems that handle confidential information. Detecting non-crash faults is difficult in this setting because, to check the behavior of a given node, we need to know its ...
Verifying the correctness of remote executions: from wild implausibility to near practicality
How can we trust results computed by a third party, or the integrity of data stored by such a party? This is a classic question in systems security, and it is particularly relevant today, as much computation is now outsourced: it is performed by ...
Towards efficient, portable application-level consistency
- Thanumalayan Sankaranarayana Pillai,
- Vijay Chidambaram,
- Joo-Young Hwang,
- Andrea C. Arpaci-Dusseau,
- Remzi H. Arpaci-Dusseau
Applications employ complex protocols to ensure consistency after system crashes. Such protocols are affected by the exact behavior of file systems. However, modern file systems vary widely in such behavior, reducing the correctness and performance of ...
PSCloud: a durable context-aware personal storage cloud
Personal content from mobile devices is often irreplaceable, yet current solutions for managing and synchronizing this data across multiple devices to ensure durability are often limited. A common approach is to synchronize data through a cloud storage ...
Towards effective and efficient search-based deterministic replay
Deterministic replay tools are a useful asset when it comes to pinpoint hard-to-reproduce bugs. However, no sweet spot has yet been found with respect to the trade-off between recording overhead and bug reproducibility, especially in the context of ...
Behave or be watched: debugging with behavioral watchpoints
Finding, understanding, and fixing bugs in an operating system is challenging. Dynamic binary translation (DBT) systems provide a powerful facility for building program analysis and debugging tools. However, DBT abstractions are too low-level and ...
Techniques for efficient in-memory checkpointing
Checkpointing is a pivotal technique in system research, with applications ranging from crash recovery to replay debugging. In this paper, we evaluate a number of in-memory checkpointing techniques and compare their properties. We also present a new ...
Index Terms
- Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
HotDep '13 | 21 | 11 | 52% |
Overall | 21 | 11 | 52% |