Device for shared management of a resource between several users
AssigneeStreamcore
InventorRemi Despres
Life of this patent
Estimating the term…
Abstract
The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.
Claims12
Device for shared management of a resource (1) between several users, of the type comprising:
- a work memory (3), able to store user identifiers (ui), as well as several share parameters (Di), and several amounts (Ei) capable of advancing,
- a decision means (6) for allocating a chosen service slice (Qi) of the resource to a user selected(uS) as possessing the least advanced amount (Ei), and for subsequently advancing the amount (Ei) of this selected user (uS) according to a chosen increment (dEi),
- a memory link means (5), for associating a share parameter (Di) and an amount (Ei) with each user identifier (ui), while defining user queues of the “first in-first out” (FIFO) type, such that the identifier at the head of a queue always designates the user having the least advanced amount (Ei) in this queue,
- characterized in that the work memory (3) is able to store in addition a limited number of values of increments (P(c)), in that the memory link means (5) is contrived, on the one hand, so as to associate one of these values of increments (P(c)) with each user, and, on the other hand, to define the said queues on the basis of the said values of increments (P(c)) in limited number, and in that the decision means allocates the selected user (uS) a service slice (Q(uS)) associated with a pair (D(uS)), P(c)) represented by its share parameter (D(uS)) and the increment of its queue (P(c)), according to a predetermined law.
Dependencies are inferred from the claim text.