Competitive algorithms for the dynamic selection of component implementations

IBM Systems Journal

Volumn 42, Issue 1, 2003, Pages 85-97

  Yellin, Daniel M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; SWITCHING;

COMPETITIVE ALGORITHMS;

INFORMATION THEORY;

EID: 0037234738     PISSN: 00188670     EISSN: None     Source Type: Journal    
DOI: 10.1147/sj.421.0085     Document Type: Article

References (21)

1. E. Roman, S. W. Ambler, T. Jewell, and F. Marinescu, Mastering Enterprise JavaBeans, 2nd Edition, John Wiley & Sons, Inc., Hoboken, NJ (December 2001).
2. S. Graham, S. Simeonov, T. Boubez, G. Daniels, D. Davis, Y. Nakamura, and R. Neyama, Building Web Services with Java: Making Sense of XML, SOAP, WSDL and UDDI, Sams Publishing, Indianapolis, IN (December 2001).
3. 3. D. D. Sleator and R. E. Tarjan, "Amortized Efficiency of List Update and Paging Rules," Communications of the ACM 28, No. 2, 202-208 (February 1985).
4. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK (1995).
5. D. Yellin, "Competitive Algorithms for the Dynamic Selection of Component Implementations," unpublished. Available from the author at dmy@us.ibm.com.
6. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Reading, MA (1974).
7. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson, "On the Power of Randomization in Online Algorithms," Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York (1990), pp. 379-386.
8. A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki, "Competitive Randomized Algorithms for Non-Uniform Problems," Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York (January 1990), pp. 301-309.
9. J. Schwartz, "Automatic Data Structure Choice in a Language of Very High Level," Communications of ACM 18, No. 12, 722-728 (1975).
10. J. Ullman, Principles of Database and Knowledge-Base Systems, Volume 2, Computer Science Press, Rockville, MD (1989).
11. K. Hogstedt, D. Kimelman, V. T. Rajan, T. Roth, V. Sreedhar, M. Wegman, and N. Wang, "The Autonomic Performance Prescription," unpublished. Available from the author at wegman@us.ibm.com.
12. N. Medvidovic and R. Taylor, "A Classification and Comparison Framework for Software Architecture Description Languages," IEEE Transactions on Software Engineering 26, No. 1, 70-93 (January 2000).
13. R. Ladin, B. Liskov, and L. Shrira, "A Technique for Constructing Highly Available Distributed Services, Algorithmica 3, 393-420 (1988).
14. R. Alonso, D. Barbara, and H. Garcia Molina, "Data Caching Issues in an Information Retrieval System," ACM Transactions on Database Systems 15, No. 3, 359-384 (1990).
15. Y. Bartal, A. Fiat, and Y. Rabani, "Competitive Algorithms for Distributed Data Management," Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), ACM, New York (May 1992), pp. 39-50.
16. Y. Huang and O. Wolfson, "A Competitive Dynamic Data Replication Algorithm," Proceedings of the Ninth International Conference on Data Engineering (ICDE93), Vienna, Austria, April 1993; IEEE, New York (1993), pp. 310-317.
17. O. Wolfson and S. Jajodia, "An Algorithm for Dynamic Data Distribution," Proceedings of the 2nd Workshop on the Management of Replicated Data (WMRD-II), IEEE, New York (November 1992), pp. 62-65.
18. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. Sleator, "Competitive Snoopy Caching," Algorithmica 3, No. 1, 70-119(1988).
19. A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, and N. E. Yong, "Competitive Paging Algorithms," Journal of Algorithms 12, No. 4, 685-699 (1991).
20. O. Wolfson, S. Jajodia, and Y. Huang, "An Adaptive Data Replication Algorithm," ACM Transactions on Database Systems (TODS) 22, No. 2, 255-314 (1997).
21. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK (1998). See Chapter 9 "Metrical Task Systems."