专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08869151B2 Packet draining from a scheduling hierarchy in a traffic manager of a network processor 有权
标题翻译：数据包从网络处理器的流量管理器中的调度层次排出
公开(公告)号：US08869151B2
公开(公告)日：2014-10-21
申请号：US13250938
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
IPC分类号： G06F9/455 , G06F9/46 , H04L12/933 , H04L12/863 , H04L12/931 , G06F12/08
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/00 , H04L49/109 , H04L49/506
摘要： Described embodiments provide for controlling a state of each node in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A traffic manager enqueues received tasks in a queue of the scheduling hierarchy associated with a data flow. The traffic manager maintains scheduling data structures for each node in the scheduling hierarchy. The scheduling data structures include a backpressure indicator and a timer indicator. If the backpressure indicator is set, the traffic manager sets the node as unavailable for scheduling and removes the node from the scheduling hierarchy. If the timer indicator is set, the traffic managers sets the node as unavailable for scheduling. Otherwise, if neither the backpressure indicator nor the timer indicator is set, the traffic manager sets the node as available for scheduling.
摘要翻译：描述的实施例提供用于控制网络处理器的调度层次中的每个节点的状态。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将接收到的任务排入与数据流相关联的调度层次结构的队列中。流量管理器维护调度层次结构中每个节点的调度数据结构。调度数据结构包括背压指示器和定时器指示器。如果设置了背压指示器，则流量管理器将节点设置为不可用于调度，并从调度层次结构中删除该节点。如果定时器指示灯被设置，则流量管理器将节点设置为不可用于调度。否则，如果未设置背压指示器和定时器指示符，则流量管理器将节点设置为可用于调度。

2. 发明申请

US20120020370A1 ROOT SCHEDULING ALGORITHM IN A NETWORK PROCESSOR 有权
标题翻译：网络处理器中的根调度算法
公开(公告)号：US20120020370A1
公开(公告)日：2012-01-26
申请号：US13250932
申请日：2011-09-30
申请人： David Sonnier , Balakrishnan Sundararaman , Shashank Nemawarkar
发明人： David Sonnier , Balakrishnan Sundararaman , Shashank Nemawarkar
IPC分类号： H04L12/56
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/109 , H04L49/254 , H04L49/506
摘要： Described embodiments provide for arbitrating between nodes of scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager queues the received task in an associated queue of the scheduling hierarchy. The root scheduler performs smooth deficit weighted round robin (SDWRR) arbitration between each child node of the root scheduler. The SDWRR arbitration includes checking one or more status indicators of each child node of the given scheduler and selecting, based on the status indicators, a first active child node of the scheduler and updating the one or more status indicators corresponding to the selected child node. Thus, a task is scheduled for transmission by the traffic manager every cycle of the network processor.
摘要翻译：描述的实施例提供了在网络处理器的调度层次结构的节点之间进行仲裁。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将接收到的任务排队在调度层次结构的关联队列中。根调度程序在根调度程序的每个子节点之间执行平滑缺省加权轮询（SDWRR）仲裁。 SDWRR仲裁包括检查给定调度器的每个子节点的一个或多个状态指示符，并且基于状态指示符选择调度器的第一活动子节点并且更新与所选择的子节点相对应的一个或多个状态指示符。因此，任务被调度以由流量管理器每个网络处理器的每个周期进行传输。

3. 发明申请

US20120020369A1 SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR 有权
标题翻译：在网络处理器的交通管理员中调度分层
公开(公告)号：US20120020369A1
公开(公告)日：2012-01-26
申请号：US13250910
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
IPC分类号： H04L12/56
CPC分类号： H04L49/254 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/00 , H04L49/101 , H04L49/109 , H04L49/506 , H04L49/90
摘要： Described embodiments provide for dynamically constructing a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager queues the received task in the associated queue, the queue having a corresponding parent scheduler at each of one or more next levels of the scheduling hierarchy up to the root scheduler. A parent scheduler selects, starting at the root scheduler and iteratively repeating at each of the corresponding N scheduling levels until a queue is selected, a child node to transmit at least one task. The traffic manager forms output packets for transmission based on the at least one task from the selected queue.
摘要翻译：描述的实施例提供了动态构建网络处理器的调度层次结构。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将所接收的任务排队在相关联的队列中，该队列具有相应的父调度器，该调度器直到根调度器的调度层次结构的一个或多个下一级。父调度器从根调度器开始，并且在每个相应的N个调度级别上迭代地重复，直到选择队列为止，发送至少一个任务的子节点。流量管理器基于来自所选择的队列的至少一个任务来形成用于传输的输出分组。

4. 发明授权

US08848723B2 Scheduling hierarchy in a traffic manager of a network processor 有权
标题翻译：在网络处理器的流量管理器中调度层次结构
公开(公告)号：US08848723B2
公开(公告)日：2014-09-30
申请号：US13250910
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh
IPC分类号： H04L12/28 , H04L12/937 , H04L12/863 , H04L12/931 , H04L12/933 , H04L12/861 , G06F12/08
CPC分类号： H04L49/254 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/00 , H04L49/101 , H04L49/109 , H04L49/506 , H04L49/90
摘要： Described embodiments provide for dynamically constructing a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager queues the received task in the associated queue, the queue having a corresponding parent scheduler at each of one or more next levels of the scheduling hierarchy up to the root scheduler. A parent scheduler selects, starting at the root scheduler and iteratively repeating at each of the corresponding N scheduling levels until a queue is selected, a child node to transmit at least one task. The traffic manager forms output packets for transmission based on the at least one task from the selected queue.
摘要翻译：描述的实施例提供了动态构建网络处理器的调度层次结构。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将所接收的任务排队在相关联的队列中，该队列具有相应的父调度器，该调度器直到根调度器的调度层次结构的一个或多个下一级。父调度器从根调度器开始，并且在每个相应的N个调度级别上迭代地重复，直到选择队列为止，发送至少一个任务的子节点。流量管理器基于来自所选择的队列的至少一个任务来形成用于传输的输出分组。

5. 发明授权

US08638805B2 Packet draining from a scheduling hierarchy in a traffic manager of a network processor 有权
标题翻译：数据包从网络处理器的流量管理器中的调度层次排出
公开(公告)号：US08638805B2
公开(公告)日：2014-01-28
申请号：US13250837
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh , Allen Vestal
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh , Allen Vestal
IPC分类号： H04L12/56
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/109 , H04L49/254 , H04L49/506
摘要： Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.
摘要翻译：所描述的实施例提供重构具有多个处理模块和共享存储器的网络处理器的调度层次。调度层次结构调度数据包进行传输。网络处理器生成与数据流相关联的每个接收到的分组相对应的任务。流量管理器接收由一个处理模块提供的任务，并确定与该任务相对应的调度层次的队列。队列在调度层次结构的一个或多个下一级的每一个上具有父调度器，直到根调度器，形成层次结构的分支。流量管理器确定队列和分支的一个或多个父调度程序是否应重新构建。如果是这样，则流量管理器随后丢弃分支的任务，排出分支的所有任务，并从调度层次结构中删除分支的相应节点。

6. 发明授权

US08576862B2 Root scheduling algorithm in a network processor 有权
标题翻译：网络处理器中的根调度算法
公开(公告)号：US08576862B2
公开(公告)日：2013-11-05
申请号：US13250932
申请日：2011-09-30
申请人： David Sonnier , Balakrishnan Sundararaman , Shashank Nemawarkar
发明人： David Sonnier , Balakrishnan Sundararaman , Shashank Nemawarkar
IPC分类号： H04L12/28
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/109 , H04L49/254 , H04L49/506
摘要： Described embodiments provide for arbitrating between nodes of scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager queues the received task in an associated queue of the scheduling hierarchy. The root scheduler performs smooth deficit weighted round robin (SDWRR) arbitration between each child node of the root scheduler. The SDWRR arbitration includes checking one or more status indicators of each child node of the given scheduler and selecting, based on the status indicators, a first active child node of the scheduler and updating the one or more status indicators corresponding to the selected child node. Thus, a task is scheduled for transmission by the traffic manager every cycle of the network processor.
摘要翻译：描述的实施例提供了在网络处理器的调度层次结构的节点之间进行仲裁。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将接收到的任务排队在调度层次结构的关联队列中。根调度程序在根调度程序的每个子节点之间执行平滑缺省加权轮询（SDWRR）仲裁。 SDWRR仲裁包括检查给定调度器的每个子节点的一个或多个状态指示符，并且基于状态指示符选择调度器的第一活动子节点并且更新与所选择的子节点相对应的一个或多个状态指示符。因此，任务被调度以由流量管理器每个网络处理器的每个周期进行传输。

7. 发明申请

US20120020368A1 DYNAMIC UPDATING OF SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR 有权
标题翻译：网络处理器交通管理员的调度分层动态更新
公开(公告)号：US20120020368A1
公开(公告)日：2012-01-26
申请号：US13250891
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
IPC分类号： H04L12/56
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/109 , H04L49/254 , H04L49/506
摘要： Described embodiments provide for dynamically controlling a scheduling rate of each node in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A traffic manager enqueues received tasks in a queue of the scheduling hierarchy associated with a data flow. The queue has a parent scheduler at each level of the hierarchy up to the root scheduler. The traffic manager maintains one or more scheduling data structures for each node in the scheduling hierarchy. If the traffic manager receives a rate reduction request corresponding to a given node of the scheduling hierarchy, the traffic manager updates one or more indicators in the scheduling data structure corresponding to the given node and removes the given node from the scheduling hierarchy, thereby reducing the scheduling rate of the node.
摘要翻译：描述的实施例提供用于动态地控制网络处理器的调度层级中的每个节点的调度速率。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器将接收到的任务排入与数据流相关联的调度层次结构的队列中。队列在层次结构的每个级别都有父级调度程序，直到根调度程序。流量管理器为调度层次结构中的每个节点维护一个或多个调度数据结构。如果流量管理器接收到与调度层次的给定节点相对应的速率降低请求，则流量管理器更新与给定节点相对应的调度数据结构中的一个或多个指示符，并从给定节点移除给定节点，从而减少节点的调度速率。

8. 发明申请

US20120020366A1 PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR 有权
标题翻译：网络处理器交通管理员中的调度分层的分组排水
公开(公告)号：US20120020366A1
公开(公告)日：2012-01-26
申请号：US13250837
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh , Allen Vestal
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Shailendra Aulakh , Allen Vestal
IPC分类号： H04L12/56
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/109 , H04L49/254 , H04L49/506
摘要： Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.
摘要翻译：所描述的实施例提供重构具有多个处理模块和共享存储器的网络处理器的调度层次。调度层次结构调度数据包进行传输。网络处理器生成与数据流相关联的每个接收到的分组相对应的任务。流量管理器接收由一个处理模块提供的任务，并确定与该任务相对应的调度层次的队列。队列在调度层次结构的一个或多个下一级的每一个上具有父调度器，直到根调度器，形成层次结构的分支。流量管理器确定队列和分支的一个或多个父调度程序是否应重新构建。如果是这样，则流量管理器随后丢弃分支的任务，排出分支的所有任务，并从调度层次结构中删除分支的相应节点。

9. 发明授权

US08869150B2 Local messaging in a scheduling hierarchy in a traffic manager of a network processor 有权
标题翻译：网络处理器流量管理器中的调度层次结构中的本地消息传递
公开(公告)号：US08869150B2
公开(公告)日：2014-10-21
申请号：US13250898
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
IPC分类号： G06F9/455 , G06F9/46 , H04L12/933 , H04L12/931 , H04L12/863 , G06F12/08
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/00 , H04L49/109 , H04L49/506
摘要： Described embodiments provide for queuing tasks in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager performs a task enqueue operation for the task. The task enqueue operation includes adding the received task to an associated queue of the scheduling hierarchy, where the queue is associated with a data flow of the received task. The queue has a corresponding scheduler level M, where M is a positive integer less than or equal to N. Starting at the queue and iteratively repeating at each scheduling level until reaching the root scheduler, each node in the scheduling hierarchy maintains an actual count of tasks corresponding to the node. Each node communicates a capped task count to a corresponding parent scheduler at a relative next scheduler level.
摘要翻译：描述的实施例提供了在网络处理器的调度层次中排队任务。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器执行任务的任务入队操作。任务排队操作包括将接收到的任务添加到调度层次结构的关联队列中，其中队列与接收到的任务的数据流相关联。队列具有对应的调度器级别M，其中M是小于或等于N的正整数。从队列开始并在每个调度级别迭代重复，直到到达根调度器，调度层次结构中的每个节点保持实际计数与节点对应的任务。每个节点在相对的下一个调度器级别将封顶的任务计数传送给相应的父调度器。

10. 发明申请

US20120023498A1 LOCAL MESSAGING IN A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR 有权
标题翻译：网络处理器交通管理员中的调度层次中的本地呼叫
公开(公告)号：US20120023498A1
公开(公告)日：2012-01-26
申请号：US13250898
申请日：2011-09-30
申请人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
发明人： Balakrishnan Sundararaman , Shashank Nemawarkar , David Sonnier , Allen Vestal
IPC分类号： G06F9/46
CPC分类号： H04L49/101 , G06F12/0813 , H04L47/621 , H04L47/623 , H04L49/00 , H04L49/109 , H04L49/506
摘要： Described embodiments provide for queuing tasks in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager performs a task enqueue operation for the task. The task enqueue operation includes adding the received task to an associated queue of the scheduling hierarchy, where the queue is associated with a data flow of the received task. The queue has a corresponding scheduler level M, where M is a positive integer less than or equal to N. Starting at the queue and iteratively repeating at each scheduling level until reaching the root scheduler, each node in the scheduling hierarchy maintains an actual count of tasks corresponding to the node. Each node communicates a capped task count to a corresponding parent scheduler at a relative next scheduler level.
摘要翻译：描述的实施例提供了在网络处理器的调度层次中排队任务。流量管理器生成具有根调度器和N个调度器级别的树调度层次。网络处理器生成与接收到的数据包相对应的任务。流量管理器执行任务的任务入队操作。任务排队操作包括将接收到的任务添加到调度层次结构的关联队列中，其中队列与接收到的任务的数据流相关联。队列具有对应的调度器级别M，其中M是小于或等于N的正整数。从队列开始并在每个调度级别迭代重复，直到到达根调度器，调度层次结构中的每个节点保持实际计数与节点对应的任务。每个节点在相对的下一个调度器级别将封顶的任务计数传送给相应的父调度器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式