Object Allocation for Distributed Applications with Complex Workloads

  • Authors:
  • Marin Litoiu;Jerome A. Rolia

  • Affiliations:
  • -;-

  • Venue:
  • TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The architects of today's distributed applications have a wide range of Internet technologies, platforms, and design patterns to choose from. In addition to the usual selection criteria of security, portability, maintainability, and cost, performance often determines the selection of one system architecture over another. This paper presents a quantitative technique that can help an architect understand the expected behaviour of an application deployed within a target environment. The technique automatically finds an object allocation that optimizes a performance metric specified by the architect. The technique supports multiple classes of requests and mean response time requirements for multiple workload conditions. Capacity constraints are also considered. These include device utilization limits and the maximum number of customers. A deployed application is described using a Layered Queuing Model (LQM). Non-linear and linear programming techniques are combined with predictive analytic modeling techniques to efficiently compare application configuration alternatives. Both nonasymptotic (no saturated resources) and asymptotic workload conditions are considered.