INADVERTENT FREED STORAGE RECOVERY

    公开(公告)号:US20140019800A1

    公开(公告)日:2014-01-16

    申请号:US13547659

    申请日:2012-07-12

    IPC分类号: G06F11/07

    摘要: An abnormal termination recovery is performed where storage is referenced shortly after the storage has been freed. More specifically, when storage is freed, and that storage is accessed, an abnormal termination error (e.g., a page translation exception event) occurs due to referencing storage that has not been obtained. When the abnormal termination error occurs, an abnormal termination recovery operation is accessed. The abnormal termination recovery operation scans a history of storage freeing operations (e.g., FREEMAIN operations) to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space. If the storage location was recently freed, then the abnormal termination recovery operation reverses the storage freeing operation by issuing a storage obtaining operation (e.g., a GETMAIN operation) to re-obtain the storage.

    摘要翻译: 在存储被释放后不久就会进行存储的情况下执行异常终止恢复。 更具体地,当存储被释放并且存储被访问时,由于引用了尚未获得的存储而发生异常终止错误(例如,翻译异常事件)。 当异常终止错误发生时,访问异常终止恢复操作。 异常终止恢复操作扫描存储释放操作(例如FREEMAIN操作)的历史,以确定最近是否在同一地址空间内释放引起异常终止错误的存储访问访问的存储位置。 如果存储位置最近被释放,则异常终止恢复操作通过发出存储获取操作(例如,GETMAIN操作)来重新获得存储来反转存储释放操作。

    Inadvertent freed storage recovery
    2.
    发明授权
    Inadvertent freed storage recovery 有权
    无意中释放存储恢复

    公开(公告)号:US09047185B2

    公开(公告)日:2015-06-02

    申请号:US13547659

    申请日:2012-07-12

    IPC分类号: G06F11/00 G06F11/07 G06F11/14

    摘要: An abnormal termination recovery is performed where storage is referenced shortly after the storage has been freed. More specifically, when storage is freed, and that storage is accessed, an abnormal termination error (e.g., a page translation exception event) occurs due to referencing storage that has not been obtained. When the abnormal termination error occurs, an abnormal termination recovery operation is accessed. The abnormal termination recovery operation scans a history of storage freeing operations (e.g., FREEMAIN operations) to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space. If the storage location was recently freed, then the abnormal termination recovery operation reverses the storage freeing operation by issuing a storage obtaining operation (e.g., a GETMAIN operation) to re-obtain the storage.

    摘要翻译: 在存储被释放后不久就会进行存储的情况下执行异常终止恢复。 更具体地,当存储被释放并且存储被访问时,由于引用了尚未获得的存储而发生异常终止错误(例如,翻译异常事件)。 当异常终止错误发生时,访问异常终止恢复操作。 异常终止恢复操作扫描存储释放操作(例如FREEMAIN操作)的历史,以确定最近是否在同一地址空间内释放引起异常终止错误的存储访问访问的存储位置。 如果存储位置最近被释放,则异常终止恢复操作通过发出存储获取操作(例如,GETMAIN操作)来重新获得存储来反转存储释放操作。

    Select pages implementing leaf nodes and internal nodes of a data set index for reuse
    3.
    发明授权
    Select pages implementing leaf nodes and internal nodes of a data set index for reuse 有权
    选择实现叶节点和数据集索引的内部节点以重新使用的页面

    公开(公告)号:US09305112B2

    公开(公告)日:2016-04-05

    申请号:US13619962

    申请日:2012-09-14

    IPC分类号: G06F13/00 G06F13/28 G06F17/30

    摘要: Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set, wherein the leaf nodes include information on members of the data set. The internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes to access the members of the data set. At least one page allocated to the leaf nodes and the internal nodes is selected based on durations during which the allocated pages have not been used. Pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes.

    摘要翻译: 提供了一种用于选择实现叶节点和数据集索引的内部节点的页面以在存储器中重新使用的计算机程序产品,系统和方法。 存储器中的页面被分配给表示数据集的数据集索引的全部或一部分的树数据结构的内部节点和叶节点,其中叶节点包括关于数据集成员的信息。 内部节点包括用于遍历树数据结构以到达叶节点以访问数据集的成员的一个或多个密钥。 基于分配的页面未被使用的持续时间来选择分配给叶子节点和内部节点的至少一个页面。 选择分配给叶节点的页面以比分配给内部节点的页面更高的速率进行重用。

    SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE
    4.
    发明申请
    SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE 审中-公开
    选择页面执行数据集索引的叶子和内部重现

    公开(公告)号:US20140082316A1

    公开(公告)日:2014-03-20

    申请号:US13619962

    申请日:2012-09-14

    IPC分类号: G06F12/02

    摘要: Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set, wherein the leaf nodes include information on members of the data set. The internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes to access the members of the data set. At least one page allocated to the leaf nodes and the internal nodes is selected based on durations during which the allocated pages have not been used. Pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes.

    摘要翻译: 提供了一种用于选择实现叶节点和数据集索引的内部节点的页面以在存储器中重新使用的计算机程序产品,系统和方法。 存储器中的页面被分配给表示数据集的数据集索引的全部或一部分的树数据结构的内部节点和叶节点,其中叶节点包括关于数据集成员的信息。 内部节点包括用于遍历树数据结构以到达叶节点以访问数据集的成员的一个或多个密钥。 基于分配的页面未被使用的持续时间来选择分配给叶子节点和内部节点的至少一个页面。 选择分配给叶节点的页面以比分配给内部节点的页面更高的速率进行重用。