公开(公告)号：US20180349180A1

公开(公告)日：2018-12-06

申请号：US15613760

申请日：2017-06-05

申请人： Cavium, Inc.

发明人： Timothy Toshio Nakada ,  Jason Daniel Zebchuk ,  Tejas Maheshbhai Bhatt ,  Mark Jon Kwong

IPC分类号： G06F9/48 ,  G06F13/16 ,  G06F15/78 ,  G06F9/50

摘要： Method and system embodying the method for for scheduling arbitration among a plurality of service requestors encompassing: designating among the plurality of service requestors all the service requestors that have an active request; determining whether at least one of the designated service requestors has an un-served status indicator which is set; and when the determining is positive then: selecting one of the at least one designated service requestors in accordance with a pre-determined policy; and clearing the un-served status indicator for the selected service requestor, is disclosed.

公开(公告)号：US20180349185A1

公开(公告)日：2018-12-06

申请号：US15613889

申请日：2017-06-05

申请人： Cavium, Inc.

发明人： Timothy Toshio Nakada ,  Jason Daniel Zebchuk ,  Gregg Alan Bouchard ,  Tejas Maheshbhai Bhatt ,  Hong Jik Kim ,  Ahmed Shahid ,  Mark Jon Kwong

IPC分类号： G06F9/48 ,  G06F9/50

摘要： Method and system embodying the method for programmable scheduling encompassing: enqueueing at least one command into one of a plurality of queues having a plurality of entries; determining a category of the command at the head entry of each of the plurality of queues; processing each determined non-job category command by a non-job command arbitrator; and processing each determined job category command by a job arbitrator and assignor, is disclosed.

公开(公告)号：US20180336063A1

公开(公告)日：2018-11-22

申请号：US15600706

申请日：2017-05-20

申请人： Cavium, Inc.

发明人： Timothy Toshio Nakada ,  Jason Daniel Zebchuk ,  Gregg Alan Bouchard ,  Tejas Maheshbhai Bhatt ,  Hong Jik Kim ,  Ahmed Shahid ,  Mark Jon Kwong

IPC分类号： G06F9/48 ,  G06F9/50

摘要： Method and system embodying the method for load balancing of scheduled jobs among a plurality of engines encompassing determining a number of cluster credits for each of a plurality of clusters that comprise at least one engine capable of processing a scheduled job; determining a number of engine credits for each of the plurality of engines comprising each of the at least one engine in accordance with a number of jobs assigned to each of the plurality of engines; evaluating the determined number of cluster credits and the determined number of engine credits in accordance with a credit evaluation policy; and assigning the job to one of the plurality of engines in accordance with the evaluation, is disclosed.