发明名称 PRIORITY BASED DEPOPULATION OF STORAGE RANKS
摘要 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.
申请公布号 US2016098228(A1) 申请公布日期 2016.04.07
申请号 US201514965533 申请日期 2015.12.10
申请人 INTERNATIONAL BUSINESS MACHINES CORPORATION 发明人 CORONADO Juan A.;SHIOYA Jennifer S.;TOSSETH Todd M.
分类号 G06F3/06 主分类号 G06F3/06
代理机构 代理人
主权项 1. A method for priority based depopulation of ranks in a computing storage environment by a processor device, comprising: prioritizing a plurality of ranks selected for depopulation; marking at least one of the plurality of ranks as highest priority ranks and selecting the highest priority ranks for the depopulation; marking at least one of the plurality of ranks as lower priority ranks and selecting the lower priority ranks for the depopulation; placing in a queue according to an order of priority those of the plurality of ranks marked as the lower priority ranks, wherein the queue is a priority array; migrating an extent of the one of the lower priority ranks to another one of the plurality of ranks not selected for depopulation in response to a write operation to an extent of one of lower priority ranks that are placed in a queue; selecting the one of the lower priority ranks with newer data for executing a read operation in response to a read operation to one of the lower priority ranks that are placed in the queue; depopulating at least one of the plurality of ranks marked as a highest priority rank to at least one of a plurality of targeted ranks; and leaving the highest priority rank as unassigned to one of the plurality of targeted ranks following the depopulating until determining if the highest priority rank is to be assigned the one of the plurality of targeted ranks.
地址 Armonk NY US