A survey of migration mechanisms of virtual machines

V Medina, JM García - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
In the virtualization area, replication has been considered as a mechanism to provide high
availability. A high-availability system should be active most of the time, and this is the …

[PDF][PDF] Finding and Reproducing Heisenbugs in Concurrent Programs.

M Musuvathi, S Qadeer, T Ball, G Basler, PA Nainar… - OSDI, 2008 - usenix.org
Concurrency is pervasive in large systems. Unexpected interference among threads often
results in “Heisenbugs” that are extremely difficult to reproduce and eliminate. We have …

Paranoid android: versatile protection for smartphones

G Portokalidis, P Homburg, K Anagnostakis… - Proceedings of the 26th …, 2010 - dl.acm.org
Smartphone usage has been continuously increasing in recent years. Moreover,
smartphones are often used for privacy-sensitive tasks, becoming highly valuable targets for …

Improving software diagnosability via log enhancement

D Yuan, J Zheng, S Park, Y Zhou… - ACM Transactions on …, 2012 - dl.acm.org
Diagnosing software failures in the field is notoriously difficult, in part due to the fundamental
complexity of troubleshooting any complex software system, but further exacerbated by the …

Deterministic replay: A survey

Y Chen, S Zhang, Q Guo, L Li, R Wu… - ACM Computing Surveys …, 2015 - dl.acm.org
Deterministic replay is a type of emerging technique dedicated to providing deterministic
executions of computer programs in the presence of nondeterministic factors. The …

Locking the sky: a survey on IaaS cloud security

LM Vaquero, L Rodero-Merino, D Morán - Computing, 2011 - Springer
Cloud computing is expected to become a common solution for deploying applications
thanks to its capacity to leverage developers from infrastructure management tasks, thus …

ODR: Output-deterministic replay for multicore debugging

G Altekar, I Stoica - Proceedings of the ACM SIGOPS 22nd symposium …, 2009 - dl.acm.org
Reproducing bugs is hard. Deterministic replay systems address this problem by providing a
high-fidelity replica of an original program run that can be repeatedly executed to zero-in on …

A randomized scheduler with probabilistic guarantees of finding bugs

S Burckhardt, P Kothari, M Musuvathi… - ACM SIGARCH …, 2010 - dl.acm.org
This paper presents a randomized scheduler for finding concurrency bugs. Like current
stress-testing methods, it repeatedly runs a given test program with supplied inputs …