International Business Machines Corporation

Globalfoundries Inc.

Chiahong Chen

John Charles Elliott

William Griswold Sherman

Stephen LaRoux Blinick

Radha K Ramachandran

Lawrence Yiumchee Chiu

Harry M Yudenfriend

Itzhack Goldberg

David Darden Chambliss

Yu-Cheng Hsu

Xue Feng Gao

James Alan Ruddy

David Ray Kahler

Scott A Brewer

Hai Bo Qian

Jimmie Lee Brundidge

Daniel Anson Heffley

Yang Liu

Nicolas Marc Clayton

Cheng-Chung Song

Mark Edward Hill

Yotam Medini

Shan Fan

Herve Gilbert Philippe Andre

Mechanisms for controlling access to storage volumes on the secondary storage system is provided. A determination is made as to whether a first site computing device has sent a notification of a failure condition of a first site. In response to a determination that the notification of the failure condition of the first site has not been received, secondary workloads of a second site computing device are permitted to access storage volumes on the secondary storage system. In response to a determination that the notification of the failure condition of the first site has been received, a mode of operation of the second site is modified from a normal mode of operation to a failure mode of operation. In the failure mode of operation, the storage system controller of the second site blocks at least a portion of access requests from secondary workloads of the second site computing device.

Maximizing use of storage in a data replication environment

In one embodiment, a method includes moving data from an original, unmoved stride from an original array to target stripes of a target stride in a distributed array in response to a determination that all target stripes of the target stride are in a blank state indicating no data is stored therein, delaying movement of the data from the original stride to the target stripes of the target stride in response to a determination that any of the target stripes of the target stride are in an old state indicating unmoved data is stored therein, and moving the data from the original stride to the target stripes of the target stride after delaying and in response to a determination that all the target stripes of the target stride that were in the old state have switched to the blank state.

System and method for transferring traditional raid to distributed array

In one embodiment, a method includes iteratively selecting an original, unmoved stride from an original array until all original strides have been moved, determining a target stride location in a distributed array, determining a state of the target stride from the following states: an old state indicating unmoved data, a blank state indicating no data, and a new state indicating migrated data, determining that all target stripes are blank, moving data from the original stride to the target stripes when all the target stripes are blank, delaying the moving of the data from the original stride to the target stripes in the target stride when any of the target stripes of the target stride are in the old state and waiting until all the target stripes of the target stride are in the blank state, and determining that all original strides from the original array have been moved.

System and method for transferring traditional RAID to distributed array

Updating code of a single processor in a multi-processor system includes commencing of a self-reset of a first processor if a bit is found in a first state, and interrupts associated with the first processor are disabled. Only those system resources exclusively associated with the first processor are reset, and memory transactions associated with the first processor are disabled. An image of the new code is copied into memory associated with the first processor, registers associated with the first processor are reset and the new code is booted by the first processor.

Non-disruptive code update of a single processor in a multi-processor computing system

Provided are a method, system, and computer program product for mapping a source workload pattern for a source storage system to a target workload pattern for a target storage system. A source workload pattern is received from the source storage system having workload access characteristics of source logical addresses at the source storage system. The source workload pattern at the source logical addresses is mapped to a target workload pattern for target logical addresses at the target storage system. The target workload pattern for the target workload addresses is provided to the target storage system to use to determine storage locations in the target storage system to store received replicated data from the source logical addresses at the target logical addresses.

Mapping a source workload pattern for a source storage system to a target workload pattern for a target storage system

A method, apparatus and program storage device that provides a user mode device interface for enabling software reuse. The user mode device interface allows device interface requests to be sent and received, including commands and data structures, via socket communication. A device state machine on the client side is implemented in a set of shared functions that can be incorporated by all applications that want to communicate to a particular service provider. The service provider offers the software functions over a user mode device interface via socket communication. The device state machine on the service provider side is embedded in the socket server implementation. The interaction between the state machines on both client and server sides ensures a device interface request is properly handled.

Method, apparatus and program storage device that provides a user mode device interface

Embodiments relate to a method for data management. An aspect includes a method for assigning storage types to data based on access frequency. Past or historical data associated with current data usage is also considered prior to assignment. Once data frequency access is determined, the current data is assigned to a first tier of a plurality of hierarchical ordered tiers, each tier corresponding to at least one class of storage. In one embodiment, there may be a condition that overrides the assignment with option to override it. The tier assignment may also be preserved the tier so that the current data can be appropriately assigned in the future.

Management of data using inheritable attributes

Embodiments relate to a system and computer program product for data management. An aspect includes a method for assigning storage types to data based on access frequency. Past or historical data associated with current data usage is also considered prior to assignment. Once data frequency access is determined, the current data is assigned to a first tier of a plurality of hierarchical ordered tiers, each tier corresponding to at least one class of storage. In one embodiment, there may be a condition that overrides the assignment with option to override it. The tier assignment may also be preserved so that the current data can be appropriately assigned in the future.

Updating code of a single processor in a multi-processor system includes halting transactions processed by a first processor in the system and processing of transactions by a second processor in the system are maintained. The first processor then receives new code and an operating system running on the first processor is terminated whereby all processes and threads being executed by the first processor are terminated. Execution of a self-reset of the first processor is commenced and interrupts associated with the first processor are disabled. Only those system resources exclusively associated with the first processor are reset, and memory transactions associated with the first processor are disabled. An image of the new code is copied into memory associated with the first processor, registers associated with the first processor are reset and the new code is booted by the first processor.

A sleep function capable of putting a fixed high-priority thread to sleep within a time-window is disclosed. After a sleep request has been made by a fixed high-priority thread via the sleep function, a determination is made whether or not the fixed high-priority thread is awoken before a requested sleep duration under the sleep request. If the fixed high-priority thread is awoken before the requested sleep duration, the number of tasks for the fixed high-priority thread to perform is increased in order to delay the start sleep time of the fixed high-priority thread from a point within a first time-window in which the sleep request was made to an end boundary of the first time-window.

Growing community of inventors

Oro Valley, AZ, United States of America

Chiahong Chen