公开(公告)号：US11080206B2

公开(公告)日：2021-08-03

申请号：US16669832

申请日：2019-10-31

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Siddharth Munshi ,  Biswajit Mazumder ,  Vinay Manivel

IPC: G06F12/12 ,  G06F12/126 ,  G06F12/0891 ,  G06F12/0893

Abstract: A computer implemented method includes: storing identifiers of cached data blocks stored in a ring structure comprising a plurality of queues, where each queue is assigned a different priority level based on a base pointer, and where the plurality of queues includes a subset of queues associated with an insertion range of priority levels; during a plurality of partial rotations of the ring structure, inserting new identifiers of data blocks associated with a plurality of processing engines into the subset of queues, where each partial rotation shifts the base pointer to a next higher queue; and maintaining, for multiple partial rotations, an association between a first processing engine and a first queue of the subset of queues until the first queue is shifted out of the insertion range of priority levels.

公开(公告)号：US11645113B2

公开(公告)日：2023-05-09

申请号：US17245569

申请日：2021-04-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Christopher Joseph Corsi ,  Prashanth Soundarapandian ,  Matti Antero Vanninen ,  Siddharth Munshi

IPC: G06F9/48 ,  G06F9/50 ,  G06F15/80

CPC classification number: G06F9/4881 ,  G06F9/4831 ,  G06F9/5038 ,  G06F15/80

Abstract: In some examples, a system receives a first unit of work to be scheduled in the system that includes a plurality of collections of processing units to execute units of work, where each respective collection of processing units of the plurality of collections of processing units is associated with a corresponding scheduling queue. The system selects, for the first unit of work according to a first criterion, candidate collections from among the plurality of collections of processing units, and enqueues the first unit of work in a schedule queue associated with a selected collection of processing units that is selected, according to a selection criterion, from among the candidate collections.

公开(公告)号：US20220350648A1

公开(公告)日：2022-11-03

申请号：US17245569

申请日：2021-04-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Christopher Joseph Corsi ,  Prashanth Soundarapandian ,  Matti Antero Vanninen ,  Siddharth Munshi

IPC: G06F9/48 ,  G06F9/50 ,  G06F15/80

Abstract: In some examples, a system receives a first unit of work to be scheduled in the system that includes a plurality of collections of processing units to execute units of work, where each respective collection of processing units of the plurality of collections of processing units is associated with a corresponding scheduling queue. The system selects, for the first unit of work according to a first criterion, candidate collections from among the plurality of collections of processing units, and enqueues the first unit of work in a schedule queue associated with a selected collection of processing units that is selected, according to a selection criterion, from among the candidate collections.

公开(公告)号：US20210133118A1

公开(公告)日：2021-05-06

申请号：US16669832

申请日：2019-10-31

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Siddharth Munshi ,  Biswajit Mazumder ,  Vinay Manivel

IPC: G06F12/126 ,  G06F12/0893 ,  G06F12/0891

Abstract: A computer implemented method includes: storing identifiers of cached data blocks stored in a ring structure comprising a plurality of queues, where each queue is assigned a different priority level based on a base pointer, and where the plurality of queues includes a subset of queues associated with an insertion range of priority levels; during a plurality of partial rotations of the ring structure, inserting new identifiers of data blocks associated with a plurality of processing engines into the subset of queues, where each partial rotation shifts the base pointer to a next higher queue; and maintaining, for multiple partial rotations, an association between a first processing engine and a first queue of the subset of queues until the first queue is shifted out of the insertion range of priority levels.