中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

50 records (took 0.024 seconds)

    Tiered locking of resources
    4.
    发明授权
    Tiered locking of resources 有权
    分层锁定资源

    公开(公告)号：US09250977B2

    公开(公告)日：2016-02-02

    申请号：US13834178

    申请日：2013-03-15

    Applicant: International Business Machines Corporation

    Inventor： Stuart Z. Jacobs ,  David A. Larson

    IPC: G06F12/00 ,  G06F9/46 ,  G06F9/52

    CPC classification number: G06F9/524 ,  G06F9/46 ,  G06F9/526 ,  G06F12/00

    Abstract: In an embodiment, a lock command is received from a thread that specifies a resource. If tier status in a nodal lock indicates the nodal lock is currently owned, an identifier of the thread is added to a nodal waiters list, and if the thread's lock wait indicator indicates that the thread owns the nodal lock, then a successful completion status is returned for the lock command to the thread after waiting until a next tier wait indicator in the nodal lock indicates that any thread owns a global lock on the resource. If the tier status indicates no thread holds the nodal lock, the tier status is changed to indicate the nodal lock is owned, and if a global waiters and holder list is empty, an identifier of a node at which the thread executes is added to the global waiters and holder list.

    Abstract translation: 在一个实施例中，从指定资源的线程接收到锁定命令。 如果节点锁中的层状态表示节点锁当前拥有，线程的标识符将添加到节点服务器列表中，并且如果线程的锁等待指示器指示线程拥有节点锁，则成功完成状态为 在等待直到下一层等待指示符在节点锁中表示任何线程拥有该资源上的全局锁定后，为该线程返回的锁定命令。 如果层状态表示没有线程保存节点锁，则更改层状态以指示节点锁拥有，并且如果全局服务器和持有者列表为空，则将线程执行的节点的标识符添加到 全球服务员和持有人名单。

    Submitting operations to a shared resource based on busy-to-success ratios
    5.
    发明授权
    Submitting operations to a shared resource based on busy-to-success ratios 有权
    根据繁忙到成功的比例将操作提交给共享资源

    公开(公告)号：US09104496B2

    公开(公告)日：2015-08-11

    申请号：US13837113

    申请日：2013-03-15

    Applicant: International Business Machines Corporation

    Inventor： Stuart Z. Jacobs ,  Andrew T. Koch ,  David A. Larson

    IPC: G06F9/455 ,  G06F9/46 ,  G06F9/50 ,  G06F9/48

    CPC classification number: G06F9/5077 ,  G06F9/4887 ,  G06F9/50 ,  G06F2209/504 ,  Y02D10/22

    Abstract: In an embodiment, an average busy-to-success ratio is calculated for partitions that submitted operations to a shared resource during a first time period. A first busy-to-success ratio for a first partition during the first time period is calculated. If the first busy-to-success ratio is greater than the average busy-to-success ratio and a difference between the first busy-to-success ratio and the average busy-to-success ratio is greater than a threshold amount, a throttle amount for the first partition is increased. A first operation from the first partition during a first time subdivision of a second time period is received. If a number of operations received from the first partition during the first time subdivision of the second time period is greater than the throttle amount for the first partition, a busy indication is returned to the first partition and the first operation is not submitted to the shared resource.

    Abstract translation: 在一个实施例中，针对在第一时间段期间向共享资源提交操作的分区计算平均忙到成功率。 计算在第一时间段期间第一分区的第一个忙到成功率。 如果第一个忙到成功率大于平均占线成功率，并且第一繁忙成功率与平均占线成功率之间的差异大于阈值量，则节流阀 第一分区的数量增加。 接收在第二时间段的第一时间细分期间来自第一分区的第一操作。 如果在第二时间段的第一时间细分期间从第一分区接收到的多个操作大于第一分区的油门量，则将忙指示返回到第一分区，并且第一操作未被提交给共享 资源。

    MOVING OBJECTS IN A PRIMARY COMPUTER BASED ON MEMORY ERRORS IN A SECONDARY COMPUTER
    6.
    发明申请
    MOVING OBJECTS IN A PRIMARY COMPUTER BASED ON MEMORY ERRORS IN A SECONDARY COMPUTER 有权
    根据二次计算机中的存储器错误在主计算机中移动对象

    公开(公告)号：US20150026508A1

    公开(公告)日：2015-01-22

    申请号：US13947420

    申请日：2013-07-22

    Applicant: International Business Machines Corporation

    Inventor： Stuart Z. Jacobs ,  David A. Larson

    IPC: G06F11/20

    CPC classification number: G06F11/2094 ,  G06F11/1658 ,  G06F11/1666 ,  G06F11/2035 ,  G06F11/2048 ,  G06F11/2082

    Abstract: In an embodiment, a partition is executed at a primary server, wherein the partition accesses a first memory location at a first memory block address at the primary server. If a first corresponding memory location at a secondary server has an error, wherein the first corresponding memory location at the secondary server corresponds to the first memory location at the primary server, then an object is moved from the first memory location at the primary server to a second memory location at the primary server.

    Abstract translation: 在一个实施例中，在主服务器处执行分区，其中所述分区以主服务器上的第一存储器块地址访问第一存储器位置。 如果辅助服务器上的第一对应的存储器位置具有错误，其中辅助服务器处的第一对应存储器位置对应于主服务器处的第一存储器位置，则将对象从主服务器处的第一存储器位置移动到 主服务器上的第二个内存位置。

Patent Agency Ranking