skip to main content
10.1145/584369.584380acmconferencesArticle/Chapter ViewAbstractPublication PagesicpeConference Proceedingsconference-collections
Article

Optimizing systems by work schedules: (a stochastic approach)

Published:24 July 2002Publication History

ABSTRACT

Many systems have very predictable points in time where the usage of a network changes. These systems are usually characterized by shift changes where the manning and functions performed change from shift to shift. We propose a pro-active optimization approach that uses predictable indicators like manning schedules, season, mission, and other foreseeable periodic events to configure distributed object servers. Object-Oriented computing is fast becoming the de-facto standard for software development and distributed object servers are becoming more common as transaction rates increase.Optimal deployment strategies for object servers change due to variations in object servers, client applications, operational missions, hardware modifications, and various other changes to the environment.As distributed object servers become more prevalent, there is more need to optimize the deployment of object servers to best serve the end user's changing needs. A system that automatically generates object server deployment strategies would allow users to take full advantage of their network of computers.The proposed method profiles object servers, client applications, user inputs and network resources. These profiles determine an optimization model that is solved to produce an optimal deployment strategy for the predicted upcoming usage by the users of the system of computers and servers.The validity of the model was tested by experimental measurement. A test bed was created and different manning schedules were simulated. The results of the experimentation showed that the average response time for a user could be improved by altering the deployment of the servers according to the scheduled manning of the system. The model was robust in the sense that the deployments that produced optimal response times in the model also produced optimal or near-optimal response times in the actual implementation of the test-bed.

References

  1. Adler, R., "Distributed Coordination Models for Client/Server Computing," IEEE Transactions on Computers, pp. 14-22, April 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Berzins, V. and Luqi, "Software Engineering with Abstractions", chapter 6, Addison-Wesley, ISBN 0-201-08004-4, 1991.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Foster, I., Kesselman, C., Tuecke, S., "The Anatomy of the Grid: Enabling Scalable Virtual Organizations," International. Journal on Supercomputer Applications, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Foster, I., Roy, A., Sander, V., Winkler, L., "End-to-End Quality of Service for High-End Applications," IEEE Journal on Selected Areas in Communications Special Issue on QoS in the Internet, 1999.]]Google ScholarGoogle Scholar
  5. Hsiao, C., King, C., "The Thread-Based Protocol Engines for CC-NUMA Multiprocessors," International Conference on Parallel Processing 2000 Proceedings, pp. 497-504.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Kim, J., Lee, H. and Lee, S., "Replicated Process Allocation for Load Distribution in Fault-Tolerant Multicomputers," IEEE Transactions on Computers, vol. 46, no. 4, pp. 499-505, April 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Loh, P., Hsu, W., Wentong, C. and Sriskanthan, N., "How Network Topology Affects Dynamic Load Balancing," IEEE Transactions on Parallel and Distributed Technology, vol. 4, no. 3, pp. 25-35, Fall 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Luckham, D. and Frasca, B., "Complex Event Processing in Distributed Systems," Computer Systems Laboratory Technical Report CSL-TR-98-754. Stanford University, Stanford, 1998.]]Google ScholarGoogle Scholar
  9. Luckham, D. and Vera, J., "An Event-Based Architecture Definition Language," IEEE Transactions on Software Engineering, Vol 21, No 9, pp.717-734. Sep. 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lui, J., Muntz, R. and Towsley, D., "Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach," IEEE Transactions on Computers. Vol 44, No. 12, December 1995, pp. 1371-1382.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Mehra, P. and Wah, B., "Synthetic Workload Generation for Load-Balancing Experiments," IEEE Transactions on Parallel and Distributed Technology, vol. 3, no. 3, pp. 4-19, Fall 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Perrochon, L., Mann, W., Kasriel, S. and Luckham, D., "Event Mining with Event Processing Networks," The Third Pacific-Asia Conference on Knowledge Discovery and Data Mining. April 26-28, 1999. Beijing, China, 5 pages.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Ray, W., "Optimization of Distributed, Object-Oriented Systems," PhD Dissertation in Software Engineering, Naval Postgraduate School, September 2001.]]Google ScholarGoogle Scholar
  14. Ray, W., Berzins, V. and Luqi, "Adaptive Distributed Object Architectures," AFCEA Federal Database Colloquium 2000 Proceedings, pp. 313-330, September 2000.]]Google ScholarGoogle Scholar
  15. Ray, W. and Farrar, A., "Object Model Driven Code Generation for the Enterprise," IEEE RSP 2001, June 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimizing systems by work schedules: (a stochastic approach)

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  WOSP '02: Proceedings of the 3rd international workshop on Software and performance
                  July 2002
                  318 pages
                  ISBN:1581135637
                  DOI:10.1145/584369

                  Copyright © 2002 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 24 July 2002

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  WOSP '02 Paper Acceptance Rate35of64submissions,55%Overall Acceptance Rate149of241submissions,62%
                • Article Metrics

                  • Downloads (Last 12 months)1
                  • Downloads (Last 6 weeks)0

                  Other Metrics

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader