-
11.发明授权System and method for dynamically controlling weights assigned to consumers competing for a shared resource 失效用于动态控制分配给消费者竞争共享资源的权重的系统和方法公开(公告)号：US07362766B2
公开(公告)日：2008-04-22
申请号：US11166326
申请日：2005-06-24
IPC分类号： H04L12/00
CPC分类号： G06Q10/06
摘要： According to one embodiment, a method comprises scheduling, by a weighted proportional-share scheduler, access of competing flows to a computing service in accordance with respective weights assigned to the competing flows. The method further comprises autonomously determining, by a controller, based at least in part on received performance measurement for the flows, values of the respective weights assigned to the competing flows for achieving respective performance goals desired for the competing flows. When determined by the controller that the values of the respective weights assigned to the competing flows should be changed for achieving the performance goals, the controller communicates the changed values of the respective weights to the weighted proportional-share scheduler.
摘要翻译： 根据一个实施例，一种方法包括通过加权比例共享调度器根据分配给竞争流的相应权重来对竞争流进行计算服务的访问。 该方法还包括至少部分地由控制器至少部分地基于针对流的接收的性能测量来确定分配给竞争流的相应权重的值，以实现竞争流所期望的各自的性能目标。 当由控制器确定为了实现性能目标而改变分配给竞争流的相应权重的值时，控制器将相应权重的改变的值传送给加权比例份额调度器。
-
公开(公告)号：US07240114B2
公开(公告)日：2007-07-03
申请号：US09962512
申请日：2001-09-25
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： G06F17/30067
摘要： Method and system for performing a namespace operation in a distributed file system. The file system is disposed on a plurality of partition servers, and each partition server controls access to a subset of hierarchically-related, shared storage objects. Each namespace operation involves a namespace object and a target object that are part of the shared storage objects. Namespace operations received at each partition server are serialized. In response to an unlink namespace operation, a reference in the namespace object to the target object is removed, and after removal the target object is modified in accordance with the unlink operation. In response to a link operation, the target object is modified consistent with the link operation. After modification of the target object, a reference to the target object is inserted in the namespace object.
摘要翻译： 在分布式文件系统中执行命名空间操作的方法和系统。 文件系统被布置在多个分区服务器上，并且每个分区服务器控制对分层相关的共享存储对象的子集的访问。 每个命名空间操作涉及名称空间对象和作为共享存储对象一部分的目标对象。 在每个分区服务器上接收的命名空间操作都被序列化。 响应于unlink命名空间操作，将删除目标对象的命名空间对象中的引用，并且在删除之后，根据取消链接操作修改目标对象。 响应于链接操作，目标对象被修改为与链接操作一致。 修改目标对象后，将对目标对象的引用插入到命名空间对象中。
-
13.发明申请System and method for dynamically controlling weights assigned to consumers competing for a shared resource 失效用于动态控制分配给消费者竞争共享资源的权重的系统和方法公开(公告)号：US20060294044A1
公开(公告)日：2006-12-28
申请号：US11166326
申请日：2005-06-24
IPC分类号： G06F17/30
CPC分类号： G06Q10/06
摘要： According to one embodiment, a method comprises scheduling, by a weighted proportional-share scheduler, access of competing flows to a computing service in accordance with respective weights assigned to the competing flows. The method further comprises autonomously determining, by a controller, based at least in part on received performance measurement for the flows, values of the respective weights assigned to the competing flows for achieving respective performance goals desired for the competing flows. When determined by the controller that the values of the respective weights assigned to the competing flows should be changed for achieving the performance goals, the controller communicates the changed values of the respective weights to the weighted proportional-share scheduler.
摘要翻译： 根据一个实施例，一种方法包括通过加权比例共享调度器根据分配给竞争流的相应权重来对竞争流进行计算服务的访问。 该方法还包括至少部分地由控制器至少部分地基于针对流的接收的性能测量来确定分配给竞争流的相应权重的值，以实现竞争流所期望的各自的性能目标。 当由控制器确定为了实现性能目标而改变分配给竞争流的相应权重的值时，控制器将相应权重的改变的值传送给加权比例份额调度器。
-
14.发明授权Method and system for generating consistent snapshots for a group of data objects 有权用于为一组数据对象生成一致快照的方法和系统公开(公告)号：US07984254B2
公开(公告)日：2011-07-19
申请号：US12098116
申请日：2008-04-04
IPC分类号： G06F13/00
CPC分类号： G06F11/1458 , G06F2201/82 , G06F2201/84
摘要： Snapshots that are consistent across a group of data objects are generated. The snapshots are initiated by a coordinator, which transmits a sequence of commands to each storage node hosting a data object within a group of data objects. The first command prepares a data object for a snapshot. After a data object has been successfully prepared, an acknowledgment is sent to the coordinator. Once all appropriate acknowledgments are received, the coordinator sends a command to confirm that a snapshot has been created for each data object in the respective group. After receiving this confirmation, the coordinator takes action to confirm or record the successful completion of the group-consistent snapshot.
摘要翻译： 生成一组数据对象中一致的快照。 快照由协调器启动，协调器将一系列命令发送到承载一组数据对象内的数据对象的每个存储节点。 第一个命令准备快照的数据对象。 在数据对象成功准备好之后，将向协调器发送确认。 一旦接收到所有适当的确认，协调器将发送一个命令，以确认已为相应组中的每个数据对象创建快照。 收到此确认后，协调员将采取行动确认或记录成功完成组一致快照。
-
公开(公告)号：US07856419B2
公开(公告)日：2010-12-21
申请号：US12107205
申请日：2008-04-22
IPC分类号： G06F17/30
CPC分类号： H04L67/1095 , G06F3/0617 , G06F3/065 , G06F3/0689
摘要： Consistent replicas of a data object are created using a replication protocol that includes an opportunistic replication phase followed by a consistent replication phase. During the opportunistic replication phase, dirty regions are selected from the data object included in a primary computer and copied to a data object replica included in a secondary computer according to a selection heuristic. During the consistent replication phase, an immutable image of the data object is created by the primary computer and the remaining dirty regions are copied from the immutable image of the data object to the data object replica to create a consistent replica of the data object.
摘要翻译： 使用复制协议创建数据对象的一致副本，该复制协议包括机会复制阶段，后跟一致的复制阶段。 在机会复制阶段期间，根据选择启发式，从包括在主计算机中的数据对象中选择脏区域并将其复制到辅助计算机中包括的数据对象副本中。 在一致复制阶段期间，数据对象的不可变图像由主计算机创建，剩余的脏区域从数据对象的不可变图像复制到数据对象副本，以创建数据对象的一致副本。
-
公开(公告)号：US07617250B2
公开(公告)日：2009-11-10
申请号：US10666577
申请日：2003-09-22
IPC分类号： G06F17/30
CPC分类号： G06F17/30067
摘要： A data model represents semantic information associated with objects stored in a file system. The data model includes a first object identifier, a second object identifier and a relation identifier. The first object identifier identifies a first object stored in the file system. The second object identifier identifies a second object stored in the file system, wherein the second object is related to the first object. The relation identifier identifies a relationship between the first object and the second object.
摘要翻译： 数据模型表示与存储在文件系统中的对象相关联的语义信息。 数据模型包括第一对象标识符，第二对象标识符和关系标识符。 第一个对象标识符标识存储在文件系统中的第一个对象。 第二对象标识符识别存储在文件系统中的第二对象，其中第二对象与第一对象相关。 关系标识符识别第一对象和第二对象之间的关系。
-
公开(公告)号：US20050283487A1
公开(公告)日：2005-12-22
申请号：US10873994
申请日：2004-06-21
IPC分类号： G06F17/00
CPC分类号： G06F3/065 , G06F3/0608 , G06F3/0617 , G06F3/0619 , G06F3/067 , H04L67/1095
摘要： An embodiment of a method of determining a lower bound for a minimum cost of placing data objects onto nodes of a distributed storage system begins with a first step of assigning a placement of a data object to a node and a time interval which meets a benefit criterion. Assignment of the placement of the data object to the node and the time interval comprises assigning the placement of the data object to a node-interval. The method continues with a second step of continuing to assign additional placements of the data object to other node-intervals which each meet the benefit criterion until a performance reaches a performance threshold. The method performs the first and second steps for each of the data objects. The method concludes with a step of calculating a sum of storage costs and creation costs for the placement and the additional placements of the data objects. According to another embodiment, the data object placed in the first and second steps is chosen on a basis of a triplet of the data object, the node, and the interval which meets the benefit criterion.
摘要翻译： 确定将数据对象放置在分布式存储系统的节点上的最低成本的下限的方法的实施方案是从将数据对象的位置分配给节点的第一步骤和满足受益标准的时间间隔开始 。 将数据对象放置到节点和时间间隔的分配包括将数据对象的位置分配给节点间隔。 该方法继续第二步，继续将数据对象的附加布置分配给其他节点间隔，每个节点间隔满足优惠标准，直到性能达到性能阈值。 该方法为每个数据对象执行第一和第二步骤。 该方法的结束是计算存储成本和创建成本以及数据对象的附加布局的步骤。 根据另一个实施例，放置在第一和第二步骤中的数据对象基于数据对象，节点和满足受益标准的间隔的三元组来选择。
-
公开(公告)号：US20050097285A1
公开(公告)日：2005-05-05
申请号：US10698264
申请日：2003-10-30
CPC分类号： G06F12/12
摘要： A method of determining data placement for a distributed storage system with a selection of a heuristic class for placing data objects onto nodes of the distributed storage system. The heuristic class meets a performance requirement and provides a replication cost that is within an allowable limit of a minimum replication cost. The method continues with an instantiation of a data placement heuristic selected from a range of data placement heuristics according to the heuristic class. According to one embodiment, the method concludes with the instantiation of the data placement heuristic. According to another embodiment, the method concludes with an evaluation of a placement of the data objects onto the nodes made according to the data placement heuristic. According to another embodiment, the method continues by iteratively performing the selection of the heuristic class, the instantiation of the data placement heuristic, and the evaluation of the data placement heuristic.
摘要翻译： 一种确定分布式存储系统的数据放置的方法，其具有选择用于将数据对象放置在分布式存储系统的节点上的启发式类。 启发式类满足性能要求，并提供复制成本在允许的最小复制成本限制之内。 该方法继续根据启发式类从数据放置启发式范围中选择的数据放置启发式的实例化。 根据一个实施例，该方法以数据放置启发式的实例化结束。 根据另一个实施例，该方法的结论是将数据对象放置到根据数据放置启发式制造的节点上的评估。 根据另一个实施例，该方法通过迭代地执行启发式类的选择，数据放置启发式的实例化和数据放置启发式的评估来继续。
-
19.发明授权公开(公告)号：US06775673B2
公开(公告)日：2004-08-10
申请号：US10024941
申请日：2001-12-19
IPC分类号： G06F1730
CPC分类号： G06F17/30067 , G06F3/0607 , G06F3/0643 , G06F3/0647 , G06F3/067 , H04L67/1095 , H04L67/1097 , Y10S707/99953
摘要： Method and system for migrating a logical volumes in a distributed file system having multiple partitions servers. Each partition server owns one or more volumes, and each volume including a subset of logically related objects of the file system. In response to a migration request that requests migration of a selected logical volume from a source partition server to the target partition server, an ownership map is updated to indicate the selected logical volume is owned by the target partition server. At the source partition server, forwarding information is stored to reference the target partition server. When the source partition server receives a request for access to the object, the forwarding information is transmitted to the requester.
摘要翻译： 用于迁移具有多个分区服务器的分布式文件系统中的逻辑卷的方法和系统。 每个分区服务器拥有一个或多个卷，每个卷包括文件系统的逻辑相关对象的子集。 响应于请求将所选逻辑卷从源分区服务器迁移到目标分区服务器的迁移请求，更新所有权映射以指示所选逻辑卷由目标分区服务器拥有。 在源分区服务器中，存储转发信息以引用目标分区服务器。 当源分区服务器接收到对对象的访问请求时，转发信息被发送到请求者。
-
20.发明申请公开(公告)号：US20130014104A1
公开(公告)日：2013-01-10
申请号：US13404129
申请日：2012-02-24
申请人： Assaf Natanzon , Tzach Schechner , Oded Kedem , Ziv Kedem , Shlomo Ahal , Christos Karamanolis
发明人： Assaf Natanzon , Tzach Schechner , Oded Kedem , Ziv Kedem , Shlomo Ahal , Christos Karamanolis
IPC分类号： G06F9/455
CPC分类号： G06F9/45558 , G06F3/0619 , G06F3/0653 , G06F3/0665 , G06F3/067 , G06F3/0689 , G06F9/45533 , G06F9/545 , G06F11/1471 , G06F2009/4557 , G06F2009/45579 , G06F2009/45595 , G06F2209/542
摘要： A hypervisor virtual server system, including a plurality of virtual servers, a plurality of virtual disks that are read from and written to by the plurality of virtual servers, a physical disk, an I/O backend coupled with the physical disk and in communication with the plurality of virtual disks, which reads from and writes to the physical disk, a tapping driver in communication with the plurality of virtual servers, which intercepts I/O requests made by any one of said plurality of virtual servers to any one of said plurality of virtual disks, and a virtual data services appliance, in communication with the tapping driver, which receives the intercepted I/O write requests from the tapping driver, and that provides data services based thereon.
-
-
-
-
-
-
-
-
-
搜索结果
37 条记录 (耗时 0.026 秒)
