会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method and apparatus for enforcing capacity limitations in a logically partitioned system
    • 用于在逻辑分区系统中实施容量限制的方法和装置
    • US07096469B1
    • 2006-08-22
    • US09677338
    • 2000-10-02
    • Jeffrey P. KubalaJeffrey M. NickPeter B. Yocom
    • Jeffrey P. KubalaJeffrey M. NickPeter B. Yocom
    • G06F9/46
    • G06F9/5077
    • A method and apparatus for enforcing capacity limitations such as those imposed by software license agreements in an information handling system in which a physical machine is divided into a plurality of logical partitions, each of which is allocated a defined portion of processor resources by a logical partition manager. A software license manager specifies a maximum allowed consumption of processor resources by a program executing in one of the logical partitions. A workload manager also executing in the partition measures the actual consumption of processor resources by the logical partition over a specified averaging interval and compares it with the maximum allowed consumption. If the actual consumption exceeds the maximum allowed consumption, the workload manager calculates a capping pattern and interacts with the logical partition manager to cap the actual consumption of processor resources by the partition in accordance with the calculated capping pattern. To provide additional capping flexibility, partitions are assigned phantom weights that the logical partition manager adds to the total partition weight to determine whether the partition has exceeded its allowed share of processor resources for capping purposes. The logical partition thus becomes a “container” for the licensed program with an enforced processing capacity less than that of the entire machine.
    • 一种用于执行容量限制的方法和装置,例如在信息处理系统中由软件许可协议强加的容量限制,其中物理机被分成多个逻辑分区,每个逻辑分区通过逻辑分区被分配给定义的处理器资源部分 经理。 软件许可证管理器通过在其中一个逻辑分区中执行的程序指定处理器资源的最大允许消耗。 还在分区中执行的工作负载管理器通过逻辑分区在指定的平均间隔内测量处理器资源的实际消耗,并将其与最大允许消耗进行比较。 如果实际消耗超过允许的最大消耗量,则工作负载管理器计算上限模式,并与逻辑分区管理器进行交互,以根据计算的上限模式来限制分区的处理器资源的实际消耗。 为了提供额外的上限灵活性,分区被分配幻影权重,逻辑分区管理器添加到总分区权重,以确定分区是否超过其允许的处理器资源份额以进行封顶。 因此,逻辑分区成为许可程序的“容器”,其强制处理能力小于整个机器的处理能力。
    • 6. 发明授权
    • Method and apparatus for managing central processing unit resources of a logically partitioned computing environment without shared memory access
    • 用于管理逻辑分区计算环境的中央处理单元资源而不进行共享存储器访问的方法和装置
    • US07844709B2
    • 2010-11-30
    • US11533558
    • 2006-09-20
    • Jeffrey D. AmanYuk L. ChanYuksel GunalHiren R. ShahMathew S. ThoennesPeter B. Yocom
    • Jeffrey D. AmanYuk L. ChanYuksel GunalHiren R. ShahMathew S. ThoennesPeter B. Yocom
    • G06F15/173
    • G06F9/5077G06F9/5027
    • A method and apparatus for managing CPU resources of a logically partitioned computing environment without shared memory access. A logical partition needing additional resources sends a message requesting such resources to a central domain manager, which sends messages to other partitions in the same group requesting that they assess their ability to donate resources to the requesting partition. Upon receiving such assessment request, each logical partition assesses its ability to donate resources to the requesting partition and responds accordingly to the domain manager. If at least one partition responds that it can donate resources to the requesting partition, the domain manager sends a message to a selected donor partition requesting that it reconfigure itself to donate resources to the requesting partition. Upon receiving a notification from the donor partition that it has successfully reconfigured itself, the domain manager notifies the requesting partition, which reconfigures itself to accept the donated resources.
    • 一种用于管理逻辑分区计算环境的CPU资源而不进行共享存储器访问的方法和装置。 需要额外资源的逻辑分区将向中央域管理器发送请求这样的资源的消息,该中央域管理器将消息发送到同一组中的其他分区,请求他们评估其向请求分区捐赠资源的能力。 在收到此类评估请求后,每个逻辑分区评估其向请求分区捐赠资源的能力,并相应地响应域管理器。 如果至少一个分区响应它可以向请求分区捐赠资源,则域管理器向选定的供体分区发送一条消息,请求重新配置自己以将资源捐赠给请求分区。 在从捐赠者分区接收到已经成功重新配置的通知之后,域管理器通知请求分区,其重新配置自己以接受所捐赠的资源。
    • 7. 发明授权
    • Method for recovering memory
    • 恢复内存的方法
    • US06832301B2
    • 2004-12-14
    • US09950422
    • 2001-09-11
    • Roman A. BobakCharles E. MariHarris MorgensternJim H. MulderRobert R. RogersDanny R. SutherlandPeter B. Yocom
    • Roman A. BobakCharles E. MariHarris MorgensternJim H. MulderRobert R. RogersDanny R. SutherlandPeter B. Yocom
    • G06F1202
    • G06F12/08G06F12/109G06F12/126
    • In a computing system having swappable and non-swappable address spaces, wherein the computing system includes an operating system that includes a Real Storage Manager (RSM), a Systems Resource Manager (SRM) and a Region Control Task (RCT), a method for recovering swappable fixed non-preferred memory is provided which includes receiving a request from the operating system to configure an area of real memory to create an intercepted swappable address space, wherein the intercepted swappable address space includes a flagged fixed frame element identified for configuration, examining the intercepted swappable address space so as to determine if the intercepted swappable address space will remain swappable, requesting the SRM to coordinate the swapping process, quiescing the intercepted address space, generating a first return code responsive to the intercepted swappable address space remaining swappable, communicating the first return code to the RCT so as to cause the RCT to respond to the first return code, instructing the RSM to proceed based on the first return code, examining the intercepted swappable address space so as to identify the flagged frame elements, exchanging the flagged frame elements with unflagged frame elements, updating dynamic address translation tables, and returning a performance code to the RCT so as to indicate recovery success or recovery failure. A method for recovering swappable fixed non-preferred memory where the originally swappable address space has been converted into non-swappable address space is also provided.
    • 在具有可交换和不可交换的地址空间的计算系统中,其中所述计算系统包括包括真实存储管理器(RSM),系统资源管理器(SRM)和区域控制任务(RCT)的操作系统, 提供恢复可交换的固定非优选存储器,其包括从操作系统接收请求以配置实际存储器的区域以创建拦截的可交换地址空间,其中所拦截的可交换地址空间包括被标识用于配置的标记的固定帧元素,检查 截取的可交换地址空间,以便确定被拦截的可交换地址空间是否将保持可交换,请求SRM协调交换过程,停止截获的地址空间,响应于被截获的可交换的可交换地址空间而产生第一返回码,可交换通信 RCT的第一个返回码,以使RCT对t进行响应 他首先返回代码,根据第一个返回代码指示RSM进行检查,检查被拦截的可交换地址空间,以便识别标记的帧元素,用未标记的帧元素交换标记的帧元素,更新动态地址转换表,并返回 RCT的性能代码,以指示恢复成功或恢复失败。 还提供了一种用于恢复可交换固定非优选存储器的方法,其中原始可交换地址空间已被转换为不可交换地址空间。
    • 9. 发明授权
    • Method and apparatus for controlling the number of servers in a multisystem cluster
    • US06230183B1
    • 2001-05-08
    • US09038573
    • 1998-03-11
    • Peter B. YocomCatherine K. EilertJohn E. Arwe
    • Peter B. YocomCatherine K. EilertJohn E. Arwe
    • G06F1300
    • G06F9/5061G06F9/5083G06F2209/505
    • A method and apparatus for controlling the number of servers in a multisystem cluster. Incoming work requests are organized into service classes, each of which has a queue serviced by servers across the cluster. Each service class has defined for it a local performance index for each particular system of the cluster and a multisystem performance index for the cluster as a whole. Each system selects one service class as a donor class for donating system resources and another service class as a receiver class for receiving system resources, based upon how well the service classes are meeting their goals. Each system then determines the resource bottleneck causing the receiver class to miss its goals. If the resource bottleneck is the number of servers, each system determines whether and how many servers should be added to the receiver class, based upon whether the positive effect of adding such servers on the performance index for the receiver class outweighs the negative effect of adding such servers on the performance measure for the donor class. If a system determines that servers should be added to the receiver class, it then determines the system in the cluster to which the servers should be added, based upon the effect on other work on that system. To make this latter determination, each system first determines whether another system has enough idle capacity and, if so, lets that system add servers. If no system has sufficient idle capacity, each system then determines whether the local donor class will miss its goals if servers are started locally. It not, the servers are started on the local system. Otherwise, each system determines where the donor class will be hurt the least and acts accordingly. To ensure the availability of a server capable of processing each of the work requests in the queue, each system determines whether there is a work request in the queue with an affinity only to a subset of the cluster that does not have servers for the queue and, if so, starts a server for the queue on a system in the subset to which the work request has an affinity.