IP Library Granted Patent US 12,373,408
Granted Patent B1
US 12,373,408 · App. 18/652,542 · Granted Jul 29, 2025

Reorganization of a data set

Inventors: David C. Reed (Tucson, AZ); Ryan Arthur Bouchard (Tucson, AZ); Michael R. Scott (Ocean View, HI); Parker Mathewson (Denver, CO)
Assignee: International Business Machines Corporation
G06F16/215G06F17/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,373,408
App. No.
18/652,542
Filed
May 1, 2024
Granted
Jul 29, 2025
Kind
B1
Examiner
WU, YICUN
Art Unit
2153
USPC
707/692
Abstract

A computer-implemented method (CIM), according to one embodiment, includes performing a reorganization analysis for mitigating latency during reorganization of a data set. The reorganization analysis includes using regression analysis to predict a time duration that reorganization of the data set will take based on a total size of the data set, relating the predicted time duration to a previous data set reorganization time duration, and performing linear extrapolation to estimate a time at which the total size of the data set will exceed a predetermined percentage of a maximum size of the data set. The method further includes reorganizing the data set before the estimated time, where the data set is reorganized at a time determined based on the reorganization analysis or derivative thereof.

Claims (40)

1. A computer-implemented method (CIM), the CIM comprising:

performing a reorganization analysis for mitigating latency during reorganization of a data set, the reorganization analysis including:

using regression analysis to predict a time duration that reorganization of the data set will take based on a total size of the data set,

relating the predicted time duration to a previous data set reorganization time duration, and

performing linear extrapolation to estimate a time at which the total size of the data set will exceed a predetermined percentage of a maximum size of the data set; and

reorganizing the data set before the estimated time, wherein the data set is reorganized at a time determined based on the reorganization analysis or derivative thereof.

2. The CIM of claim 1 , wherein the regression analysis used to predict the time duration that the reorganization of the data set will take includes linear regression analysis.

3. The CIM of claim 1 , wherein the reorganization analysis includes: building a time series model to forecast activity of the data set, wherein building the time series model includes: monitoring read and write activity recorded in a journal data set on a direct access storage device (DASD) by using historical read and write activity data.

4. The CIM of claim 3 , wherein the data set is a collection of metadata.

5. The CIM of claim 3 , wherein the reorganization analysis includes: estimating an amount of time until the data set reaches the maximum size of the data set, wherein the estimating is performed by extrapolating, from the regression analysis, utilization of the data set over time.

6. The CIM of claim 5 , wherein the reorganization analysis includes: forecasting from the time series model to determine, over the amount of time until the data set reaches the maximum size of the data set, periods of relatively low utilization of the data set, finding a local minima of the periods of relatively low utilization, and determining whether activity during the local minima of the periods of relatively low utilization has at least a predetermined degree of similarity with the historical read and write activity data over a same relative period of time.

7. The CIM of claim 6 , wherein the time determined based on the reorganization analysis or derivative thereof is the local minima of the periods of relatively low utilization.

8. The CIM of claim 7 , wherein the time determined based on the reorganization analysis or derivative thereof is the local minima of the periods of relatively low utilization in response to a determination that the activity during the local minima of the periods of relatively low utilization has at least a predetermined degree of similarity with the historical read and write activity data over a same relative period of time.

9. A computer program product (CPP), the computer program product comprising:

a set of one or more computer-readable storage media; and

program instructions, collectively stored in the set of one or more storage media, for causing a processor set to perform the following computer operations:

perform a reorganization analysis for mitigating latency during reorganization of a data set, the reorganization analysis including:

using regression analysis to predict a time duration that reorganization of the data set will take based on a total size of the data set,

relating the predicted time duration to a previous data set reorganization time duration, and

performing linear extrapolation to estimate a time at which the total size of the data set will exceed a predetermined percentage of a maximum size of the data set; and

reorganize the data set before the estimated time, wherein the data set is reorganized at a time determined based on the reorganization analysis or derivative thereof.

10. The CPP of claim 9 , wherein the regression analysis used to predict the time duration that the reorganization of the data set will take includes linear regression analysis.

11. The CPP of claim 9 , wherein the reorganization analysis includes: building a time series model to forecast activity of the data set, wherein building the time series model includes: monitoring read and write activity recorded in a journal data set on a direct access storage device (DASD) by using historical read and write activity data.

12. The CPP of claim 11 , wherein the data set is a collection of metadata.

13. The CPP of claim 11 , wherein the reorganization analysis includes: estimating an amount of time until the data set reaches the maximum size of the data set, wherein the estimating is performed by extrapolating, from the regression analysis, utilization of the data set over time.

14. The CPP of claim 13 , wherein the reorganization analysis includes: forecasting from the time series model to determine, over the amount of time until the data set reaches the maximum size of the data set, periods of relatively low utilization of the data set, finding a local minima of the periods of relatively low utilization, and determining whether activity during the local minima of the periods of relatively low utilization has at least a predetermined degree of similarity with the historical read and write activity data over a same relative period of time.

15. The CPP of claim 14 , wherein the time determined based on the reorganization analysis or derivative thereof is the local minima of the periods of relatively low utilization.

16. The CPP of claim 15 , wherein the time determined based on the reorganization analysis or derivative thereof is the local minima of the periods of relatively low utilization in response to a determination that the activity during the local minima of the periods of relatively low utilization has at least a predetermined degree of similarity with the historical read and write activity data over a same relative period of time.

17. A computer system (CS), the CS comprising:

a processor set;

a set of one or more computer-readable storage media; and

program instructions, collectively stored in the set of one or more storage media, for causing the processor set to perform the following computer operations:

perform a reorganization analysis for mitigating latency during reorganization of a data set, the reorganization analysis including:

using regression analysis to predict a time duration that reorganization of the data set will take based on a total size of the data set,

relating the predicted time duration to a previous data set reorganization time duration, and

performing linear extrapolation to estimate a time at which the total size of the data set will exceed a predetermined percentage of a maximum size of the data set; and

reorganize the data set before the estimated time, wherein the data set is reorganized at a time determined based on the reorganization analysis or derivative thereof.

18. The CS of claim 17 , wherein the regression analysis used to predict the time duration that the reorganization of the data set will take includes linear regression analysis.

19. The CS of claim 17 , wherein the reorganization analysis includes: building a time series model to forecast activity of the data set, wherein building the time series model includes: monitoring read and write activity recorded in a journal data set on a direct access storage device (DASD) by using historical read and write activity data.

20. The CS of claim 19 , wherein the data set is a collection of metadata.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2024
From: REED, DAVID C.; BOUCHARD, RYAN ARTHUR; SCOTT, MICHAEL R.; MATHEWSON, PARKER
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 067299/0616 →
References Cited (19)
US 7890675B2 · Aranguren et al. · 2011 [cited by applicant]
US 8095764B1 · Bauer et al. · 2012 [cited by applicant]
US 8095768B2 · Lehr et al. · 2012 [cited by applicant]
US 8291186B2 · Chauvet et al. · 2012 [cited by applicant]
US 8818932B2 · Nolan et al. · 2014 [cited by applicant]
US 8875150B2 · Ferdous et al. · 2014 [cited by applicant]
US 8966218B2 · Reed et al. · 2015 [cited by applicant]
US 9489630B2 · Achin et al. · 2016 [cited by applicant]
US 9582522B2 · Konik et al. · 2017 [cited by applicant]
US 9811439B1 · Barrett · 2017 [cited by examiner]
US 10579494B2 · Schmidt et al. · 2020 [cited by applicant]
US 10901788B2 · Venkadasamy et al. · 2021 [cited by applicant]
US 11023148B2 · Srivastava et al. · 2021 [cited by applicant]
US 20200106677A1 · Pathak · 2020 [cited by applicant]
US 20230124404A1 · He et al. · 2023 [cited by applicant]
US 20240163000A1 · Agarwal · 2024 [cited by examiner]
US 20240291724A1 · Saha · 2024 [cited by examiner]
Mainframestechhelp, “REPRO Command,” Mainframetechhelp, 2024, 16 pages, retrieved from https://www.mainframestechhelp.com/utilities/idcams/repro.htm. [cited by applicant]
Anonymous, “VSAM DASD Freespace Manager,” IP.com Prior Art Database, Technical Disclosure No. IPCOM000265354D, Mar. 31, 2021, 5 pages. [cited by applicant]