# US 2019/0377492 A1 · Use of capi-attached storage as extended memory

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

- Number: US 2019/0377492 A1
- Document ID: US20190377492A1
- Status: Published application
- Kind: A1
- Application number: 16/005,998
- Filed: 2018-06-12
- Published: 2019-12-12
- Earliest claimed: 2018-06-12
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Sanket RATHI; Bruce MEALEY
- Web page: https://patentgrep.com/patent/US20190377492A1

## CPC

- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 3/0655: {Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices}
- G06F 3/0683: {Plurality of storage devices}
- G06F 12/0223: {User address space allocation, e.g. contiguous or non contiguous base addressing}
- G06F 12/08: in hierarchically structured memory systems, e.g. virtual memory systems
- G06F 12/1009: using page tables, e.g. page table structures
- G06F 2212/1024: Latency reduction
- G06F 2212/1041: Resource optimization
- G06F 2212/206: Memory mapped I/O
- G06F 2212/217: Hybrid disk, e.g. using both magnetic and solid state storage devices
- G06F 2212/657: Virtual address space management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Improved techniques for memory expansion are provided. A storage volume is opened on a storage device attached to a computing system, and the storage volume is configured as extended memory. A number of hardware threads available in the computing system are determined, and a number of contexts equal to the determined number of hardware threads are generated. Each context is assigned to one of the hardware threads. It is further determined that a first hardware thread has requested a first page that has been paged to the storage volume, where the first hardware thread is assigned a first context. A synchronous input output (I/O) interface is accessed to request that the first page be moved to memory, based on the first context. While the first page is being moved to memory, a priority of the first hardware thread is reduced.

## Claims

### Claim 1

A method comprising:
opening a storage volume on a storage device attached to a computing system;
configuring the storage volume as extended memory;
determining a number of hardware threads available in the computing system;
generating a number of contexts equal to the determined number of hardware threads;
assigning each context to one of the hardware threads;
determining that a first hardware thread has requested a first page that has been paged to the storage volume, wherein the first hardware thread is assigned a first context;
accessing a synchronous input output (I/O) interface to request that the first page be moved to memory, based on the first context; and
while the first page is being moved to memory, reducing a priority of the first hardware thread.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining that a second page should be moved from memory to the storage volume, based on a request from a second hardware thread;
accessing the synchronous I/O interface to request that the second page be moved to the storage volume, based on a second context corresponding to the second hardware thread; and
while the second page is being moved to the storage volume, reducing a priority of the second hardware thread.

### Claim 3 (depends on 2)

The method of claim 2, wherein determining that the second page should be moved from memory to the storage volume comprises determining that the second hardware thread has requested access to a third page that is stored in the storage volume.

### Claim 4 (depends on 1)

The method of claim 1, wherein each respective context includes a respective queue pair and a segment table.

### Claim 5 (depends on 4)

The method of claim 4, wherein moving the first page to memory is based at least in part on the segment table.

### Claim 6 (depends on 4)

The method of claim 4, wherein the segment table is generated upon opening of the storage volume, and wherein the segment table includes a mapping between virtual addresses and physical addresses in memory.

### Claim 7 (depends on 1)

The method of claim 1, wherein the storage device is attached via a coherent accelerator processor interface (CAPI).

### Claim 8 (depends on 1)

The method of claim 1, wherein configuring the storage volume as extended memory comprises configuring the storage volume to provide an optimized kernel interface.

### Claim 9 (depends on 8)

The method of claim 8, wherein the optimized kernel interface does not include traditional I/O functionality.

### Claim 10

A computer program product comprising:
a computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code executable by one or more computer processors to perform an operation comprising:
opening a storage volume on a storage device attached to a computing system;
configuring the storage volume as extended memory;
determining a number of hardware threads available in the computing system;
generating a number of contexts equal to the determined number of hardware threads;
assigning each context to one of the hardware threads;
determining that a first hardware thread has requested a first page that has been paged to the storage volume, wherein the first hardware thread is assigned a first context;
accessing a synchronous input output (I/O) interface to request that the first page be moved to memory, based on the first context; and
while the first page is being moved to memory, reducing a priority of the first hardware thread.

### Claim 11 (depends on 10)

The computer program product of claim 10, the operation further comprising:
determining that a second page should be moved from memory to the storage volume, based on a request from a second hardware thread;
accessing the synchronous I/O interface to request that the second page be moved to the storage volume, based on a second context corresponding to the second hardware thread; and
while the second page is being moved to the storage volume, reducing a priority of the second hardware thread.

### Claim 12 (depends on 10)

The computer program product of claim 10, wherein each respective context includes a respective queue pair and a segment table, and wherein moving the first page to memory is based at least in part on the segment table.

### Claim 13 (depends on 12)

The computer program product of claim 12, wherein the segment table is generated upon opening of the storage volume, and wherein the segment table includes a mapping between virtual addresses and physical addresses in memory.

### Claim 14 (depends on 10)

The computer program product of claim 10, wherein the storage device is attached via a coherent accelerator processor interface (CAPI).

### Claim 15 (depends on 10)

The computer program product of claim 10, wherein configuring the storage volume as extended memory comprises configuring the storage volume to provide an optimized kernel interface that does not include traditional I/O functionality.

### Claim 16

A system comprising:
one or more computer processors; and
a memory containing a program which when executed by the one or more computer processors performs an operation, the operation comprising:
opening a storage volume on a storage device attached to a computing system;
configuring the storage volume as extended memory;
determining a number of hardware threads available in the computing system;
generating a number of contexts equal to the determined number of hardware threads;
assigning each context to one of the hardware threads;
determining that a first hardware thread has requested a first page that has been paged to the storage volume, wherein the first hardware thread is assigned a first context;
accessing a synchronous input output (I/O) interface to request that the first page be moved to memory, based on the first context; and
while the first page is being moved to memory, reducing a priority of the first hardware thread.

### Claim 17 (depends on 16)

The system of claim 16, the operation further comprising:
determining that a second page should be moved from memory to the storage volume, based on a request from a second hardware thread;
accessing the synchronous I/O interface to request that the second page be moved to the storage volume, based on a second context corresponding to the second hardware thread; and
while the second page is being moved to the storage volume, reducing a priority of the second hardware thread.

### Claim 18 (depends on 16)

The system of claim 16, wherein each respective context includes a respective queue pair and a segment table, and wherein moving the first page to memory is based at least in part on the segment table.

### Claim 19 (depends on 18)

The system of claim 18, wherein the segment table is generated upon opening of the storage volume, wherein the segment table includes a mapping between virtual addresses and physical addresses in memory.

### Claim 20 (depends on 16)

The system of claim 16, wherein the storage device is attached via a coherent accelerator processor interface (CAPI), and wherein configuring the storage volume as extended memory comprises configuring the storage volume to provide an optimized kernel interface that does not include traditional I/O functionality.
