首页> 外文会议>IEEE International Conference on Systems, Man, and Cybernetics >A Penalty-based Grouping Genetic Algorithm for Multiple Composite SaaS Components Clustering in Cloud
【24h】

A Penalty-based Grouping Genetic Algorithm for Multiple Composite SaaS Components Clustering in Cloud

机译:一种基于云的多个复合SaaS组件集群中的惩罚分组遗传算法

获取原文

摘要

-Software as a Service (SaaS) in Cloud is getting more and more significant among software users and providers recently. A SaaS that is delivered as composite application has many benefits including reduced delivery costs, flexible offers of the SaaS functions and decreased subscription cost for users. However, this approach has introduced a new problem in managing the resources allocated to the composite SaaS. The resource allocation that has been done at the initial stage may be overloaded or wasted due to the dynamic environment of a Cloud. A typical data center resource management usually triggers a placement reconfiguration for the SaaS in order to maintain its performance as well as to minimize the resource used. Existing approaches for this problem often ignore the underlying dependencies between SaaS components. In addition, the reconfiguration also has to comply with SaaS constraints in terms of its resource requirements, placement requirement as well as its SLA. To tackle the problem, this paper proposes a penalty-based Grouping Genetic Algorithm for multiple composite SaaS components clustering in Cloud. The main objective is to minimize the resource used by the SaaS by clustering its component without violating any constraint. Experimental results demonstrate the feasibility and the scalability of the proposed algorithm.
机译:-Software作为云中的服务(SaaS)在最近在软件用户和提供商中获得了越来越重要的。作为综合应用程序提供的SaaS具有许多好处,包括减少的交付成本,灵活的SaaS功能提供,并降低用户订阅费用。然而,这种方法在管理分配给复合SaaS的资源时引入了一个新问题。由于云的动态环境,在初始阶段完成的资源分配可能会过载或浪费。典型的数据中心资源管理通常触发SaaS的放置重新配置,以便保持其性能以及最小化所使用的资源。此问题的现有方法通常会忽略SaaS组件之间的基础依赖项。此外,重新配置还必须在资源要求,放置要求以及SLA方面遵守SaaS限制。为了解决问题,本文提出了一种基于云中的多个复合SaaS组件聚类的惩罚分组遗传算法。主要目的是通过在不违反任何约束的情况下聚类其组分来最小化SaaS使用的资源。实验结果表明了所提出的算法的可行性和可扩展性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号