Append and sort accelerator

A key-value pair operations device that comprises one or more accelerators, wherein the one or more accelerators are configured to

• receive, from one or more first processors, and using an interface between the one or more first processors and the one or more accelerators, at least one request to perform the one or more key-value pair operations, wherein the one or more first processors and the one or more accelerators comprise one or more integrated circuits;
• wherein the one or more key-value pair operations are selected out of an append and sort operation and a delete and sort operations and are related to key-value pairs of one or more lists stored in a memory,
• wherein the at least one request comprises request fields that store key-value pair operation parameters, the key-value pair operation parameters comprise (i) an operand, (ii) retrieval information for retrieving from the memory the one or more lists of the at least one search tree, and at least one out of (iii) sorting method identifier, and (iv) collision handling policy identifier, wherein different values of the collision handling policy identifier are associated with different selection rules for selecting a key value pair of colliding key value pairs;
• generate at least one response to the at least one request;
• and
• participate in sending the at least one response using the interface between the one or more first processors and the one or more accelerators;
• wherein the one or more accelerators are more efficient in generating the at least one response than the one or more first processors;
• wherein the different selection rules are selected out of selecting an oldest version of a key value pair out of colliding versions of the key value pair, selecting a newest version of the key value pair out of colliding versions of the key value pair, or selecting a version of a key value pair within a given time period;
• and
• wherein each request of the at least one request comprises an operand field, one or more retrieval information fields and additional fields for storing the at least one out of the sorting method identifier, and the collision handling policy identifier.

A non-transitory computer readable medium that stores instructions for:

• receiving, by one or more accelerators, from one or more first processors, and using an interface between the one or more first processors and the one or more accelerators, at least one request to perform one or more key-value pair operations, wherein the one or more first processors and the one or more accelerators comprise one or more integrated circuits;
• wherein the one or more key-value pair operations are selected out of an append and sort operation and a delete and sort operations and are related to key-value pairs of one or more lists stored in a memory,
• wherein the at least one request comprises request fields that store key-value pair operation parameters, the key-value pair operation parameters comprise (i) an operand, (ii) retrieval information for retrieving from the memory the one or more lists, and at least one out of (iii) sorting method identifier, and (iv) collision handling policy identifier, wherein different values of the collision handling policy identifier are associated with different selection rules for selecting a key value pair of colliding key value pairs;
• generating, by the one or more accelerators, at least one response to the at least one request;
• sending the at least one response using the interface between the one or more first processors and the one or more accelerators;
• wherein the one or more accelerators are more efficient in generating the at least one response than the one or more first processors;
• wherein the different selection rules are selected out of selecting an oldest version of a key value pair out of colliding versions of the key value pair, selecting a newest version of the key value pair out of colliding versions of the key value pair, or selecting a version of a key value pair within a given time period;
• and
• wherein each request of the at least one request comprises an operand field, one or more retrieval information fields and additional fields for storing the at least one out of the sorting method identifier, and the collision handling policy identifier.