Globally unique transaction identifiers
    4.
    发明授权
    Globally unique transaction identifiers 有权
    全球唯一的事务标识符

    公开(公告)号:US07716409B2

    公开(公告)日:2010-05-11

    申请号:US10832606

    申请日:2004-04-27

    IPC分类号: G06F13/14

    CPC分类号: G06F15/17381

    摘要: In one embodiment of the present invention, a method includes identifying a transaction from a first processor to a second processor of a system with a transaction identifier. The transaction identifier may have a value that is less than or equal to a maximum number of outstanding transactions between the two processors. In such manner, a transaction field for the transaction identifier may be limited to n bits, where the maximum number of outstanding transactions is less than or equal to 2n. In various embodiments, such a transaction identifier combined with a source identifier and a home node identifier may form a globally unique transaction identifier.

    摘要翻译: 在本发明的一个实施例中,一种方法包括从具有事务标识符的系统的第一处理器识别到第二处理器的事务。 事务标识符可以具有小于或等于两个处理器之间未完成事务的最大数量的值。 以这种方式,用于事务标识符的事务字段可以被限制为n位,其中未完成事务的最大数目小于或等于2n。 在各种实施例中,与源标识符和家庭节点标识符组合的这种事务标识符可以形成全局唯一的事务标识符。

    Globally Unique Transaction Identifiers
    5.
    发明申请
    Globally Unique Transaction Identifiers 有权
    全球唯一交易标识符

    公开(公告)号:US20100191890A1

    公开(公告)日:2010-07-29

    申请号:US12754089

    申请日:2010-04-05

    IPC分类号: G06F13/14

    CPC分类号: G06F15/17381

    摘要: In one embodiment of the present invention, a method includes identifying a transaction from a first processor to a second processor of a system with a transaction identifier. The transaction identifier may have a value that is less than or equal to a maximum number of outstanding transactions between the two processors. In such manner, a transaction field for the transaction identifier may be limited to n bits, where the maximum number of outstanding transactions is less than or equal to 2n. In various embodiments, such a transaction identifier combined with a source identifier and a home node identifier may form a globally unique transaction identifier.

    摘要翻译: 在本发明的一个实施例中,一种方法包括从具有事务标识符的系统的第一处理器识别到第二处理器的事务。 事务标识符可以具有小于或等于两个处理器之间未完成事务的最大数量的值。 以这种方式,用于事务标识符的事务字段可以被限制为n位,其中未完成事务的最大数目小于或等于2n。 在各种实施例中,与源标识符和家庭节点标识符组合的这种事务标识符可以形成全局唯一的事务标识符。

    Separating transactions into different virtual channels
    6.
    发明授权
    Separating transactions into different virtual channels 有权
    将事务分为不同的虚拟通道

    公开(公告)号:US07165131B2

    公开(公告)日:2007-01-16

    申请号:US10833236

    申请日:2004-04-27

    IPC分类号: G06F13/00 G06F13/36 G06F13/42

    CPC分类号: G06F13/36 G06F13/12

    摘要: In one embodiment of the present invention, a method may include separating incoming transactions to an agent of a coherent system into at least a first channel, a second channel, and a third channel, based upon a type of the incoming transactions. The incoming transactions may be sent by a peer device coupled to the coherent system. By separating the transactions based on type, deadlocks may be avoided.

    摘要翻译: 在本发明的一个实施例中,一种方法可以包括基于传入事务的类型,将进入的事务分离为至少第一信道,第二信道和第三信道中的相干系统的代理。 传入的事务可以由耦合到相干系统的对等设备发送。 通过基于类型分离事务,可能会避免死锁。

    Globally unique transaction identifiers
    7.
    发明授权
    Globally unique transaction identifiers 有权
    全球唯一的事务标识符

    公开(公告)号:US07921251B2

    公开(公告)日:2011-04-05

    申请号:US12754089

    申请日:2010-04-05

    IPC分类号: G06F13/14

    CPC分类号: G06F15/17381

    摘要: In one embodiment of the present invention, a method includes identifying a transaction from a first processor to a second processor of a system with a transaction identifier. The transaction identifier may have a value that is less than or equal to a maximum number of outstanding transactions between the two processors. In such manner, a transaction field for the transaction identifier may be limited to n bits, where the maximum number of outstanding transactions is less than or equal to 2n. In various embodiments, such a transaction identifier combined with a source identifier and a home node identifier may form a globally unique transaction identifier.

    摘要翻译: 在本发明的一个实施例中,一种方法包括从具有事务标识符的系统的第一处理器识别到第二处理器的事务。 事务标识符可以具有小于或等于两个处理器之间未完成事务的最大数量的值。 以这种方式,用于事务标识符的事务字段可以被限制为n位,其中未完成事务的最大数目小于或等于2n。 在各种实施例中,与源标识符和家庭节点标识符组合的这种事务标识符可以形成全局唯一的事务标识符。

    METHOD AND SYSTEM FOR FLEXIBLE AND NEGOTIABLE EXCHANGE OF LINK LAYER FUNCTIONAL PARAMETERS
    8.
    发明申请
    METHOD AND SYSTEM FOR FLEXIBLE AND NEGOTIABLE EXCHANGE OF LINK LAYER FUNCTIONAL PARAMETERS 有权
    链路层功能参数的灵活和可交换的方法和系统

    公开(公告)号:US20090064179A1

    公开(公告)日:2009-03-05

    申请号:US12242257

    申请日:2008-09-30

    IPC分类号: G06F9/46

    CPC分类号: G06F13/423

    摘要: A proposal is discussed that facilitates exchanging parameters for a link layer that allows a variable number of parameters without changing a communication protocol. Likewise, the proposal allows for both components connected via the link to negotiate values for the parameters that are exchanged without a need for external agent intervention or redundancy.

    摘要翻译: 讨论了一种促进交换参数的方案,该参数允许可变数量的参数而不改变通信协议。 同样,该建议允许通过链路连接的两个组件协商交换的参数的值,而不需要外部代理干预或冗余。

    System for flexible and negotiable exchange of link layer functional parameters
    9.
    发明授权
    System for flexible and negotiable exchange of link layer functional parameters 有权
    链路层功能参数的灵活协商交换系统

    公开(公告)号:US07484014B2

    公开(公告)日:2009-01-27

    申请号:US11238491

    申请日:2005-09-28

    IPC分类号: G06F3/00

    CPC分类号: G06F13/423

    摘要: A proposal is discussed that facilitates exchanging parameters for a link layer that allows a variable number of parameters without changing a communication protocol. Likewise, the proposal allows for both components connected via the link to negotiate values for the parameters that are exchanged without a need for external agent intervention or redundancy.

    摘要翻译: 讨论了一种促进交换参数的方案,该参数允许可变数量的参数而不改变通信协议。 同样,该建议允许通过链路连接的两个组件协商交换的参数的值,而不需要外部代理干预或冗余。