Priority based bus arbiters avoiding deadlock and starvation on buses that support retrying of transactions
    1.
    发明授权
    Priority based bus arbiters avoiding deadlock and starvation on buses that support retrying of transactions 有权
    基于优先级的总线仲裁器可以避免支持重试事务的公车上的僵局和饥饿

    公开(公告)号:US08370552B2

    公开(公告)日:2013-02-05

    申请号:US12250566

    申请日:2008-10-14

    IPC分类号: G06F13/36

    CPC分类号: G06F13/366

    摘要: A scheduler provided according to an aspect of the present invention provides higher priority for data units in a low priority queue upon occurrence of a starvation condition, and to packets in a high priority queue otherwise. The scheduler permits retransmission of a data unit in the lower priority queue when in the starvation condition, but clears the starvation condition when the data unit is retransmitted a pre-specified number of times. As a result, the data units in the higher priority queue would continue to be processed, thereby avoiding a deadlock at least in certain situations.

    摘要翻译: 根据本发明的一个方面提供的调度器在出现饥饿状况时对低优先级队列中的数据单元提供较高优先级,否则在高优先级队列中为分组提供高优先级。 当处于饥饿状态时,调度器允许在优先级较低的队列中重新发送数据单元,但是当数据单元重传预定次数时,可以清除饥饿状态。 结果,较高优先级队列中的数据单元将继续被处理,从而至少在某些情况下避免了死锁。

    Arbitration Based Allocation of a Shared Resource with Reduced Latencies
    2.
    发明申请
    Arbitration Based Allocation of a Shared Resource with Reduced Latencies 有权
    基于仲裁的共享资源分配与减少延迟

    公开(公告)号:US20100070667A1

    公开(公告)日:2010-03-18

    申请号:US12211126

    申请日:2008-09-16

    申请人: Aditya Mittal

    发明人: Aditya Mittal

    IPC分类号: G06F13/372

    CPC分类号: G06F13/364

    摘要: A digital processing system employing multiple arbiters, all designed to allocate a resource to a same entity in response to a same condition. In an embodiment, the entities needing the resource may send a request to all the arbiters, and the specific entity to which the resource is allocated, receives indication of the allocation from a closest one of the arbiters. As a result, the latency in receipt of indication of allocation may be reduced. The features are described in the context of a bus as a resource.

    摘要翻译: 一种采用多仲裁器的数字处理系统,全部被设计为响应于相同条件向同一实体分配资源。 在一个实施例中,需要资源的实体可以向所有仲裁者发送请求,并且分配资源的特定实体从最接近的一个仲裁者接收分配的指示。 结果,可以减少接收分配指示的延迟。 这些特征在总线作为资源的上下文中被描述。

    Method and system of reducing latencies associated with resource allocation by using multiple arbiters
    3.
    发明授权
    Method and system of reducing latencies associated with resource allocation by using multiple arbiters 有权
    通过使用多个仲裁器来减少与资源分配相关的延迟的方法和系统

    公开(公告)号:US08356128B2

    公开(公告)日:2013-01-15

    申请号:US12211126

    申请日:2008-09-16

    申请人: Aditya Mittal

    发明人: Aditya Mittal

    IPC分类号: G06F13/14

    CPC分类号: G06F13/364

    摘要: A digital processing system employing multiple arbiters, all designed to allocate a resource to a same entity in response to a same condition. In an embodiment, the entities needing the resource may send a request to all the arbiters, and the specific entity to which the resource is allocated, receives indication of the allocation from a closest one of the arbiters. As a result, the latency in receipt of indication of allocation may be reduced. The features are described in the context of a bus as a resource.

    摘要翻译: 一种采用多仲裁器的数字处理系统,全部被设计为响应于相同条件向同一实体分配资源。 在一个实施例中,需要资源的实体可以向所有仲裁者发送请求,并且分配资源的特定实体从最接近的一个仲裁者接收分配的指示。 结果,可以减少接收分配指示的延迟。 这些特征在总线作为资源的上下文中被描述。

    Priority Based Bus Arbiters Avoiding Deadlock And Starvation On Buses That Support Retrying Of Transactions
    4.
    发明申请
    Priority Based Bus Arbiters Avoiding Deadlock And Starvation On Buses That Support Retrying Of Transactions 有权
    基于优先级的总线仲裁者避免在支持重试事务的公共汽车上的死锁和饥饿

    公开(公告)号:US20100095036A1

    公开(公告)日:2010-04-15

    申请号:US12250566

    申请日:2008-10-14

    IPC分类号: G06F13/372

    CPC分类号: G06F13/366

    摘要: A scheduler provided according to an aspect of the present invention provides higher priority for data units in a low priority queue upon occurrence of a starvation condition, and to packets in a high priority queue otherwise. The scheduler permits retransmission of a data unit in the lower priority queue when in the starvation condition, but clears the starvation condition when the data unit is retransmitted a pre-specified number of times. As a result, the data units in the higher priority queue would continue to be processed, thereby avoiding a deadlock at least in certain situations.

    摘要翻译: 根据本发明的一个方面提供的调度器在出现饥饿状况时对低优先级队列中的数据单元提供较高优先级,否则在高优先级队列中为分组提供高优先级。 当处于饥饿状态时,调度器允许在优先级较低的队列中重新发送数据单元,但是当数据单元重传预定次数时,可以清除饥饿状态。 结果,较高优先级队列中的数据单元将继续被处理,从而至少在某些情况下避免了死锁。