International Business Machines Corporation

Todd M Tosseth

Juan A Coronado

Jennifer Shinobu Shioya

Lisa R Martinez

Various embodiments for priority based depopulation of ranks in a computing storage environment are provided. In one embodiment, a method comprises prioritizing a plurality of ranks selected for depopulation. Highest priority and lowest priority ranks are marked and selected for depopulation. Lower priority ranks are placed in a queue in order of priority. An extent of one of the lower priority ranks is migrated to a rank not selected for depopulation. One of the lower priority ranks with newer data is selected for executing a read operation in response to a read operation to one of the lower priority ranks. At least one of the highest priority ranks is depopulated to at least one of a plurality of targeted ranks. The highest priority rank is left as unassigned to one of the plurality of targeted ranks until determining if the highest priority rank is to be assigned the targeted ranks.

Priority based depopulation of storage ranks

For a distributed high performance pool, the distributed high performance pool is provided with a fast rank. A management module promotes an extent from a storage pool to the distributed high performance pool in response to the extent satisfying promotion criteria. The distributed high performance pool and the storage pool are logically and physically distinct.

Distributed high performance pool

Exemplary method, system, and computer program product embodiments for priority based depopulation of ranks in a computing storage environment are provided. In one embodiment, by way of example only, multiple ranks selected for depopulation are prioritized. The highest priority rank of the multiple ranks is depopulated to a target rank. Additional system and computer program product embodiments are disclosed and provide related advantages.

Growing community of inventors

Vail, AZ, United States of America

Todd M Tosseth