Append and sort accelerator

Abstract

A method for performing one or more key-value pair operations, the method may include 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 the one or more key-value pair operations, wherein the one or more key-value pair operations are related to key-value pairs of one or more lists of the at least one search tree that is 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, 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; and wherein the one or more accelerators are more efficient in generating the at least one response than the one or more first processors.