This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Model for Adaptable Systems for Transaction Processing
December 1989 (vol. 1 no. 4)
pp. 433-449

Adaptability is an essential tool for managing escalating software costs and to build high-reliability, high-performance systems. Algorithmic adaptability, which supports techniques for switching between classes of schedulers in distributed transaction systems, is modeled. RAID, an experimental system implemented to support experimentation in adaptability, is discussed. Adaptability features in RAID, including algorithmic adaptability, fault tolerance, and implementation techniques for an adaptable server-based design, are modeled.

[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[2] N. A. Alexandridis, "Adaptable software and hardware: Problems and solutions,"IEEE Comput., vol. 19, Feb. 1986.
[3] A. Avizienis, "Fault-tolerant systems,"IEEE Trans. Comput., vol. C-25, pp. 1304-1312, Dec. 1976.
[4] B. Bhargava and S. Browne, "Adaptability to failures using dynamic quorum assignments," Purdue Univ., West Lafayette, IN, Tech. Rep. CSD-TR 886, June 1989.
[5] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[6] D. Barbara, H. Garcia-Molina, and A. Spauster, "Protocols for dynamic vote reassignment," inProc. ACM Conf. Principles Distributed Comput., 1986, pp. 195-205.
[7] B. Bhargava, "Performance evaluation of reliability control algorithms for distributed database system,"J. Syst. Software, vol. 3, pp. 239-264, July 1984.
[8] B. Bhargava, "Transaction processing and consistency control of replicated copies during failures"J. Management Inform. Syst., vol. 4, pp. 93- 112, Oct. 1987.
[9] A. Black, N. Hutchinson, E. Jul, H. Levy, and L. Carter, "Distribution and abstract types in Emerald,"IEEE Trans. Software Eng., vol. SE-12, Dec. 1986.
[10] J. L. Bentley and C. McGeoch, "Worst-case analysis of self-organizing sequential search heuristics," inProc. 20th Allerton Conf. Commun., Contr., Comput., Univ. Illinois, Urbana-Champaign, Oct. 1982, pp. 452-461.
[11] D. Z. Badal and W. McElyea, "A robust adaptive concurrency control for distributed databases," inProc. IEEE INFOCOM, 1984, pp. 382-391.
[12] B. Bhargava, E. Mafla, J. Riedl, and B. Sauder, "Implementation and measurements of an efficient communication facility for distributed database systems," inProc. 5th IEEE Data Eng. Conf., Los Angeles, CA, Feb. 1989.
[13] A. D. Birrell and B. J. Nelson, "Implementing remote procedure calls,"ACM Trans. Comp. Syst., vol. 2, no. 1, pp. 39-59, Feb. 1984.
[14] B. Bhargava, P. Noll, and D. Sabo, "An experimental analysis of replicated copy control during site failure and recovery," inProc. 4th IEEE Data Eng. Conf., Los Angeles, CA, Feb. 1988, pp. 82-91.
[15] B. Bhargava and J. Riedl, "A model for adaptable systems for transaction processing," inProc. 4th IEEE Data Eng. Conf., Los Angeles, CA, Feb. 1988, pp. 40-50.
[16] B. Bhargava and J. Riedl, "The RAID distributed database system,"IEEE Trans. Software Eng., vol. 16, June 1989.
[17] B. Bhargava, J. Riedl, and D. Weber, "An expert system to control an adaptable distributed database system," Purdue Univ., West Lafayette, IN, Tech. Rep. CSD-TR-693, May 1987.
[18] D. R. Cheriton and W. Zwaenepoel, "Distributed process groups in the V kernel,"ACM Trans. Comput. Syst., vol. 3, no. 2, pp. 77-107, May 1985.
[19] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341-370.
[20] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[21] A. Elmagarmid and A. Helal, "Supporting Updates in Heterogeneous Distributed Database Systems,"Proc. Fourth Int'l Conf. Data Engineering, CS Press, Los Alamitos, Calif., Order No. 827, 1988, pp. 564-571.
[22] H. Garcia-Molina, "Elections in a distributed computing system,"ACM Trans. Comput. Syst., vol. C-31, pp. 48-59, Jan. 1982.
[23] J. Goguen, "Reusing and Interconnecting Software Components,"Computer, Feb. 1986, pp. 16-28.
[24] J. Gray, "The transaction concept: Virtues and limitations," inProc. VLDB Conf., Cannes, France, Sept. 1981.
[25] M. Herlihy, "Dynamic quorum adjustment for partitional data,"ACM Trans. Database Syst., vol. 12, no. 2, pp. 170-194, June 1987.
[26] S. Kartashev and S. Kartashev, "Guest editor's introduction: Design for adaptability,"IEEE Comput., pp. 9-15, Feb. 1986.
[27] C. Koelbel, F. Lamaa, and B. Bhargava, "'Efficient implementation of modularity in RAID," inProc. USENIX Workshop on Experiences with Building Distributed (and Multiprocessor) Syst., Ft. Lauderdale, FL, Oct. 1989.
[28] W. H. Kohler, "A survey of techniques for synchronization and recovery in decentralized computer systems,"ACM Computing Surveys, vol. 13, pp. 149-182, June 1981.
[29] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[30] L. Lamport, "Time, clocks, and the ordering of events in a distributed system,"Commun. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[31] G. Lausen, "Concurrency control in database systems: a step towards the integration of optimistic methods and locking," inProc. ACM Computer Conf., 1982, pp. 64-68.
[32] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[33] M. L. Powell and B. P. Miller, "Process migration in DEMOS/MP," inProc. Ninth Symp. Oper. Syst. Principles, Bretton Woods, NH, Oct. 1983, pp. 110-119.
[34] G.J. Popek and B.J. Walker,The Locus Distributed System Architecture, MIT Press, Cambridge, Mass., 1985.
[35] B. Randell, "System structure for software fault tolerance,"IEEE Trans. Software Eng., vol. SE-1, pp. 220-232, June 1975.
[36] R. F. Rashid, "Threads of a new system,"Unix Rev., vol. 4, pp. 37-49, Aug. 1986.
[37] D. P. Reed, "Implementing atomic actions on decentralized data,"ACM Trans. Comput. Syst., vol. 1, pp. 3-23, Feb. 1983.
[38] D. Skeen, "Nonblocking commit protocols," inProc. ACM SIGMOD Conf. Management of Data, Orlando, FL, June 1982, pp. 133- 147.
[39] A. P. Sheth and M. T. Liu, "Integrating locking and optimistic concurrency control in distributed database systems" inProc. 6th Int. Conf. Distributed Comput. Syst., May 1986.
[40] D. Skeen and M. Stonebraker, "A formal model of crash recovery in a distributed system,"IEEE Trans. Software Eng., vol. SE-9, May 1983.
[41] P. Wegner, "Capital-intensive software technology,"IEEE Software, vol. 1, pp. 7-45, July 1984.

Index Terms:
algorithmic adaptability; model; adaptable systems; transaction processing; RAID; fault tolerance; adaptable server-based design; concurrency control; distributed processing; fault tolerant computing; transaction processing
Citation:
B. Bhargava, J. Riedl, "A Model for Adaptable Systems for Transaction Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 4, pp. 433-449, Dec. 1989, doi:10.1109/69.43419
Usage of this product signifies your acceptance of the Terms of Use.