International Business Machines Corporation

Other

Michael T Benhase

Lokesh M Gupta

Matthew J Kalos

Brent Cameron Beardsley

Kevin J Ash

Kenneth Wayne Todd

Binny Sher Gill

Joseph S Hyde, Ii

Sonny Earl Williams

Evangelos Stavros Eleftheriou

Roman Alexander Pletka

Robert Haas

Carol Santich Mellgren

Ioannis Koltsidas

Theresa Mary Brown

Andrew Dale Walls

Karl Allen Nielsen

Gail Andrea Spear

Stephen LaRoux Blinick

Robert Louis Morton

Xiao-Yu Hu

Yu-Cheng Hsu

Cheng-Chung Song

Warren Keith Stanley

Susan Kay Candelaria

Thomas Charles Jarvis

Gary William Batchelor

James Chien-Chiung Chen

David Blair Whitworth

Alfred Emilio Sanchez

Trung Ngoc Nguyen

Lee Charles LaFrese

Dharmendra S Modha

Carl Evan Jones

Brian Anthony Rinaldi

Michael Howard Hartung

Mark L Lipets

Roger Gregory Hathorn

James Lee Hafner

Shachar Fienblit

David Alan Burton

Brian D Hatfield

David Frank Mannenbach

John Norbert McCauley

Said Abdullah Ahmad

Juan Antonio Yanes

Will A Wright

Patricia Ching Lu

Richard Anthony Ripberger

Bruce McNutt

Paul Henri Muench

Suguang Li

Lawrence Carter Blount

Andrew Boyce McNeill, Jr

Minh-Ngoc Le Huynh

Keith Anthony Bello

Gregg Steven Lucas

Daniel Frank Moertl

William Frank Micka

Juan A Coronado

Rivka Mayraz Matosevich

Jaishankar Moothedath Menon

Steven Edward Klein

Theodore Timothy Harris, Jr

Ian David Judd

Yan Xu

Nedlaya Yazzie Francisco

James T Brady

John Richard Paveza

Michael Anthony Ko

Chung Man Fung

Damon W Finney

Carol Spanel

James C Chen

Mark Albert Reid

Michael John Palmer

Robert Earl Medlin

Donald J Lang

Thomas Anthony Gregg

Beth Ann Peterson

James Stephen Fields, Jr

David F Craddock

Bruce Gerard Mealey

Todd Charles Sorenson

Robert Akira Kubo

Lawrence Yiumchee Chiu

Adalberto Guillermo Yanes

Robert Alan Cargnoni

Enrique Q Garcia

Micah Robison

Louis Alonso Rasor

Michael John Mayfield

David Ray Kahler

Kevin Lee Gibble

Shanker Singh

William Griswold Sherman

Robert Wesley Shomler

Andrew B McNeill

Paul Hodges

Paul Richards

Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.

Replicating tracks from a first storage site to a second and third storage sites

For efficient task scheduling using a locking mechanism, a new task is allowed to spin on the locking mechanism if a number of tasks spinning on the locking mechanism is less than a predetermined threshold for parallel operations requiring locks between the multiple threads.

Efficient task scheduling using a locking mechanism

For thresholding task control blocks (TCBs) for staging and destaging, a first tier of TCBs are reserved for guaranteeing a minimum number of TCBs for staging and destaging for storage ranks. An additional number of requested TCBs are apportioned from a second tier of TCBs to each of the storage ranks based on a scaling factor that is calculated at predefined time intervals. At least one of the TCBs is freed by those storage ranks executing a number of the TCBs above a maximum number of the TCBs in order to execute only the maximum number of the TCBs.

Thresholding task control blocks for staging and destaging

Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.

Selective space reclamation of data storage memory employing heat and relocation metrics

A set of like tasks to be performed is organized into a first group. A last used processing group assigned to the set of like tasks is stored. The set of like tasks is reassigned to an additional group having a minimal queue length upon a determination that the difference between the queue lengths of the additional processing group and the stored processing group is greater than a predetermined threshold.

Preferential CPU utilization for tasks

The population of data to be admitted into secondary data storage cache of a data storage system is controlled by determining heat metrics of data of the data storage system. If candidate data is submitted for admission into the secondary cache, data is selected to tentatively be evicted from the secondary cache; candidate data provided to the secondary data storage cache is rejected if its heat metric is less than the heat metric of the tentatively evicted data; and candidate data submitted for admission to the secondary data storage cache is admitted if its heat metric is equal to or greater than the heat metric of the tentatively evicted data.

Selective population of secondary cache employing heat metrics

For data management by a processor device in a computing storage environment, a threshold for an amount of Non Volatile Storage (NVS) space to be consumed by any particular logically contiguous storage space in the computing storage environment is established based on at least one of a Redundant Array of Independent Disks (RAID) type, a number of point-in-time copy source data segments in the logically contiguous storage space, and a storage classification. Establishing the threshold for the amount of NVS to be consumed based on the number of point-in-time copy source data segments in the logically contiguous storage space further includes considering resources needed to perform a Copy Source To Target (CST) operation required prior to the point-in-time copy source data segments being destaged.

NVS thresholding for efficient data management

A mechanism is provided in a data processing system. The mechanism determines a maximum queue depth of a queue for each solid state drive in a plurality of solid state drives. A given data block is mirrored between a group of solid state drives within the plurality of solid state drives. The mechanism tracks outstanding input/output operations in a queue for each of the plurality of solid state drives. For a given read operation to read the given data block, the mechanism identifies a solid state drive within the group of solid state drives based on a number of empty slots in the queue of each solid state drive within the group of solid state drives.

Raid 10 reads optimized for solid state drives

Provided are a computer program product, system, and method for assigning device adaptors to use to copy source extents in source ranks to target extents in target ranks in a copy relation. A determination is made of an order of the target ranks in the copy relation. Target ranks in the copy relation are selected according to the determined order. For each selected target rank, indication is made in a device adaptor assignment data structure of a source device adaptor and target device adaptor of the device adaptors to use to copy the source rank to the selected target rank indicated in the copy relation, wherein indication is made for the selected target ranks according to the determined order. The source ranks are copied to the selected target ranks using the source and target device adaptors indicated in the device adaptor assignment data structure.

Assigning device adaptors to use to copy source extents to target extents in a copy relationship

In one embodiment, a cache manager releases a list lock during a scan when a track has been identified as a track for cache removal processing such as demoting the track, for example. By releasing the list lock, other processors have access to the list while the identified track is processed for cache removal. In one aspect, the position of the previous entry in the list may be stored in a cursor or pointer so that the pointer value points to the prior entry in the list. Once the cache removal processing of the identified track is completed, the list lock may be reacquired and the scan may be resumed at the list entry identified by the pointer. Other features and aspects may be realized, depending upon the particular application.

Cache management of track removal in a cache for storage

For thresholding task control blocks (TCBs) for staging and destaging, a first tier of TCBs are reserved for guaranteeing a minimum number of TCBs for staging and destaging for storage ranks. An additional number of requested TCBs are apportioned from a second tier of TCBs to each of the storage ranks based on a scaling factor that is calculated at predefined time intervals. The scaling factor is multiplied by a total number of a plurality of requests from each of the storage ranks for the TCBs from the second tier of TCBs for determining a maximum number of the TCBs to be allocated to each of the storage ranks.

For data management by a processor device in a computing storage environment, a threshold for an amount of Non Volatile Storage (NVS) space to be consumed by any particular logically contiguous storage space in the computing storage environment is established based on at least one of a Redundant Array of Independent Disks (RAID) type, a number of point-in-time copy source data segments in the logically contiguous storage space, and a storage classification.

Growing community of inventors

Tucson, AZ, United States of America

Michael T Benhase