Deployment optimization of software objects by design-level delay estimation

  • Authors:
  • Omid Bushehrian;Reza Ghanbari Baghnavi

  • Affiliations:
  • Department of Computer Engineering and Information Technology, Shiraz University of Technology, Shiraz, Iran;Department of Computer Engineering and Information Technology, Shiraz University of Technology, Shiraz, Iran

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The quantitative performance evaluation of different deployments of distributed software objects over computational nodes is one of the main activities during the early stages of the design phase and should be supported by automated tools. The important design decision is to finding the optimal placement of objects, from the performance viewpoint, for different input workloads. Each deployment of objects may impose two kinds of delay on the overall performance of the software: first, the communicational delay due to the remote invocations among distributed objects and second, the computational delay due to the resource sharing by two or more concurrently executing object invocations. The object deployment problem can be formulated as an optimization problem to find the optimal deployment for which the total delay is minimal. In this paper an analytical model for delay prediction of object deployments considering the input workload of the software is presented. This model applies the object-oriented load metrics such as object population and object utilization to estimate the total amount of delay corresponding to a given object deployment. To achieve this, a novel method, called delay propagation, is proposed to compute the amount of delay corresponding to each method invocation which affects the overall response time of the software.In order to verify the proposed analytical delay predictor model, a statistical regression-based method is used. Moreover, by comparing the proposed method with the existing deployment optimization methods, which apply the Layered Queueing Networks to evaluate the performance of each deployment in the search space, a significant improvement in efficiency is observed due to the fast evaluation of each deployment instance in the search space.