首页> 外国专利> Implementing Affinity And Anti-Affinity Constraints In A Bundled Application

Implementing Affinity And Anti-Affinity Constraints In A Bundled Application

机译:在捆绑的应用程序中实现亲和力和反亲和力约束

摘要

A new snapshot of a storage volume is created by suppressing write requests. Once pending write requests from the computing nodes are completed, storage nodes create a new snapshot for the storage volume by allocating a new segment to the new snapshot. Subsequent write requests to the storage volume are then performed on the segments allocated to the new snapshot. An orchestration layer implements a bundled application that is provisioned with storage volumes and containers. A snapshot of the application may be created and used to rollback or clone the application. The amount of processing cores, memory, and containers may be increased or decreased based on usage. Components of the bundled application may be assigned to nodes to satisfy affinity and anti-affinity rules. Device sets may be generated according to these rules and used to plan for the assignment of storage volumes and containers of the bundled application.
机译:通过抑制写请求来创建存储卷的新快照。一旦来自计算节点的挂起的写请求完成,存储节点就会通过为新快照分配新段来为存储卷创建新快照。然后,在分配给新快照的段上执行对存储卷的后续写请求。编排层实现捆绑的应用程序,该应用程序配有存储卷和容器。可以创建应用程序的快照,并将其用于回滚或克隆应用程序。处理核心,内存和容器的数量可能会根据使用情况增加或减少。捆绑应用程序的组件可以分配给节点,以满足亲和力和反亲和力规则。设备集可以根据这些规则生成,并用于计划捆绑应用程序的存储卷和容器的分配。

著录项

  • 公开/公告号US2020042392A1

    专利类型

  • 公开/公告日2020-02-06

    原文格式PDF

  • 申请/专利权人 ROBIN SYSTEMS INC.;

    申请/专利号US201816050655

  • 申请日2018-07-31

  • 分类号G06F11/14;G06F17/30;H04L12/24;G06F9/50;G06F9/455;

  • 国家 US

  • 入库时间 2022-08-21 11:19:03

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号