专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5539883A Load balancing of network by maintaining in each computer information regarding current load on the computer and load on some other computers in the network 失效
标题翻译：通过在每台计算机上维护计算机上的当前负载和网络中某些其他计算机上的负载的信息来负载平衡网络
公开(公告)号：US5539883A
公开(公告)日：1996-07-23
申请号：US231352
申请日：1994-04-20
申请人： David Allon , Moshe Bach , Yosef Moatti , Abraham Teperman
发明人： David Allon , Moshe Bach , Yosef Moatti , Abraham Teperman
IPC分类号： G06F13/00 , G06F9/50 , G06F15/16 , G06F15/177
CPC分类号： G06F9/5088
摘要： A method is described of operating a computer in a network of computers using an improved load balancing technique. Logical links are generated between the computer and other computers in the network so that a tree structure is formed, the computer being logically linked to one computer higher up the tree and a number of computers lower down the tree. Stored information is maintained in the computer regarding the current load on the computer and the load on at least some of the other computers in the network by causing the computer periodically to distribute the information to the computers to which it is logically linked, and to receive from the computers similar such information and to update its own information in accordance therewith, so that the information can be used to determine a computer in the network that can accept extra load. A sender-initiated embodiment of the invention includes the further step of, when the computer is overloaded, using the information to determine a computer that can accept extra load and transferring at least one task to that computer. The load balancing technique is scalable, fault tolerant, flexible and supports clustering, thus making it suitable for use in networks having very large numbers of computers.
摘要翻译：描述了使用改进的负载平衡技术在计算机网络中操作计算机的方法。在计算机和网络中的其他计算机之间生成逻辑链接，从而形成树结构，计算机逻辑上链接到树上的一台计算机和树下的多台计算机。通过使计算机周期性地将信息分发到与其逻辑链接的计算机并且接收来自计算机的计算机上的当前负载以及网络中的至少一些其他计算机的负载，存储的信息被保存在计算机中从计算机相似的这样的信息，并根据其更新其自己的信息，使得该信息可以用于确定网络中可以接受额外负载的计算机。本发明的发送方发起的实施例包括以下步骤：当计算机过载时，使用该信息来确定可以接受额外负载并将至少一个任务传送到该计算机的计算机。负载平衡技术具有可扩展性，容错性，灵活性和支持聚类功能，因此适用于具有非常大数量计算机的网络。

2. 发明申请

US20140068077A1 Efficient Resource Management in a Virtualized Computing Environment 审中-公开
标题翻译：虚拟化计算环境中的高效资源管理
公开(公告)号：US20140068077A1
公开(公告)日：2014-03-06
申请号：US13598634
申请日：2012-08-30
申请人： Erez Hadad , Yosef Moatti
发明人： Erez Hadad , Yosef Moatti
IPC分类号： G06F15/16
CPC分类号： G06F9/5027 , G06F9/505
摘要： Systems and methods for allocating resources to service one or more requests, the method comprising: associating with at least one host from among N hosts, in a computing environment, a first value that reflects a probability that servicing a first request will interfere with operations on the host; selecting M hosts out of the N hosts, wherein the N hosts comprise one or more resources for servicing a first request and wherein at least one of the selected M hosts is determined to be at least as suitable as N−M unselected hosts, for the purpose of servicing the first request; and prior to allocation of resources, updating for at least a first host from among the M hosts the corresponding first value to reflect that servicing the first request may interfere with operations pertaining to other previously received requests that are scheduled to be serviced by the first host.
摘要翻译：用于分配资源以服务一个或多个请求的系统和方法，所述方法包括：在计算环境中与N个主机中的至少一个主机相关联，所述第一值反映服务于第一请求的概率将干扰对主人; 从所述N个主机中选择M个主机，其中所述N个主机包括用于服务第一请求的一个或多个资源，并且其中确定所选择的M个主机中的至少一个至少与NM未选择的主机一样适合，服务第一个请求; 并且在资源分配之前，从所述M个主机中为至少第一主机更新相应的第一值以反映对所述第一请求进行服务的所述第一值可能会干扰与被调度为由所述第一主机服务的先前接收到的其他请求有关的操作。

3. 发明申请

US20090013029A1 DEVICE, SYSTEM AND METHOD OF OPERATING A PLURALITY OF VIRTUAL LOGICAL SITES 审中-公开
标题翻译：设备，系统和操作虚拟逻辑站点的方法
公开(公告)号：US20090013029A1
公开(公告)日：2009-01-08
申请号：US11772845
申请日：2007-07-03
申请人： Rhonda L. Childress , Patrick B. Heywood , Dean Har'el Lorenz , Yosef Moatti , Ezra Silvera , Martin Jacob Tross
发明人： Rhonda L. Childress , Patrick B. Heywood , Dean Har'el Lorenz , Yosef Moatti , Ezra Silvera , Martin Jacob Tross
IPC分类号： G06F15/16
CPC分类号： H04L67/1095 , G06F11/2033 , G06F11/2048 , H04L67/1002 , H04L67/1023 , H04L67/1029 , H04L67/1031
摘要： Some demonstrative embodiments of the invention include, for example, devices, systems and methods of operating one or more virtual logical sites. A method may include, for example, running on a server at least one first virtual machine implementing at least part of a first virtual logical site, and at least one second virtual machine implementing at least part of a second virtual logical site interchangeable with the first virtual logical site. Other embodiments are described and claimed.
摘要翻译：本发明的一些演示实施例包括例如操作一个或多个虚拟逻辑站点的设备，系统和方法。方法可以包括例如在服务器上运行实现第一虚拟逻辑站点的至少一部分的至少一个第一虚拟机，以及至少一个第二虚拟机，其实现与第一虚拟逻辑站点可互换的第二虚拟逻辑站点的至少一部分虚拟逻辑站点。描述和要求保护其他实施例。

4. 发明申请

US20070124192A1 Dynamic conversion rate optimization 审中-公开
标题翻译：动态转换率优化
公开(公告)号：US20070124192A1
公开(公告)日：2007-05-31
申请号：US11289234
申请日：2005-11-29
申请人： Yosef Moatti
发明人： Yosef Moatti
IPC分类号： G07G1/00
CPC分类号： G06Q30/02 , G06Q30/0201
摘要： A method for dynamically optimizing the conversion rate of a solicitation over time, the method including selecting a presentation factor in a solicitation, creating at least two versions of the solicitation by varying the factor, determining a conversion rate for each of the versions, presenting one of the versions having the highest conversion rate at a first presentation rate, presenting the other of the versions having the lowest conversion rate at a second presentation rate that is lower than the first presentation rate, and varying any of the presentation rates responsive to a change in the conversion rate of any of the versions.
摘要翻译：一种用于动态优化随时间的招标的转换率的方法，所述方法包括在招标中选择呈现因子，通过改变因素创建至少两个版本的招标，确定每个版本的转换率，呈现一个以第一呈现率具有最高转换率的版本，以低于第一呈现率的第二呈现率呈现具有最低转换率的另一版本，以及响应于改变而改变任何呈现率在任何版本的转换率。

5. 发明授权

US5606679A Method for optimal retrieval of non-volume-specific data 失效
标题翻译：非体积特定数据的最优检索方法
公开(公告)号：US5606679A
公开(公告)日：1997-02-25
申请号：US396038
申请日：1995-02-28
申请人： Oded Cohn , William F. Micka , Yosef Moatti , Kenneth Nagin , Yoram Novick , Efaim Zeidner
发明人： Oded Cohn , William F. Micka , Yosef Moatti , Kenneth Nagin , Yoram Novick , Efaim Zeidner
IPC分类号： G06F3/06 , G06F13/14 , G06F12/02
CPC分类号： G06F3/0601 , G06F2003/0692
摘要： A method and apparatus for improving storage controller throughput and reducing unit control block contention when selecting a Utility Volume for servicing non-specific read requests. Throughput is increased by enabling the storage controller to service non-specific read requests issued against a Utility Volume which is not the same as the device associated with the data that the non-specific read is requesting. The Utility Volume is dynamically selected by considering the current loads on the available devices for both specific and non-specific processing. A Penalty Index is assigned to each volume, wherein the Penalty Index is a weighted average of the specific and non-specific processing. The device having the lowest Penalty Index is selected as the Utility Volume for a session. A Penalty Index evaluation is made at a Reference Point which is further enabled by a random clock to ensure that sessions do not likely pick the same Utility Volume.
摘要翻译：一种用于在选择用于服务非特定读请求的实用程序卷时改进存储控制器吞吐量并减少单元控制块争用的方法和装置。通过使存储控制器能够服务于与非特定读取请求的数据相关联的设备不相同的公用程序卷发布的非特定读取请求来增加吞吐量。通过考虑可用设备上的特定和非特定处理的当前负载来动态选择实用程序卷。罚款指数被分配给每个卷，其中惩罚指数是特定和非特定处理的加权平均值。选择具有最低罚款指数的设备作为会话的实用程序卷。在参考点进行惩罚指数评估，该参考点通过随机时钟进一步启用，以确保会话不太可能选择相同的实用程序卷。

6. 发明授权

US08874457B2 Concurrent scheduling of plan operations in a virtualized computing environment 有权
标题翻译：在虚拟化计算环境中并行调度计划操作
公开(公告)号：US08874457B2
公开(公告)日：2014-10-28
申请号：US12947844
申请日：2010-11-17
申请人： Ofer Biran , Erez Hadad , Evgeny Hazanovich , Yosef Moatti
发明人： Ofer Biran , Erez Hadad , Evgeny Hazanovich , Yosef Moatti
IPC分类号： G06Q10/00 , G06Q10/06
CPC分类号： G06Q10/0637
摘要： Systems and methods for planning the execution of one or more plans in a virtualized computing environment are provided. In one embodiment, the method comprises computing an order for execution for one or more plans, and the corresponding operations in said one or more plans; validating whether a plan and the corresponding operations for the plan may be successfully executed, prior to executing the plan and the corresponding operations; executing the plan and the corresponding operations, in response to a successful validation; and aborting execution of the plan and the corresponding operations, in response to an unsuccessful validation, wherein the validating process takes into consideration impact of other plans that are previously validated and possible changes in the computing environment since time the plan was computed.
摘要翻译：提供了用于在虚拟化计算环境中规划一个或多个计划的执行的系统和方法。在一个实施例中，该方法包括计算一个或多个计划的执行顺序以及所述一个或多个计划中的相应操作; 在执行计划和相应的操作之前，验证计划和计划的相应操作是否可以成功执行; 响应成功验证，执行计划和相应的操作; 并且响应于不成功的验证而中止执行计划和相应的操作，其中验证过程考虑到从计划的计划开始以来已经验证的其他计划以及计算环境中的可能变化的影响。

7. 发明授权

US08789043B2 Optimized placement planning for virtual machines in a network by breaking relocation graph into one or more cores to apply different solutions 失效
标题翻译：通过将重定位图拆分成一个或多个内核来应用不同的解决方案，优化了网络中虚拟机的布局规划
公开(公告)号：US08789043B2
公开(公告)日：2014-07-22
申请号：US12912805
申请日：2010-10-27
申请人： Ofer Biran , Ari Freund , Erez Hadad , Evgeny Hazanovich , Yosef Moatti
发明人： Ofer Biran , Ari Freund , Erez Hadad , Evgeny Hazanovich , Yosef Moatti
IPC分类号： G06F9/455 , G06F9/46
CPC分类号： G06F9/45558 , G06F9/5066 , G06F9/5077 , G06F2009/4557
摘要： Methods and systems for generating a placement plan for one or more virtual machines (VMs) in a computing environment are provided. The method comprises providing, to a computing system, input parameters comprising a current placement for the one or more VMs on one or more hosts in a computing network; a target placement that assigns at least one of the one or more VMs to at least another host in said one or more hosts; and a set of constraints with which both the current placement and the target placement comply.
摘要翻译：提供了用于在计算环境中为一个或多个虚拟机（VM）生成放置计划的方法和系统。该方法包括向计算系统提供包括计算网络中的一个或多个主机上的一个或多个VM的当前位置的输入参数; 将所述一个或多个VM中的至少一个VM分配给所述一个或多个主机中的至少另一个主机的目标布局; 以及当前展示位置和目标展示位置都符合的一组约束条件。

8. 发明授权

US08719623B2 Optimized placement of virtual machines in a network environment 有权
标题翻译：在网络环境中优化虚拟机的放置
公开(公告)号：US08719623B2
公开(公告)日：2014-05-06
申请号：US13753321
申请日：2013-01-29
申请人： Ofer Biran , Erez Hadad , Elliot K. Kolodmer , Dean H. Lorenz , Yosef Moatti
发明人： Ofer Biran , Erez Hadad , Elliot K. Kolodmer , Dean H. Lorenz , Yosef Moatti
IPC分类号： G06F11/07
CPC分类号： G06F9/455 , G06F11/008 , G06F11/2028 , G06F11/203 , G06F11/2041 , G06F2201/815
摘要： Systems and methods for reducing risk of service interruptions for one or more virtual machines (VMs) in a computing environment are provided. The method comprises computing a placement scheme for placing at least one VM on one or more hosts according to a set of placement constraints defined for the VM, wherein the set of placement constraints comprises at least one availability constraint defined for the VM, wherein the availability constraint designates a N resiliency level, wherein N corresponds to number of host failures that may occur before the services provided by the VM are interrupted.
摘要翻译：提供了用于减少计算环境中的一个或多个虚拟机（VM）的服务中断风险的系统和方法。该方法包括计算用于根据为VM定义的一组放置约束将至少一个VM放置在一个或多个主机上的放置方案，其中所述一组放置约束包括为VM定义的至少一个可用性约束，其中可用性约束指定N弹性等级，其中N对应于在VM提供的服务被中断之前可能发生的主机故障的数量。

9. 发明申请

US20130145368A1 OPTIMIZED PLACEMENT OF VIRTUAL MACHINES IN A NETWORK ENVIRONMENT 有权
标题翻译：虚拟机优化在网络环境中的优化
公开(公告)号：US20130145368A1
公开(公告)日：2013-06-06
申请号：US13753321
申请日：2013-01-29
申请人： Brian Ofer , Erez Hadad , Elliot K. Kolodmer , Dean H. Lorenz , Yosef Moatti
发明人： Brian Ofer , Erez Hadad , Elliot K. Kolodmer , Dean H. Lorenz , Yosef Moatti
IPC分类号： G06F9/455
CPC分类号： G06F9/455 , G06F11/008 , G06F11/2028 , G06F11/203 , G06F11/2041 , G06F2201/815
摘要： Systems and methods for reducing risk of service interruptions for one or more virtual machines (VMs) in a computing environment are provided. The method comprises computing a placement scheme for placing at least one VM on one or more hosts according to a set of placement constraints defined for the VM, wherein the set of placement constraints comprises at least one availability constraint defined for the VM, wherein the availability constraint designates a N resiliency level, wherein N corresponds to number of host failures that may occur before the services provided by the VM are interrupted.
摘要翻译：提供了用于减少计算环境中的一个或多个虚拟机（VM）的服务中断风险的系统和方法。该方法包括计算用于根据为VM定义的一组放置约束将至少一个VM放置在一个或多个主机上的放置方案，其中所述一组放置约束包括为VM定义的至少一个可用性约束，其中可用性约束指定N弹性等级，其中N对应于在VM提供的服务被中断之前可能发生的主机故障的数量。

10. 发明授权

US07904540B2 System and method for deploying virtual machines in a computing environment 有权
标题翻译：在计算环境中部署虚拟机的系统和方法
公开(公告)号：US07904540B2
公开(公告)日：2011-03-08
申请号：US12409548
申请日：2009-03-24
申请人： Erez Hadad , Yosef Moatti
发明人： Erez Hadad , Yosef Moatti
IPC分类号： G06F15/173 , G06F9/455 , G06F9/46 , G06F1/00
CPC分类号： G06F9/45558 , G06F9/4856 , G06F2009/4557
摘要： A system and method for planning placement of virtual machines VMs in a computing environment comprising a set of hosting machines HM. The method includes constructing a bipartite directed graph-based model that represents both a current and a target placement states, both including virtual machine nodes v in VM and nodes h in HM. Using a technique of graph pruning, the method iteratively generates a plan for achieving a desired target placement starting from the current placement without temporarily violating any policy or resource constraint. The application of the pruning algorithm to VM deployment automation necessarily defines a new model. The methodology employed safely manages concurrent changes in a datacenter, so that the environment can adjust faster to changing constraints. Furthermore, the present invention allows detection of migration cycles, caused by deadlocked combinations of capacity and policy constraints, and resolving them.
摘要翻译：一种用于在计算环境中规划虚拟机VM的布置的系统和方法，包括一组托管机器HM。该方法包括构建基于二维有向图的模型，其表示当前和目标放置状态，包括VM中的虚拟机节点v和HM中的节点h。使用图形修剪技术，该方法迭代地生成从当前位置开始实现期望目标放置的计划，而不会暂时违反任何策略或资源约束。将修剪算法应用于VM部署自动化必然定义了一种新的模型。所采用的方法安全地管理数据中心的并发更改，以便环境可以更快地调整变化的约束。此外，本发明允许检测由容量和策略约束的僵化组合引起的迁移周期并且解决它们。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式