Dynamic Storage Parameter Selection for Distributed Files

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Large-scale distributed storage systems face challenges in optimizing storage parameters such as replication, encoding, stripe width, and backup schedules to balance cost, performance, and reliability, especially when dealing with varying file access patterns and system outages.

Innovation Solution

The system programmatically determines preferred storage parameters by analyzing trace data to identify file access patterns, receiving metadata and system characteristics, and predicting future failures and reliability based on historical data. This allows for the optimization of storage parameters to minimize costs while achieving desired file reliability and availability.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If files are replicated across multiple storage devices to improve availability and reliability, then file accessibility is improved, but storage cost increases

Engineering Contradiction:
Improvefile availabilityVSAvoidstorage cost
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The system dynamically adjusts replication parameters (number of copies, storage locations) based on file access patterns, importance levels, and system conditions. Files with higher availability requirements receive more replicas, while less critical files use fewer replicas or alternative protection mechanisms, optimizing the balance between reliability and storage cost.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

Different replication strategies are applied to different files or file portions based on their specific requirements. Critical files receive full replication across multiple devices, while non-critical files may use erasure coding or single-copy storage, creating a heterogeneous storage architecture that optimizes overall system efficiency.

Inventive Principle:
Principle #3Local quality

2Productivity

If files are chunked and striped across multiple storage devices to improve access speed, then file retrieval performance is improved, but system complexity increases

Engineering Contradiction:
Improvefile access speedVSAvoidstorage management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

Files are divided into chunks and distributed across multiple storage devices using striping. This segmentation enables parallel read/write operations on different chunks simultaneously, significantly improving file access speed while the system manages the complexity through automated metadata tracking.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

A metadata server or distributed file system layer acts as an intermediary between clients and storage devices. This intermediary manages the complexity of chunk tracking, location mapping, and reconstruction logic, allowing clients to access files simply by filename while the intermediary handles the complex distributed storage operations.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Quantity of substance

If erasure coding is used instead of replication to reduce storage cost, then storage efficiency is improved, but computational overhead increases

Engineering Contradiction:
Improvestorage efficiencyVSAvoidcomputational overhead
Core Design Contradiction:
Quantity of substanceVSUse of energy by moving object

Solution Approach 1:

The system dynamically selects between replication and erasure coding based on file characteristics, access patterns, and system conditions. For frequently accessed files, replication may be preferred despite lower storage efficiency to minimize computational overhead during read operations. For archival or less frequently accessed files, erasure coding is used to maximize storage efficiency.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The storage system can dynamically change its protection strategy for different files or even different portions of files. Erasure coding parameters (k, m values) can be adjusted based on file importance and access patterns, allowing the system to optimize the trade-off between storage efficiency and computational requirements on demand.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS20250165435A1Programmatically choosing preferred storage parameters for files
Publication Date: 2025.05.22 GOOGLE LLC
  • US20250165435A1 patent drawing
  • US20250165435A1 patent drawing
  • US20250165435A1 patent drawing

AI summary

A method includes receiving trace data representing access information about files stored in a large-scale distributed storage system, identifying file access patterns based on the trace data, receiving metadata information associated with the files stored in the large-scale distributed storage system, and generating a preferred storage parameter for each file based on the received metadata information and the identified file access patterns. The method also includes receiving, file reliability or accessibility information of a new file, determining whether the received file reliability or accessibility information of the new file matches information of a file group of the files in the large-scale distributed storage system, and when the file reliability or accessibility information of the new file matches the information of the file group, storing the new file in the large-scale distributed storage system using the preferred storage parameter associated with the file group.