-
公开(公告)号：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.
摘要翻译： 数据模型表示与存储在文件系统中的对象相关联的语义信息。 数据模型包括第一对象标识符，第二对象标识符和关系标识符。 第一个对象标识符标识存储在文件系统中的第一个对象。 第二对象标识符识别存储在文件系统中的第二对象，其中第二对象与第一对象相关。 关系标识符识别第一对象和第二对象之间的关系。
-
公开(公告)号：US20050076031A1
公开(公告)日：2005-04-07
申请号：US10666577
申请日：2003-09-22
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.
摘要翻译： 数据模型表示与存储在文件系统中的对象相关联的语义信息。 数据模型包括第一对象标识符，第二对象标识符和关系标识符。 第一个对象标识符标识存储在文件系统中的第一个对象。 第二对象标识符识别存储在文件系统中的第二对象，其中第二对象与第一对象相关。 关系标识符识别第一对象和第二对象之间的关系。
-
3.发明授权Method of controlling access to computing resource within shared computing environment 有权控制共享计算环境中计算资源访问的方法公开(公告)号：US07694305B2
公开(公告)日：2010-04-06
申请号：US10972232
申请日：2004-10-21
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： G06F11/3447 , G06F3/0613 , G06F3/0635 , G06F3/0653 , G06F3/067 , G06F11/3409 , G06F11/3485 , G06F11/349 , G06F2201/885 , G06F2206/1012
摘要： An embodiment of a method of controlling access to a computing resource within a shared computing environment begins with a first step of measuring performance parameters for workloads accessing the computing resource to determine a performance parameter vector for the workloads. The method continues with a second step of estimating a controller function for the computing resource by analysis of recent performance parameters and recent throughputs. The controller function comprises a mathematical operation which takes an input and provides an output. In a third step, the method compares the performance parameter vector to a reference performance parameter vector to determine an error parameter. In a fourth step, the method applies the controller function to the error parameter to determine a target throughput for each of the workloads. The method concludes with a fifth step of adjusting access to the computing resource for each work load having a throughput limit different from about the target throughput by reducing or increasing the throughput limit for the workload to about the target throughput.
摘要翻译： 在共享计算环境中控制对计算资源的访问的方法的实施例开始于测量访问计算资源的工作负载的性能参数的第一步骤，以确定工作负载的性能参数向量。 该方法继续第二步，通过分析最近的性能参数和最近的吞吐量来估计用于计算资源的控制器功能。 控制器功能包括一个接受输入并提供输出的数学运算。 在第三步中，该方法将性能参数向量与参考性能参数向量进行比较以确定误差参数。 在第四步中，该方法将控制器功能应用于错误参数，以确定每个工作负载的目标吞吐量。 该方法结束于第五步，通过将工作负载的吞吐量限制减少或提高到目标吞吐量，调整对具有与关于目标吞吐量不同的吞吐量限制的每个工作负载的计算资源的访问。
-
4.发明授权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.
摘要翻译： 根据一个实施例，一种方法包括通过加权比例共享调度器根据分配给竞争流的相应权重来对竞争流进行计算服务的访问。 该方法还包括至少部分地由控制器至少部分地基于针对流的接收的性能测量来确定分配给竞争流的相应权重的值，以实现竞争流所期望的各自的性能目标。 当由控制器确定为了实现性能目标而改变分配给竞争流的相应权重的值时，控制器将相应权重的改变的值传送给加权比例份额调度器。
-
5.发明申请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.
摘要翻译： 根据一个实施例，一种方法包括通过加权比例共享调度器根据分配给竞争流的相应权重来对竞争流进行计算服务的访问。 该方法还包括至少部分地由控制器至少部分地基于针对流的接收的性能测量来确定分配给竞争流的相应权重的值，以实现竞争流所期望的各自的性能目标。 当由控制器确定为了实现性能目标而改变分配给竞争流的相应权重的值时，控制器将相应权重的改变的值传送给加权比例份额调度器。
-
公开(公告)号：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.
摘要翻译： 一种确定分布式存储系统的数据放置的方法，其具有选择用于将数据对象放置在分布式存储系统的节点上的启发式类。 启发式类满足性能要求，并提供复制成本在允许的最小复制成本限制之内。 该方法继续根据启发式类从数据放置启发式范围中选择的数据放置启发式的实例化。 根据一个实施例，该方法以数据放置启发式的实例化结束。 根据另一个实施例，该方法的结论是将数据对象放置到根据数据放置启发式制造的节点上的评估。 根据另一个实施例，该方法通过迭代地执行启发式类的选择，数据放置启发式的实例化和数据放置启发式的评估来继续。
-
公开(公告)号：US07315930B2
公开(公告)日：2008-01-01
申请号：US10698182
申请日：2003-10-30
IPC分类号： G06F12/06
CPC分类号： G06F3/0631 , G06F3/061 , G06F3/067 , H04L67/1097
摘要： An embodiment of a method of selecting a heuristic class for data placement in a distributed storage system begins by forming a general integer program which models the data placement and forming a specific integer program which models a heuristic class for the data placement. The general and specific integer programs each comprising an objective of minimizing a replication cost. The method continues with solving the general integer program which provides a general lower bound for the replication cost and solving the specific integer program which provides a specific lower bound for the replication cost. The method concludes with selecting the heuristic class if a difference between the general lower bound and the specific lower bound is within an allowable amount.
摘要翻译： 选择用于分布式存储系统中的数据放置的启发式类的方法的一个实施例，首先是形成一个通用整数程序，该程序对数据放置进行建模，并形成一个特定的整数程序，该整数程序为数据放置的启发式类建模。 一般和特定的整数程序各自包括最小化复制成本的目标。 该方法继续解决通用整数程序，该程序为复制成本提供了一般的下限，并解决了为复制成本提供特定下限的特定整数程序。 如果一般下界和特定下限之间的差异在允许的量内，则该方法的结论是选择启发式类。
-
9.发明申请Weighted proportional-share scheduler that maintains fairness in allocating shares of a resource to competing consumers when weights assigned to the consumers change 有权加权比例分配调度器，在分配给消费者的权重发生变化时，保持向竞争消费者分配资源的份额的公平性公开(公告)号：US20060280119A1
公开(公告)日：2006-12-14
申请号：US11151159
申请日：2005-06-10
IPC分类号： H04J3/22 , H04J3/16 , G01R31/08 , G08C15/00 , H04L12/26 , G06F11/00 , H04J3/14 , H04J1/16 , H04L1/00
CPC分类号： G06F9/5038 , G06F9/50 , G06F11/3433 , G06F2201/88 , G06F2209/5021 , G06F2209/506
摘要： According to one embodiment, a method comprises receiving at a scheduler a change to a weight assigned to a consumer. The method further comprises utilizing, by the scheduler, a weighted proportional-share scheduling algorithm to maintain fairness in allocating shares of a resource to competing consumers in accordance with the changed weight. According to another embodiment, a system comprises at least one resource, and a plurality of competing consumers desiring to use the resource(s). A scheduler allocates shares of the resource(s) to the competing consumers according to a weighted proportional-share algorithm. A controller monitors at least one of performance of the competing consumers and utilization of the resource(s), and controls the performance and/or utilization by dynamically changing a scheduler parameter. The scheduler maintains fairness in allocating shares of the resource(s) to the competing consumers in accordance with the dynamically changed scheduler parameter.
摘要翻译： 根据一个实施例，一种方法包括在调度器处接收对消费者分配的权重的改变。 该方法还包括由调度器利用加权比例分配调度算法，以根据改变的权重来维持将资源的分配分配给竞争消费者的公平性。 根据另一个实施例，系统包括至少一个资源和多个竞争消费者，期望使用该资源。 调度器根据加权比例分配算法将资源的共享分配给竞争消费者。 控制器监视竞争消费者的性能和资源的利用中的至少一个，并且通过动态地改变调度器参数来控制性能和/或利用率。 调度器根据动态改变的调度器参数维持向竞争消费者分配资源的共享的公平性。
-
公开(公告)号：US20050097284A1
公开(公告)日：2005-05-05
申请号：US10698263
申请日：2003-10-30
CPC分类号： G06F12/0862 , G06F12/12
摘要： An embodiment of a method of determining bounds for a minimum cost begins, by solving an integer program using a relaxation of binary variables to determine a lower bound for the minimum cost. The integer program comprises a performance constraint and an objective of minimizing a cost. The binary variables which have values between zero and one comprise a subset. The method rounds up a first binary variable within the subset having a lowest ratio of a cost penalty to a performance reward. The method then rounds down one or more of the binary variables within the subset until no binary variables within the subset may be rounded down without violating the performance constraint. The method iteratively rounds up one of the binary variables within the subset and then rounds down others until no binary variables remain in the subset. The method concludes with determining an upper bound for the minimum cost according to the binary variables having binary values.
摘要翻译： 通过使用二进制变量的松弛求解整数程序来确定最小成本的下限，开始确定最小成本的边界的方法的实施例。 整数程序包括性能约束和最小化成本的目标。 值为0和1之间的二进制变量包含一个子集。 该方法将具有成本损失与性能奖励的最低比例的子集内的第一个二进制变量进行舍入。 该方法然后舍入子集中的一个或多个二进制变量，直到子集内的二进制变量不被舍入，而不违反性能约束。 该方法迭代地舍入子集中的一个二进制变量，然后向下舍入其他变量，直到子集中不存在二进制变量。 该方法的结论是根据具有二进制值的二进制变量确定最小成本的上限。
-
-
-
-
-
-
-
-
-
搜索结果
37 条记录 (耗时 0.023 秒)
