Abstract: A method of failure detection in a storage system is performed by the storage system. The method includes detecting a failure in a nonvolatile random access memory device that is in or coupled to a storage device having storage memory. The storage system has multiple NVRAM devices and multiple storage devices that have storage memory. The method includes taking a portion or all of the NVRAM device offline. Taking a portion or all of the NVRAM device offline is responsive to detecting the failure. Taking a portion or all of the NVRAM device off-line is while keeping online the storage memory of the storage device, sufficient ones of the NVRAM devices, and sufficient ones of the storage devices to provide reliable access to data and metadata in the storage system.

Abstract: A method of failure detection in a storage system is performed by the storage system. The method includes detecting a failure in a nonvolatile random access memory device that is in or coupled to a storage device having storage memory. The storage system has multiple NVRAM devices and multiple storage devices that have storage memory. The method includes taking a portion or all of the NVRAM device offline. Taking a portion or all of the NVRAM device offline is responsive to detecting the failure. Taking a portion or all of the NVRAM device off-line is while keeping online the storage memory of the storage device, sufficient ones of the NVRAM devices, and sufficient ones of the storage devices to provide reliable access to data and metadata in the storage system.

Abstract: A method of operating a plurality of blades of a storage system, performed by the storage system, is provided. The method includes writing data stripes across one or more sets of blades of the plurality of blades within resiliency groups, the plurality of blades having computing resources and storage memory, each resiliency group supporting data recovery in case of loss of a specified number of blades of the resiliency group. The method includes transferring data from a first resiliency group to a second resiliency group, responsive to a change in geometry of the storage system.

Abstract: A method of operating a storage system is provided. The method includes detecting differing amounts of storage memory on two or more of a plurality of blades of the storage system and forming a plurality of resiliency groups of blades, based on the differing amounts of storage memory, each resiliency group comprising a subset of the plurality of blades of the storage system supporting data recovery in case of failure of two of the blades of the resiliency group.

Abstract: A method of tracking flash memory in a storage system is provided. The method includes initializing a bad blocks threshold value and marking one or more planes or logical unit numbers (LUNs) of flash memory as bad, responsive to determining that bad blocks in the one or more planes or LUNs meet the bad blocks threshold value. The method includes adjusting the bad blocks threshold value, responsive to exceeding a threshold number or rate of retiring planes or LUNs of flash memory, and repeating the marking and the adjusting, with the bad blocks threshold value capped at a maximum threshold value.

Abstract: A method of operating a storage system is provided. The method includes detecting differing amounts of storage memory on two or more of a plurality of blades of the storage system and forming a plurality of resiliency groups of blades, based on the differing amounts of storage memory, each resiliency group comprising a subset of the plurality of blades of the storage system supporting data recovery in case of failure of two of the blades of the resiliency group.

Abstract: Embodiments are directed towards cloning files in a distributed file system. In response to a request to create file clones, a file cloning application can be employed to generate file clones based on a source file. The file cloning application can generate a new inode for each new file clone and at least one new shadow store. Data blocks from the source file can be transferred to the shadow store. The transferred data blocks can be replaced with reference blocks that point to the data blocks transferred to the shadow store. Likewise, additional reference blocks pointing to data blocks in the shadow store can be generated for the new file clone inodes. Further, the shadow store can maintain reference counters that track the number of reference blocks pointing to each shadow store block. Also, file clones can be generated based on a point-in-time snapshot of the source file.

Abstract: A mechanism for operating a virtual memory is provided in an operating system. The mechanism detects the existence of a central memory loan pool, identifies a segment of memory that is loanable, and transmits an indicator that the segment is available for loaning to the memory loan pool. The operating system contributing memory can monitor its actual memory capacity and reclaim the loaned segment if the amount of memory available to the loaning operating system (OS) gets below a predetermined value.

Abstract: Disclosed is a computer implemented method, apparatus and computer program product for communicating virtual memory page status to a virtual memory manager. An operating system may receive a request to free a virtual memory page from a first application. The operating system determines whether the virtual memory page is free due to an operating system page replacement. Responsive to a determination that the virtual memory page is free due to the operating system page replacement, the operating system inhibits marking the virtual memory page as unused. Finally, the operating system may insert the virtual memory page on an operating system free list.

Abstract: Disclosed is a computer implemented method and apparatus for marking as critical a virtual memory page in a data processing system. An operating system indicates to a virtual memory manager a virtual memory page selected for paging-out to disk. The operating system determines that the data processing system is using a cooperative memory over-commitment. The operating system, responsive to a determination that the data processing system is using cooperative memory over-commitment, marks the virtual memory page as critical, such that the virtual memory page remains in physical memory. The operating system, responsive to marking the virtual memory page as critical, sets the virtual memory page to a page-out state.

Abstract: A modular table tennis game includes a plurality of paddles, a table tennis ball, and an adjustable table, or multiple adjustable tables. The table(s) may be mounted on a support system such as a tripod or other support structure that allows the table(s) to be adjusted in height and tilt. The top of the table(s) may have an opening or openings larger than the table tennis ball penetrating therethrough.

Abstract: A modular table tennis game includes a plurality of paddles, a table tennis ball, and an adjustable table, or multiple adjustable tables. The tables may be mounted on a support system such as a tripod or other support structure that allows the tables to be adjusted in height and tilt. The top of the tables may have an opening or openings larger than the table tennis ball penetrating therethrough.

Abstract: Disclosed is a computer implemented method and apparatus for marking as critical a virtual memory page in a data processing system. An operating system indicates to a virtual memory manager a virtual memory page selected for paging-out to disk. The operating system determines that the data processing system is using a cooperative memory over-commitment. The operating system, responsive to a determination that the data processing system is using cooperative memory over-commitment, marks the virtual memory page as critical, such that the virtual memory page remains in physical memory. The operating system, responsive to marking the virtual memory page as critical, sets the virtual memory page to a page-out state.

Abstract: A method of operating a virtual memory is disclosed. The method can include detecting the existence of a central memory loan pool, determining a segment of memory that is loanable, and transmitting an indicator that the segment is available for loaning to the memory loan pool. The operating system contributing memory can monitor its' actual memory capacity and reclaim the loaned segment if the amount of memory available to the loaning operating system (OS) gets below a predetermined value. Other embodiments are also disclosed.

Abstract: Disclosed is a computer implemented method, apparatus and computer program product for communicating virtual memory page status to a virtual memory manager. An operating system may receive a request to free a virtual memory page from a first application. The operating system determines whether the virtual memory page is free due to an operating system page replacement. Responsive to a determination that the virtual memory page is free due to the operating system page replacement, the operating system inhibits marking the virtual memory page as unused. Finally, the operating system may insert the virtual memory page on an operating system free list.

Abstract: A modular table tennis game includes a plurality of paddles, a table tennis ball, and an adjustable table, or multiple adjustable tables. The tables may be mounted on a support system such as a tripod or other support structure that allows the tables to be adjusted in height and tilt. The top of the tables may have an opening or openings larger than the table tennis ball penetrating therethrough.

Abstract: A method, system and program are provided for allocating a data structure to memory by selecting a page of memory having a free entry, allocating the free entry for exclusive storage of a data element in the data structure, and then updating control information on the selected page with management data specifying that the free entry is allocated. In a selected embodiment, the page of memory is part of a heap of memory pages which is organized so that a page, having at least one free entry and fewer free entries than any other page in the heap, is located at the top of the heap. This allows allocations to proceed first with pages having fewer free entries, thereby promoting pages having all free entries.