公开(公告)号：US07310343B2

公开(公告)日：2007-12-18

申请号：US10327356

申请日：2002-12-20

申请人： Scott Alan Rhine ,  Sharad Singhal ,  Xiaoyun Zhu

发明人： Scott Alan Rhine ,  Sharad Singhal ,  Xiaoyun Zhu

IPC分类号： H04L12/44

CPC分类号： H04L41/0823 ,  H04L41/0893

摘要： Methods and apparatus for creating a network farm from a tree topology network are disclosed. One method includes receiving a logical specification of the farm, the logical specification specifying at least one of device types required by the farm and a number of devices for each of the device types. The method further includes receiving a communication model for the farm, the communication model specifying expected bandwidth usage for devices of the farm. The method additionally includes ascertaining, responsive to the logical specification and the communication model, a solution set of devices among devices of the tree topology network for constructing the farm. The ascertaining includes performing partitioned greedy recursion on switching elements of the tree topology network, which includes recursively ascertaining, starting from the top level of the tree topology network and recursing toward the lowest switching element level of the tree topology network, the lowest cost solution at each switching element level of the tree topology network, wherein the lowest cost solution that completely satisfies resource requirements of the farm and that is found after the tree topology network is traversed by the partitioned greedy recursion is deemed the solution set of devices.

摘要翻译： 公开了从树形拓扑网络创建网络场的方法和装置。 一种方法包括接收场的逻辑规范，指定服务器场所需的设备类型中的至少一种的逻辑规范以及每种设备类型的多个设备。 所述方法还包括接收所述场的通信模型，所述通信模型指定所述场的设备的预期带宽使用。 该方法还包括根据逻辑规范和通信模型来确定用于构建农场的树状拓扑网络的设备之间的解决方案集合。 确定包括在树形拓扑网络的交换元件上执行划分的贪心递归，其包括从树形拓扑网络的顶层开始并向树拓扑网络的最低​​交换元件级别递归地递归地确定最低成本解决方案 树形拓扑网络的每个交换单元级别，其中完全满足场的资源需求的最低成本解决方案，并且在通过分配的贪心递归遍历树形拓扑网络之后发现的最低成本解决方案被认为是设备的解集。

公开(公告)号：US07360219B2

公开(公告)日：2008-04-15

申请号：US10318822

申请日：2002-12-13

申请人： Scott Alan Rhine

发明人： Scott Alan Rhine

IPC分类号： G06F9/46

CPC分类号： G06F9/5038 ,  G06F2209/5021

摘要： A computer-implemented method for distributing processes among a plurality of resources is disclosed. The processes are associated with a plurality of priority groups. The method includes ascertaining whether a first priority group of the plurality of priority groups is rich, the first priority group of the plurality of groups being deemed rich if the first priority group is entitled to at least a whole one of the plurality of resources, the first priority group of the plurality of groups being deemed poor if the first priority group is entitled to less than the whole one of the plurality of resources. The method also includes distributing processes of the first priority group among at least a first subset of the plurality of resources in accordance with a first computer-implemented methodology if the first priority group is deemed a rich. The method additionally includes distributing processes of the first priority group among at least a second subset of the plurality of resources in accordance with a second computer-implemented methodology if the first priority group is deemed poor, the second computer-implemented methodology being different from the first computer-implemented methodology.

摘要翻译： 公开了一种用于在多个资源之间分配过程的计算机实现的方法。 这些进程与多个优先级组相关联。 所述方法包括：确定所述多个优先级组中的第一优先级组是否是否丰富，如果所述第一优先级组有权使用所述多个资源中的至少一个，则所述多个组中的所述第一优先级组被认为是富， 如果第一优先权组有权小于多个资源中的全部资源，则认为多个组中的第一优先级组被认为很差。 该方法还包括如果第一优先级组被认为是富值，则按照第一计算机实现的方法在多个资源的至少第一子集中的第一优先级组的处理进行分配。 该方法还包括如果第一优先权组被认为是差的，则根据第二计算机实现的方法，在多个资源的至少第二子集中的第一优先权组的分配过程，第二计算机实现的方法与 第一个计算机实现的方法。

公开(公告)号：US07313101B2

公开(公告)日：2007-12-25

申请号：US10327335

申请日：2002-12-20

申请人： Scott Alan Rhine ,  Sharad Singhal ,  Xiaoyun Zhu

发明人： Scott Alan Rhine ,  Sharad Singhal ,  Xiaoyun Zhu

IPC分类号： H04L12/28

CPC分类号： H04L12/44 ,  H04L67/1002

摘要： A computer-implemented method for filtering, responsive to a logical specification of a network farm and a communication model for the farm, a tree topology network specification to obtain a filtered tree topology network specification is disclosed. The filtered tree topology network specification has fewer devices therein relative to the tree topology network specification, devices needed for constructing the farm being available in the filtered tree topology network specification. The method includes removing a first set of devices and a first set of switching elements from the tree topology network specification starting at the lowest level of the tree topology network specification and working toward the root node of the tree topology network specification. Each device in the first set of devices represents one of a redundant device, a device having a type unneeded by the farm, and a device unavailable for constructing the farm. Each switching element in the first set of switching elements represents a switching element whose children devices are all members of the first set of devices.

摘要翻译： 公开了一种用于响应于场场的逻辑规范和场的通信模型进行过滤的计算机实现的方法，获得过滤的树状拓扑网络规范的树形拓扑网络规范。 过滤的树状拓扑网络规范相对于树形拓扑网络规范具有较少的设备，在过滤的树状拓扑网络规范中，构建服务器场所需的设备是可用的。 该方法包括从树形拓扑网络规范的最低级别开始从树形拓扑网络规范中移除第一组设备和第一组交换单元，并朝树形拓扑网络规范的根节点工作。 第一组设备中的每个设备表示冗余设备中的一个，具有农场不需要的类型的设备以及不可用于构建场的设备。 第一组开关元件中的每个开关元件表示其子设备都是第一组设备的所有成员的开关元件。