# US 2020/0396288 A1 · Distributed data store with persistent memory

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

- Number: US 2020/0396288 A1
- Document ID: US20200396288A1
- Status: Published application
- Kind: A1
- Application number: 16/903,182
- Filed: 2020-06-16
- Published: 2020-12-17
- Earliest claimed: 2019-06-16
- Assignees: Purdue Research Foundation
- Applicants: Purdue Research Foundation
- Inventors: Yiying Zhang; Shin-Yeh Tsai
- Web page: https://patentgrep.com/patent/US20200396288A1

## CPC

- H04L 67/1097: 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]
- G06F 3/061: {Improving I/O performance}
- G06F 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/0638: {Organizing or formatting or addressing of data}
- G06F 3/065: {Replication mechanisms}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 15/17331: {Distributed shared memory [DSM], e.g. remote direct memory access [RDMA]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method to build a persistent memory (PM)-based data storage system without involving a processor (CPU) at storage nodes is disclosed which includes storing data in one or more storage nodes that only include PM and no CPUs, with data stored in PM in form of link lists, accessing data stored in the one or more storage nodes' PM directly by remote compute nodes through a network, maintaining metadata associated with the data by one or more global controllers (metadata servers), upon request by a user to read or write data, the compute nodes contacting the one or more metadata servers to obtain location of data of interest in form of pointers (shortcuts), and the compute nodes sending network requests directly to the one or more storage nodes' PM to locate latest version of data by tracing the link list from the associated shortcut to corresponding tails.

## Claims

### Claim 1

A method to build a persistent memory (PM)-based data storage system without involving a processor (CPU) at storage nodes, comprising:
storing data in one or more storage nodes that only include PM and no CPUs, with data stored in PM in form of link lists;
accessing data stored in the one or more storage nodes' PM directly by remote compute nodes through a network;
maintaining metadata associated with the data by one or more global controllers (metadata servers);
upon request by a user to read or write data, the compute nodes contacting the one or more metadata servers to obtain location of data of interest to be read from or written to in the one or more storage nodes in form of pointers (shortcuts) to the link-lists that represent the data of interest; and
the compute nodes sending network requests directly to the one or more storage nodes' PM to locate latest version of data by tracing the link list from the associated shortcut to corresponding tails.

### Claim 2 (depends on 1)

The method of claim 1, wherein for reading further comprising:
transferring data from the latest version of the data in the one or more storage nodes to the compute nodes.

### Claim 3 (depends on 2)

The method of claim 2, for writing further comprising:
selecting a new space in the one or more storage nodes' PM assigned to compute nodes by the metadata server,
writing the desired data to the new space,
extending the link-list by linking the new space to the tail of the link-list,
setting the shortcut to the address of the new space, and
updating the metadata server with the address of the new space.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
retiring data held in PM locations associated with older data by adding PM locations associated with older data to a data structure that contains available locations for the link lists at the metadata servers.

### Claim 5 (depends on 1)

The method of claim 1, further comprising a replication method to replicate data during the write operation to ensure correctness and accessibility of the user data when a storage node fails, the replication method comprising:
temporarily setting a flag associated with the write operation;
generating one or more replica of the desired data by writing the desired data into one or more storage nodes' PM, each hosting one copy of the data in a new PM space;
each storage node linking its new PM space to the end of its associated link; and
once the desired data has been written and linked in all storage nodes that store a copy of the data, resetting the flag.
