Tape Storage Access Ordering Optimizes Cycle Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage tape access methods are inefficient due to high access, processing, and retrieval times, as well as increased costs associated with tape drives, as they do not consider cumulative inter-segment seek and rewind times across multiple tapes, leading to suboptimal access orders.
Innovation Solution
A computer-implemented method for generating optimized access orders for data storage tapes that account for reading multiple segments from single or multiple tapes, including mounting, seek, read, rewind, and unmounting times, using order models that minimize overall cycle time by strategically grouping data segments to reduce cumulative seek and rewind times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional tape access methods are used, then storage cost is reduced, but access time and processing time increase significantly
Solution Approach 1:
The system performs preliminary actions by pre-calculating optimal access orders and pre-grouping data segments before actual retrieval operations. The access order generator creates optimized sequences in advance, and the tape drive controller pre-positions tapes and segments, reducing the time required during actual data access operations.
Solution Approach 2:
The system dynamically adjusts access orders and retrieval sequences based on real-time conditions. The access order generator can re-optimize access sequences when new data segments are added or when tape drive availability changes, making the system adaptable to varying workloads and conditions to minimize access time.
2Productivity
If multiple data segments are accessed sequentially, then data retrieval is completed, but cumulative seek and rewind times increase
Solution Approach 1:
The system merges multiple data segment access operations into consolidated tape operations. By grouping segments that can be accessed together on the same tape mount and combining seek/rewind operations, the system reduces the total number of separate tape positioning operations, thereby decreasing cumulative seek and rewind times.
Solution Approach 2:
The system segments data into logical groups based on tape location and accessibility. The access order generator divides data segments into groups that can be efficiently retrieved together, separating them from segments that require separate tape operations. This segmentation strategy optimizes the retrieval sequence to minimize interspersed seek and rewind operations.
3Quantity of substance
If tape drives are increased to handle more data, then storage capacity is improved, but hardware costs and complexity increase
Solution Approach 1:
The access order generator serves multiple functions: it optimizes access sequences, groups data segments, calculates retrieval times, and coordinates tape drive operations. This multi-functional software layer replaces the need for additional hardware resources, allowing a single tape drive to efficiently handle larger datasets through intelligent scheduling rather than physical replication.
Data Source
AI summary
A method for data storage tape access ordering is provided. The method receives an order request for accessing a plurality of data segments stored on a data storage tape. Each data segment is defined by segment characteristics. The method identifies a number of data segments within the plurality of data segments in the order request. The method determines an order model based on the number of data segments and the segment characteristics of the plurality of data segments. The method generates an access order for the plurality of data segments based on the order model and retrieves a subset of data segments from the data storage tape based on the access order.