# US 2025/0165168 A1 · Method and system for dynamic storage scaling

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0165168 A1
- Document ID: US20250165168A1
- Status: Published application
- Kind: A1
- Application number: 18/789,506
- Filed: 2024-07-30
- Published: 2025-05-22
- Earliest claimed: 2020-07-15
- Assignees: Dynavisor, Inc.
- Applicants: Dynavisor, Inc.
- Inventors: Sreekumar Nair
- Web page: https://patentgrep.com/patent/US20250165168A1

## CPC

- G06F 3/0632: {by initialisation or re-initialisation of storage systems}
- G06F 3/0607: {by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device}
- G06F 3/064: {Management of blocks}
- G06F 3/0647: {Migration mechanisms}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 11/2094: {Redundant storage or storage space (G06F11/2056 takes precedence)}
- G06F 3/0685: {Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays}
- G06F 11/2097: {maintaining the standby controller/processing unit updated (initialisation or re-synchronisation thereof G06F11/1658 and subgroups)}
- G06F 11/3034: {where the computing system component is a storage system, e.g. DASD based or network based (digital input from or digital output to record carriers G06F3/06; digital recording or reproducing G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097)}
- G06F 11/3442: {for planning or managing the needed capacity}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and system for dynamic storage scaling based on automatically parallelizing access of names and data across multiple nodes or micro object stores (MOSs) is provided. A dynamic storage scaling device cluster is provisioned for a particular level of parallelism (e.g., N MOSs) when the cluster is created. The N MOSs may initially reside in a few physical servers (e.g., one server). When the data distribution causes peak resource usage of the physical servers, new server(s) can be added. Some micro object stores (MOSs) are moved to the new physical server(s) through a meiosis process. The storage devices associated with the moved MOSs are unmounted from the original servers and mounted to the new server(s). The meiosis continues until the cluster grows to full capacity. The scaling is dynamic and efficient since no data copy is involved in the meiosis and the initial resource cost is optimized.

## Claims

### Claim 1

A system comprising:
a first set of micro object stores (MOSs) operating on data in a data domain, the data being stored within at least one of a plurality of storage domains, wherein each MOS comprising a MOS core and a MOS interface;
one or more server drivers that request data reference operations via a first connectivity domain with the first set of MOSs, wherein the device drivers are configured to implement the MOS interface;
the plurality of storage domains including multi stream block devices (MSBDs), the plurality of storage domains logically grouped into the MSBDs and each MOS in the first set of MOS is associated with a set of MSBDs from the MSBDs; and
wherein the system is configured to:
receive the data in a micro object;
assign the micro object to a MOS of the first set of MOSs residing on a first set of servers;
determine that a new server is needed;
add a second set of servers, a number of the servers in the second set of servers determined based on an integer number;
move a subset of the first set of MOSs from the first set of servers to the second set of servers;
unmount storage devices of the MSBDs associated with the subset of MOSs from the first set of servers; and
remount the unmounted storage devices on the second set of servers.

### Claim 2 (depends on 1)

The system of claim 1, wherein the server driver is run on a server operating system (OS).

### Claim 3 (depends on 1)

The system of claim 1, wherein the MOS core is configured to implement at least one of a coherency manager, a micro file system, a data and storage manager, or a MOS controller.

### Claim 4 (depends on 1)

The system of claim 1, wherein the MOS interface is configured to implement at least one of a memory manager, or caches.

### Claim 5 (depends on 1)

The system of claim 1, wherein the MOS interface is configured to be implemented on a co-processor board.

### Claim 6 (depends on 1)

The system of claim 1, wherein MOS operations are directed to the MOS interface.

### Claim 7 (depends on 1)

The system of claim 1, wherein the server driver is configured to pass a request from a client device onto at least one MOS of the set of MOSs.

### Claim 8 (depends on 1)

The system of claim 1, further comprising clients that request data reference operations via at least one server driver.

### Claim 9 (depends on 1)

The system of claim 1, wherein the data operated on by the first set of micro object stores (MOSs) is stored in storage devices of the plurality of storage domains.

### Claim 10 (depends on 1)

The system of claim 1, wherein at least two of the storage domains include the MSBDs.

### Claim 11 (depends on 1)

The system of claim 1, wherein the storage domains are communicatively coupled to the data domain through a second connectivity domain.

### Claim 12 (depends on 1)

The system of claim 1, wherein determining that a new server is needed comprises determining that a new server is needed based at least on resource usage of the first set of servers.

### Claim 13 (depends on 1)

The system of claim 1, wherein moving a subset of the first set of MOSs from the first set of servers to the second set of servers comprises moving a subset of the first set of MOSs from the first set of servers to the second set of servers such that each server in the first and second sets has an equal number of MOSs.

### Claim 14 (depends on 1)

The system of claim 1, wherein the first and second set of servers are part of a cluster.

### Claim 15 (depends on 1)

The system of claim 1, wherein the integer number comprises a replication factor.

### Claim 16 (depends on 1)

The system of claim 1, wherein the integer number comprises a number configured by an administrator.

### Claim 17 (depends on 1)

The system of claim 1, further comprising prior to adding a second set of servers, requesting the integer number from a user.

### Claim 18 (depends on 1)

The system of claim 1, further comprising prior to adding a second set of servers, configuring the integer number.

### Claim 19 (depends on 12)

The system of claim 12, wherein configuring the integer number comprises an administrator configuring the integer number.

### Claim 20

A method for mapping data in memory for a set of micro object stores (MOSs), comprising:
identifying a type data in a stream associated with each MOS the set of MOSs;
determining whether the data should be directly mapped into the memory;
provided the data is determined to be mapped, mapping the data into memory; and
keeping the data in memory until the MOS is shutdown.

### Claim 21 (depends on 20)

The method of claim 20, wherein identifying the type of data in a stream comprises identifying whether the type of data in the stream comprises at least one of a MOS configuration, metadata, or data blocks.

### Claim 22 (depends on 20)

The method of claim 20, wherein determining whether the data should be directly mapped into the memory comprises maintaining a MOS configuration and Metadata as a single file on their respective streams.

### Claim 23 (depends on 22)

The method of claim 22, wherein determining whether the data should be directly mapped into the memory comprises determining whether the data should be directly mapped into memory during initialization of the MOS.

### Claim 24 (depends on 20)

The method of claim 20, wherein mapping the data into memory comprises keeping small data resident in memory until the MOS is shutdown.

### Claim 25 (depends on 20)

The method of claim 20, further comprising:
provided the data is determined to not be mapped, organizing the data as containers of a finite size;
mapping the containers in and out based on references; and
evicting the containers in memory to make space for new containers.

### Claim 26 (depends on 25)

The method of claim 25, wherein organizing the data as containers of a finite size comprises organizing metadata and data blocks in one or more streams as containers of a finite size.

### Claim 27 (depends on 25)

The method of claim 25, wherein evicting the containers in memory to make space for new containers comprises using a set of policies to evict containers in memory to make space for new containers.

### Claim 28 (depends on 27)

The method of claim 27, wherein the set of policies comprises a least recently used (LRU) policy.
