Distributed data object management method and apparatus

Patent metadata

Field	Value
Publication number	US-2018189177-A1
Application number	US-201615394667-A
Country	US
Kind code	A1
Filing date	Dec 29, 2016
Priority date	Dec 29, 2016
Publication date	Jul 5, 2018
Grant date	—

Abstract

Apparatus and method for distributed management of data objects in a network of compute nodes are disclosed herein. A first compute node interface may be communicatively coupled to a first compute node to receive a request from the first compute node for at least a portion of a particular version of a data object, wherein the first compute node interface is to include mapping information and logic, wherein the logic is to redirect the request to a second compute node interface associated with a second compute node when the second compute node is mapped to a plurality of data object addresses that includes an address associated with the data object in accordance with the mapping information, and wherein the first compute node is to receive, as a response to the request, the at least a portion of the particular version of the data object from a third compute node interface associated with a third compute node.

First claim

We claim:

1 . An apparatus comprising:
a first compute node interface to be communicatively coupled to a first compute node to receive a request from the first compute node for at least a portion of a particular version of a data object, wherein the first compute node interface is to include mapping information and logic, wherein the logic is to redirect the request to a second compute node interface associated with a second compute node when the second compute node is mapped to a plurality of data object addresses that includes an address associated with the data object in accordance with the mapping information, and wherein the first compute node is to receive, as a response to the request, the at least a portion of the particular version of the data object from a third compute node interface associated with a third compute node.

2 . The apparatus of claim 1 , wherein the at least a portion of the particular version of the data object is stored in at least one of the third compute node or a data object cache included in the third compute node interface.

3 . The apparatus of claim 1 , wherein the third compute node interface is to provide the response when the at least a portion of the particular version of the data object is absent in the second compute node and the second compute node interface and the second compute node interface redirects the request to the third compute node interface based on data object version location information associated with the data object tracked and maintained in the second compute interface.

4 . The apparatus of claim 3 , wherein the first compute node interface includes a data object cache that stores the at least a portion of the particular version of the data object, wherein the logic is to retain the request in the first compute node interface when the first compute node is mapped to the address associated with the data object in accordance with the mapping information, and wherein the logic is to obtain, as the response to the request, the at least a portion of the particular version of the data object from the data object cache and to provide the response to the first compute node.

5 . The apparatus of claim 4 , wherein the logic comprises an application specific integrated circuit (ASIC), programmable array logic (PAL), field programmable gate array (FPGA), circuitry, on-chip circuitry, hardware, or firmware.

6 . The apparatus of claim 1 , wherein, when the first compute node is mapped to the plurality of data object addresses that includes the address associated with the data object in accordance with the mapping information, the first compute node interface includes first data object version location information associated with respective data objects of a plurality of data objects associated with the plurality of data object addresses mapped to the first compute node.

7 . The apparatus of claim 6 , wherein the first data object version location information includes, for each first data object of the plurality of data objects mapped to the first compute node, one or more of: a valid bit, a data object identifier, an address range associated with the first data object, a creator compute node of the first data object, sharers compute nodes to which the first data object was provided, identifiers of versions of the first data object provided to respective sharers compute nodes, an identifier of a latest version of the first data object, an identifier of a compute node currently storing the latest version of the first data object, or an identifier of a version of the first data object locally cached in the first compute node interface when locally cached in the first compute node interface.

8 . The apparatus of claim 1 , wherein the request includes a start address and an address range to specify the at least a portion of the particular version of the data object, and wherein the at least a portion of the particular version of the data object comprises a particular portion of a single data object, a single data object, or more than one data object.

9 . A computerized method comprising:
receiving, at a first compute node interface associated with a first compute node of a plurality of compute nodes, a request from the first compute node for at least a portion of a particular version of a data object; in response to receipt of the request, determining whether a second compute node of the plurality of compute nodes is mapped to a plurality of data object addresses that includes an address associated with the data object based on mapping information between the plurality of compute nodes and the plurality of data object addresses; when the determination is affirmative, redirecting the request to a second compute node interface associated with the second compute node; receiving, from a third compute node interface associated with a third compute node of the plurality of compute nodes, a response to the request comprising the at least a portion of the particular version of the data object; and providing, to the first compute node, the response to the request.

10 . The method of claim 9 , wherein the at least a portion of the particular version of the data object is stored in at least one of the third compute node or a data object cache included in the third compute node interface.

11 . The method of claim 9 , wherein receiving the response to the request from the third compute node interface comprises receiving the response to the request from the third compute node interface when the at least a portion of the particular version of the data object is absent in the second compute node and the second compute node interface and the second compute node interface redirected the request to the third compute node interface based on data object version location information associated with the data object tracked and maintained in the second compute interface.

12 . The method of claim 11 , further comprising:
retaining the request, in the first compute node interface, when the first compute node is mapped to the address associated with the data object in accordance with the mapping information; and obtaining the at least a portion of the particular version of the data object from a data object cache included in the first compute node interface.

13 . The method of claim 12 , wherein the data object comprises a file, a page, a document, a tuple, or a unit of data.

14 . The method of claim 9 , wherein, when the first compute node is mapped to the plurality of data object addresses that includes the address associated with the data object in accordance with the mapping information, the first compute node interface includes first data object version location information associated with respective data objects of a plurality of data objects associated with the plurality of data object addresses mapped to the first compute node.

15 . A system comprising:
first, second, and third compute node interfaces communicatively coupled to each other; and first, second, and third compute nodes associated with and communicatively coupled to respective first, second, and third compute node interfaces, wherein the first compute node is to generate a request for at least a portion of a particular version of a data object, wherein the first compute node interface is to receive the request from the first compute node and to forward the request to the second compute node interface when the second compute node is mapped to a plurality of data object addresses that includes an address associated with the data object, and wherein the first compute node interface is to receive, as a response to t

Assignees

• Intel Corp

Inventors

• Guim Bernat Francesc
• Doshi Kshitij A
• Schmisseur Mark A
• Larsen Steen
• Douglas Chet R

Classifications

• G06F12/06 Primary

  Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication (G06F12/08 takes precedence) · CPC title

• G06F2212/60

  Details of cache memory · CPC title

• H04L67/1095

  Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes · CPC title

• H04L67/06 Primary

  specially adapted for file transfer, e.g. file transfer protocol [FTP] · CPC title

• G06F12/0802

  Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches · CPC title