Browse Prior Art Database

Fair Container Delegation via Permutations among Delegates

IP.com Disclosure Number: IPCOM000249444D
Publication Date: 2017-Feb-27
Document File: 1 page(s) / 19K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a method to use a container's sequence identifier (id) to determine a permutation of the available delegates in a data source processing unit.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 74% of the total text.

1

Fair Container Delegation via Permutations among Delegates

For certain actions on a container, a data source (ds) processing unit could decide to give the work of the task to another ds processing unit (the delegate) to complete later. This is called delegation. For example, current ds processing units delegate index inserts and deletes to a ds processing unit, so the insertion can be done later without affecting throughput. When a ds processing unit decides to delegate work, it must select a delegate to which to assign the work. Each container needs to choose an order of delegates to which to submit work such that the work of all containers is evenly distributed over the delegates. In addition, it is necessary that an agreement exists between all ds units for permutations that does not require communication between the ds units.

The novel solution is a method to use the container's sequence identifier (id) to determine a permutation of the available delegates.

When a ds processing unit decides to delegate work for a container, it chooses a mapping from the container's sequence id to a permutation of the available delegates. The mapping must have the property that for all of the permutations generated, a given delegate appears first as many times as all the other delegates, give or take some discrete threshold. For example, the ds processing unit could choose to use Lehmer code Permutation, Thue–Morse permutation, etc.

When the permutation is determined, the ds processing...