@conference {19490,
	title = {Dependable, Online Upgrades in Enterprise Systems},
	booktitle = {OOPSLA{\textquoteright}09 Proceedings of the 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications},
	series = {OOPSLA {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {743 - 744},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Software upgrades are unreliable, often causing downtime or data loss. I propose Imago, an approach for removing the leading causes of upgrade failures (broken dependencies) and of planned downtime (data migrations). While imposing a higher resource overhead than previous techniques, Imago is more dependable and easier to use correctly.},
	keywords = {data migration, Dependability, hidden dependencies, online upgrades, software upgrades},
	isbn = {978-1-60558-768-4},
	url = {http://doi.acm.org/10.1145/1639950.1639993},
	author = {Tudor Dumitras}
}
@conference {18684,
	title = {Performance evaluation of a probabilistic replica selection algorithm},
	year = {2002},
	month = {2002///},
	pages = {119 - 127},
	abstract = {When executing time-sensitive distributed applications, a middleware that provides dependability and timeliness is faced with the important problem of preventing timing failures both under normal conditions and when the quality of service is degraded due to replica failures and transient overload on the server. To address this problem, we have designed a probabilistic model-based replica selection algorithm that allows a middleware to choose a set of replicas to service a client based on their ability to meet a client{\textquoteright}s timeliness requirements. This selection is done based on the prediction made by a probabilistic model that uses the performance history of replicas as inputs. In this paper, we describe the experiments we have conducted to evaluate the ability of this dynamic selection algorithm to meet a client{\textquoteright}s timing requirements, and compare it with that of a static and round-robin selection scheme under different scenarios},
	keywords = {client-server systems, Dependability, distributed object management, dynamic selection algorithm, Middleware, probabilistic model, probabilistic model-based replica selection algorithm, probability, quality of service, real-time systems, replica failures, round-robin selection scheme, static scheme, time-sensitive distributed applications, timeliness, timing failures, transient overload},
	doi = {10.1109/WORDS.2002.1000044},
	author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier}
}
@article {18650,
	title = {An adaptive algorithm for tolerating value faults and crash failures},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {12},
	year = {2001},
	month = {2001/02//},
	pages = {173 - 192},
	abstract = {The AQuA architecture provides adaptive fault tolerance to CORBA applications by replicating objects and providing a high-level method that an application can use to specify its desired level of dependability. This paper presents the algorithms that AQUA uses, when an application{\textquoteright}s dependability requirements can change at runtime, to tolerate both value faults in applications and crash failures simultaneously. In particular, we provide an active replication communication scheme that maintains data consistency among replicas, detects crash failures, collates the messages generated by replicated objects, and delivers the result of each vote. We also present an adaptive majority voting algorithm that enables the correct ongoing vote while both the number of replicas and the majority size dynamically change. Together, these two algorithms form the basis of the mechanism for tolerating and recovering from value faults and crash failures in AQuA},
	keywords = {active replication communication, adaptive algorithm, adaptive fault tolerance, adaptive majority voting algorithm, AQuA architecture, client-server systems, CORBA, crash failures, data consistency, data integrity, Dependability, distributed object management, fault tolerant computing, objects replication, value faults},
	isbn = {1045-9219},
	doi = {10.1109/71.910872},
	author = {Ren,Yansong and Michel Cukier and Sanders,W. H.}
}
