Dynamic evolution in a survivable application infrastructure

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn , Issue , 2006, Pages 503-509

  Thorvaldsson, Haraldur D ^a   Goldman, Kenneth J ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Byzantine fault tolerance; Configurable distributed systems; Dynamic evolution; Fault tolerant systems

Indexed keywords

BYZANTINE QUORUMS; INSTALLATION MESSAGE COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

SYSTEMS ANALYSIS;

EID: 38049115182     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
2. H. D. Thorvaldsson and K. Goldman. Architecture and Execution Model for a Survivable Work Flow Architecture Infrastructure. Technical Report WUCSE-2005-61, 2005.
3. M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In 3rd USENIX OSDI, 1999.
4. S. Pallemulle, I. Wehrman, and K. Goldman. Byzantine Fault Tolerant Execution of Long-running Distributed Applications. In 18th IASTED Paralell and Distributed Computing and Systems, 2006.
5. J. Kramer and J. Magee. The Evolving Philosophers Problem: Dynamic Change Management. IEEE Trans. Softw. Eng., 16(11): 1293-1306, 1990.
6. R. S. Fabry. How to design a system in which modules can be changed on the fly. In 2nd ICSE, pages 470-476, 1976.
7. I. Lee. A Dynamic Modication System. PhD thesis, Department of Computer Science, University of Wisconsin, 1983.
8. O. Frieder and M. E. Segal. On dynamically updating a computer program: from concept to prototype. Journal of Systems and Software, 14(2): 111-128, 1991.
9. M. Hicks, J. T. Moore, and S. Nettles. Dynamic software updating. In ACM SIGPLAN, pages 13-23, 2001.
10. D. Gupta and P. Jalote. On-line Software Version Change Using State Transfer Between Processes. Software - Practice and Experience, 23(9):949-964, 1993.
11. T.Bloom. Dynamic Module Replacement in a distributed programming system, PhD thesis 1983. Technical Report MIT/LCS/TR-303.
12. M. E. Segal and O. Frieder. Dynamically updating distributed software: supporting change in uncertain and mistrustful environments. In IEEE Conf. on Software Maintenance, pages 254-261, 1989.
13. J. Kramer and J. Magee. Dynamic configuration for distributed systems. IEEE Trans. Softw. Eng., 11(4):424-436, 1985.
14. J. Purtillo and C. Hofmeister. Dynamic reconfiguration of distributed programs. In 11th IEEE ICDCS, pages 560-571, 1991.
15. B. Swaminathan and K. J. Goldman. Dynamic reconfiguration with I/O Abstraction. IEEE Symposium on Parallel and Distributed Proceessing, pages 496-501, 1995.
16. K. Moazami-Goudarzi and J. Kramer. Maintaining Node Consistency in the Face of Dynamic Change. In 3rd IEEE ICCDS, page 62, 1996.
17. D. Gupta, P. Jalote, and G. Barua. A Formal Framework for On-line Software Version Change. IEEE Trans. Softw. Eng., 22(2):120-131, 1996.
18. I. Warren and I. Sommerville. A model for Dynamic Configuration which Preserves Application Integrity. In 3rd. Intl. Conf. on Configurable Distr. Systems, page 81, 1996.
19. H. Evans and P. Dickman. Zones, contracts and absorbing changes: an approach to software evolution. In 15th ACM OOPSLA, pages 415-434, 1999.
20. C. Bidan, V. Issarny, T. Saridakis, and A. Zarras. A Dynamic Reconfiguration Service for CORBA. In 4th Intl. Conf. on Configurable Distr. Systems, pages 35-42, 1998.
21. C. Karamanolis and J. Magee. A Replication Protocol to Support Dynamically Configurable Groups of Servers. In 3rd. Int'l Conf. on Configurable Distributed. Systems, pages 161-168, 1996.
22. L. A. Tewksbury, L. E. Moser, and P. M. Melliar-Smith. Live Upgrades of CORBA Applications Using Object Replication. In IEEE ICSM, page 488, 2001.
23. L. E. Moser, P. M. Melliar-Smith, and P. Narasimhan. Consistent object replication in the Eternal system. Theor. Pract. Object Syst., 4(2):81-92, 1998.
24. T. Bloom and M. Day. Reconfiguration and module replacement in argus: Theory and practice. IEE Softw. Engineering Journal, 8(2), 1993.
25. S. Ajmani, B. Liskov, and L. Shrira. Scheduling and Simulation: How to Upgrade Distributed Systems. In USENIX HotOS-IX, 2003.
26. C. Boyapati, B. Liskov, L. Shrira, C. Moh, and S. Richman. Lazy modular upgrades in persistent object stores. In 18th ACM SIGPLAN, pages 403-417, 2003.
27. T. Senivongse. Enabling Flexible Cross-Version Interoperability for Distributed Services. In Intl. Symposium on Dist. Objects and Applications, Edinburgh, UK, 1999.
28. G. Hjálmtýsson and R. Gray. Dynamic C++ classes - A Lightweight mechanism to update code in a running program. In USENIX Annual Technical Conference, 1998.
29. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv., 22(4):299-319, 1990.
30. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. ACM, 32(4):824-840, 1985.
31. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Trans. on Information Theory, IT-22(6):644-654, 1976.
32. R. L. Rivest, A. Shamir, and L. M. Adelman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Technical Report MIT/LCS/TM-82, 1977.
33. A. Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
34. M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2): 133-138, 1988.
35. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM PODC, pages 101-111, 1998.
36. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
37. D. Malkhi and M. Reiter. Byzantine quorum systems. In 29th ACM STOC, pages 569-578, 1997.