US20140105228A1 - Communicating a message request transaction to a logical device - Google Patents

Communicating a message request transaction to a logical device Download PDF

Info

Publication number
US20140105228A1
US20140105228A1 US14108679 US201314108679A US20140105228A1 US 20140105228 A1 US20140105228 A1 US 20140105228A1 US 14108679 US14108679 US 14108679 US 201314108679 A US201314108679 A US 201314108679A US 20140105228 A1 US20140105228 A1 US 20140105228A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
completion
field
packet
request
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US14108679
Inventor
David Harriman
Original Assignee
David Harriman
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/38Information transfer, e.g. on bus
    • G06F13/42Bus transfer protocol, e.g. handshake; Synchronisation
    • G06F13/4282Bus transfer protocol, e.g. handshake; Synchronisation on a serial bus, e.g. I2C bus, SPI bus
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0706Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
    • G06F11/0745Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in an input/output transactions management context
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/38Information transfer, e.g. on bus
    • G06F13/40Bus structure
    • G06F13/4004Coupling between buses
    • G06F13/4022Coupling between buses using switching circuits, e.g. switching matrix, connection or expansion network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
    • H04L29/02Communication control; Communication processing contains provisionally no documents
    • H04L29/06Communication control; Communication processing contains provisionally no documents characterised by a protocol
    • H04L29/0653Header parsing and analysis
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Application independent communication protocol aspects or techniques in packet data networks
    • H04L69/22Header parsing or analysis

Abstract

A general input/output communication port implements a communication stack that includes a physical layer, a data link layer and a transaction layer. The transaction layer includes assembling a packet header for a message request transaction to one or more logical devices. The packet header includes a format field to indicate the length of the packet header and to further specify whether the packet header includes a data payload, a subset of a type field to indicate the packet header relates to the message request transaction and a message field. The message field includes a message to implement the message request transaction. The message includes at least one message that is selected from a group of messages. The group of messages to include a message to unlock a logical device, a message to reset a logical device, a message to indicate a correctable error condition, a message to indicate an uncorrectable error condition, a message to indicate a fatal error condition, a message to report a bad request packet, a message to indicate power management and a message to emulate an interrupt signal.

Description

    RELATED APPLICATIONS
  • [0001]
    This application is a continuation of U.S. patent application Ser. No. 13/722,927, filed on Dec. 20, 2012, entitled “COMMUNICATING A MESSAGE REQUEST TRANSACTION TO A LOGICAL DEVICE”; which is a continuation of U.S. Patent Application Ser. No. 12/824,833, filed on Jun. 28, 2010, now patented as U.S. Pat. No. 8,582,602 issued on Nov. 12, 2013, entitled “COMMUNICATING A MESSAGE REQUEST TRANSACTION TO A LOGICAL DEVICE”; which is a continuation of U.S. patent application Ser. No. 11/452,882, filed Jun. 13, 2006, now patented as U.S. Pat. No. 7,769,883 issued on Aug. 3, 2010 entitled “COMMUNICATING A MESSAGE REQUEST TRANSACTION TO A LOGICAL DEVICE”; which is a continuation of U.S. patent application Ser. No. 10/040,755, filed on Dec. 28, 2001, now patented as U.S. Pat. No. 7,099,318, issued on Aug. 29, 2006, entitled “COMMUNICATING MESSAGE REQUEST TRANSACTION TYPES BETWEEN AGENTS IN A COMPUTER SYSTEM USING MULTIPLE MESSAGE GROUPS,” the content of all of which is hereby incorporated by reference.
  • FIELD OF THE INVENTION
  • [0002]
    The present invention pertains to the field of computer systems. More particularly, this invention pertains to the field of high speed point-to-point interconnections and communications architectures.
  • BACKGROUND
  • [0003]
    Computing appliances, e.g., computer systems, servers, networking switches and routers, wireless communication devices, and the like are typically comprised of a number of disparate elements. Such elements often include a processor, system control logic, a memory system, input and output interfaces, and the like. To facilitate communication between such elements, computing appliances have long relied on general purpose input/output busses to enable these disparate elements of the computing system to communicate with one another in support of the myriad of applications offered by such appliances.
  • [0004]
    Perhaps one of the most pervasive of such general purpose bus architectures is the Peripheral Component Interconnect (PCI) bus. The PCI bus standard (Peripheral Component Interconnect (PCI) Local Bus Specification, Rev. 2.2, released Dec. 18, 1998) defines a multi-drop, parallel bus architecture for interconnecting chips, expansion boards, and processor/memory subsystems in an arbitrated fashion within a computing appliance. While typical PCI bus implementations have a 133 Mbps throughput (i.e., 32 bits at 33 MHz), the PCI 2.2 standard allows for 64 bits per pin of the parallel connection clocked at up to 133 MHz resulting in a theoretical throughput of just over 1 Gbps.
  • [0005]
    The throughput provided by the PCI bus architectures has, until recently, provided adequate bandwidth to accommodate the internal communication needs of even the most advanced of computing appliances (e.g., multiprocessor server applications, network appliances, etc.). However, recent advances in processing power and increasing input/output bandwidth demands create a situation where prior general purpose architectures such as the PCI bus architecture have become processing bottlenecks within such computing appliances.
  • [0006]
    Another limitation associated with prior architectures is that they are typically not well-suited to process isochronous (time dependent) data streams. An example of an isochronous data stream is a multimedia data stream which requires a transport mechanism to ensure that the data is consumed as fast as it is received and to ensure that the audio portion is synchronized with the video portion. Conventional general purpose input/output architectures process data asynchronously, or in random intervals as bandwidth permits. Such asynchronous processing of multimedia streams data can result in lost data and/or misaligned audio and video.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0007]
    The invention will be understood more fully from the detailed description given below and from the accompanying drawings of embodiments of the invention which, however, should not be taken to limit the invention to the specific embodiments described, but are for explanation and understanding only.
  • [0008]
    FIG. 1 is a block diagram of one embodiment of a computer system.
  • [0009]
    FIG. 2 is a graphical illustration of an example enhanced general input/output port.
  • [0010]
    FIG. 3 is a diagram showing the format of one embodiment of the start of a transaction layer packet header.
  • [0011]
    FIG. 4 is a diagram of a request packet header supporting a 32-bit address format.
  • [0012]
    FIG. 5 is a diagram of a request packet header supporting a 64-bit address format.
  • [0013]
    FIG. 6 is a diagram of a packet header for a Message.
  • [0014]
    FIG. 7 is a diagram showing a request header format for a configuration transaction.
  • [0015]
    FIG. 8 is a diagram showing one embodiment of a format for a completion header.
  • [0016]
    FIGS. 9 a and 9 b combined form a flow diagram of an example embodiment of a method for handling received transaction layer packets.
  • [0017]
    FIG. 10 is a flow diagram of one embodiment of a method for handling error conditions associated with received request packets.
  • [0018]
    FIG. 11 is a flow diagram of one embodiment of a method for handling a completion packet that is not expected by a system agent.
  • [0019]
    FIG. 12 is a flow diagram of one embodiment of a method for a requesting device handling a completion packet with a completion status other than “Successful Completion.”
  • [0020]
    FIG. 13 is a flow diagram of one embodiment of a method for a completing device handling a completion packet with a completion status other than “Successful Completion.”
  • DETAILED DESCRIPTION
  • [0021]
    Described below are embodiments of a point-to-point packet-based interconnection architecture, communication protocol and related methods to provide a scalable and extensible general input/output communication platform for deployment within an electronic appliance. The disclosed embodiments involve an enhanced general input/output interconnection architecture and associated communications protocol. One example embodiment includes one or more of a root complex including a host bridge, a switch, or endpoints, each incorporating at least a subset of enhanced general input/output features to support enhanced general input/output communication between such elements.
  • [0022]
    Communication between the enhanced general input/output facilities of such elements is performed in one embodiment using serial communication channels employing a communication protocol which supports one or more innovative features including, but not limited to, virtual communication channels, tailer-based error forwarding (“tailers” are appended to transaction layer packets to indicate an error condition), support for legacy PCI-based devices, multiple request response types, flow control and/or data integrity management facilities. The communication protocol supported in this embodiment includes a communication protocol stack including a physical layer, a data link layer and a transaction layer.
  • [0023]
    In an alternate embodiment, a communications agent incorporates an enhanced general input/output engine comprising a subset of the foregoing features. Further, one or more elements of the various embodiments may be implemented in hardware, software, a propagated signal, or a combination thereof.
  • [0024]
    FIG. 1 is a block diagram of an electronic appliance 100, which, for this embodiment, is a computer system. The system 100 includes a processor 102, a host bridge 103 included as part of a root complex 104, switch 108 and endpoint 110, each coupled as shown. The root complex 104, switch 108, and endpoint 110 include one or more instances of an enhanced general input/output communication port 106. As shown, each of the elements 102, 104, 108 and 110 are coupled to at least one other element through a communication link 112 supporting one or more enhanced general input/output communication channels via the enhanced general input/output communication port. The system 100 is intended to represent any of a wide variety of traditional and non-traditional computing systems, servers, network switches, network routers, wireless communication subscriber units, wireless communication telephony infrastructure elements, personal digital assistants, set-top boxes, or any electric appliance that would benefit from the communication resources introduced through integration of at least a subset of the enhanced general input/output interconnection architecture and/or communications protocol described herein.
  • [0025]
    In this example embodiment, processor 102 controls one or more aspects of the functional capability of the electronic appliance 100. In this regard, the processor 102 is representative of any of a wide variety of control logic devices including, but not limited to, one or more of a microprocessor, a programmable logic device (PLD), programmable logic array (PLA), application specific integrated circuit (ASIC), a microcontroller, and the like.
  • [0026]
    The root complex 104 provides a communications interface between the processor 102 and the switch 108 and endpoint 110. As used herein, the term “root complex” refers to a logical entity of an enhanced general input/output hierarchy that is closest to a host controller, a memory controller hub, an IO controller hub, or any combination of the above, or some combination of chipset/CPU elements (i.e., in a computing system environment). Although depicted in FIG. 1 as a single unit, the root complex 104 may be implemented with multiple physical components. The root complex 104 is populated with one or more enhanced general input/output ports 106 to facilitate communication with other peripheral devices, e.g., the switch 108, endpoint 110 and, although not particularly depicted, the legacy bridges 114, or 116. In one embodiment, each enhanced general input/output interface port represents a different hierarchy domain. In this regard, the embodiment of FIG. 1 denotes a root complex 104 with three hierarchy domains.
  • [0027]
    FIG. 2 is a graphical illustration of an example enhanced general input/output port 106. In this embodiment, the enhanced general input/output port 106 implements a communication stack comprising a transaction layer 202, a data link layer 204 and a physical layer 206 including a logical sub-block 208, and a physical sub-block 210, as shown. Elements of the transaction layer will be discussed below in more detail.
  • [0028]
    The transaction layer 202 provides an interface between the enhanced general input/output architecture and a device core. A primary responsibility of the transaction layer 202 is the assembly and disassembly of packets for one or more logical devices within an agent.
  • [0029]
    One of the primary goals of the enhanced general input/output architecture is to maximize the efficiency of communication between devices. In one embodiment, the transaction layer implements a pipelined full split-transaction protocol as well as mechanisms for differentiating the ordering and processing requirements of transaction layer packets. The transaction layer further comprehends transaction layer packet construction and processing.
  • [0030]
    One embodiment of the enhanced general input/output architecture supports the following basic transaction types and address spaces: Memory, I/O, Configuration, and Message. Two addressing types are supported: 32 bit and 64 bit.
  • [0031]
    Transactions are carried using Request and Completion packets, which may be referred to simply as Requests and Completions. Completions are used only where required, e.g.: to return read data, or to acknowledge completion of I/O and configuration write transactions. Completions are associated with their corresponding Requests by the value in the Requester ID field of the packet header (discussed below).
  • [0032]
    All transaction layer packets in this embodiment start with a defined header. Some transaction layer packets include data following the header as determined by the format field specified in the transaction layer packet header. The transaction layer packet is limited in size by a predetermined maximum payload size value. The transaction layer packet data in this embodiment is four-byte naturally aligned and in increments of four-byte double-words.
  • [0033]
    FIG. 3 is a diagram showing the format of one embodiment of the start of a transaction layer packet header. Each transaction layer packet header includes a three-bit format field (Fmt[2:0]). The transaction layer packet header also includes a four-bit type field (Type[3:0]). Both the Fmt and Type fields need to be decoded in order to determine the transaction layer packet format. Table 1 below shows example encodings for the Fmt field. TABLE-US-00001 TABLE 1 Fmt Field Encodings 000 2 double-word header, no data 001 3 double-word header, no data 010 4 double-word header, no data 101 3 double-word header, with data 110 4 double-word header, with data.
  • [0034]
    The transaction layer header for this embodiment also includes a two-bit Extended Type/Extended Length field (Et/El). This field is used to extend either the Type field or the Length field, depending on the value in the Type field. The Length field for this embodiment is ordinarily an eight-bit field, but may be extended to become a ten-bit field if the value in the Type field indicates that the Et/El field is to be used to extend the Length field. The Type field can be extended to become a six-bit field by appending the Et/El field, depending on the value in the Type[3:0] field. See Table 2 below for example Fmt, Type, and Et/El field encodings (alternative embodiments may use other encoding schemes). The Et/El field is used as an extension of the Type field except where noted. TABLE-US-00002 TABLE 2 Fmt, Type, and Et/El Encodings Packet Type Fmt[2:0] Type[3:0] Et/El[1:0] Description MRd 001 1001 E19 Memory Read Request Et/El field used for Length[9:8] 010 E18 MRdLk 001 1011 00 Memory Read Request—Locked 010 MWr 101 0001 E19 Memory Write Request—Posted Et/El field used for 110 E18 Length[9:8] IORd 001 1010 00 I0 Read Request IOWr 101 1010 00 I0 Write Request CfgRd0 001 1010 01 Configuration Read Type 0 CfgWr0 101 1010 01 Configuration Write Type 0 CfgRd1 001 1010 11 Configuration Read Type 1 CfgWr1 101 1010 11 Configuration Write Type 1 Msg 010 011 s.sub.2 s.sub.1s.sub.0 Message Request—The sub-field s[2:0] specifies a group of messages. The Message field must be decoded to determine specific cycle including if a Completion is required or not. MsgD 110 011s.sub.2 s.sub.1s.sub.0 Message Request with Data—The sub-field s[2:0] specifies a group of messages. The Message field must be decoded to determine specific cycle including if a Completion is required or not. MsgComm 110 110c.sub.2 c.sub.1 c.sub.0 Message for Advanced Switching—The sub-field c[2:0] specifies the message type: 000—Unicast, Data Packet 001—Multicast, Data Packet 010—Signaling Packet, without interrupt 011—Reserved 100—Null signaling Packet, interrupt to Host in the destination Hierarchy 101—Null signaling Packet, interrupt to destination device 110—Signaling Packet, with interrupt to Host in the destination Hierarchy 111—Signaling Packet, with interrupt to destination device Cp1 001 0100 00 Completion without Data—used for IO and Configuration Write Completions, and Memory Read Completions with Completion Status other than “Successful Completion.” Cp1D 101 0100 E19 Completion with Data—used for Memory, IO, and E18 Configuration Read Completions Et/El field used for Length[9:8] Cp1DLk 101 0101 01 Completion for Locked Memory Read.
  • [0035]
    Request packets include a Request Header which for some types of Request packets will be followed by some number of double-words of data. The term “double-word” as used herein indicates a 32-bit length of data. For this example embodiment, the Length field for Message Request Headers is not used except for Messages that explicitly refer to a data length. Also for this embodiment, for Memory Read Requests and Memory Write Requests, the El/Et field is concatenated with the Length field to form a ten-bit length field. The ten-bit length field allows read and write requests indicating up to 4 kB of data. Other types of transaction layer packets are limited by the size of the Length[7:0] field to indicating up to 1 kB of data. The amount of data included in any transaction layer packet is limited in one embodiment to a predetermined maximum payload size. For transaction layer packets that include data, the value in the Length field and the actual amount of data should be equal. If the receiver determines that the Length field value and the actual amount of data do not match, then the packet is treated as a Malformed Transaction Layer Packet. Malformed Transaction Layer Packets are described below.
  • [0036]
    FIG. 4 is a diagram of a request packet header supporting a 32-bit address format and FIG. 5 is a diagram of a request packet header supporting a 64-bit address format. For one embodiment, memory read requests and memory write requests case use either the 32-bit address format or the 64-bit address format. For addresses below 4 GB, the 32-bit format is used.
  • [0037]
    The request packet headers of FIGS. 4 and 5 also include a First Double Word Byte Enable field (1.sup.st DW BE) and a Last Double Word Byte Enable field (Last DW BE). The First Double Word Byte Enable field contains byte enables for the first double word of any memory read or write request. This field also contains byte enables for the only double word of an input/output or configuration request. The Last Double Word Byte Enable field contains byte enables for the last double word of any memory read or write request. The byte enable fields are not used with Messages because these fields overlap the message code field for a message request header (See FIG. 7, discussed below).
  • [0038]
    For one embodiment, for each bit in the byte enable fields, a value of “0” indicates that the corresponding byte of data is not written or, if non-prefetchable, read at a completor. The term “completer” as used herein is meant to indicate a logical device addressed by a request packet header. A value of “1” indicates that the corresponding byte of data is written or, if non-prefetchable, read at the completer. For the First Double Word Byte Enables field, bit 0 corresponds to byte 0 of the first double word of data. Bit 1 corresponds to byte 1 of the first double word of data. Bit 2 corresponds to byte 2 of the first double word of data. Bit 3 corresponds to byte 3 of the first double word of data. For the Last Double Word Byte Enables field, bit 0 corresponds to byte 0 of the last double word of data. Bit 1 corresponds to byte 1 of the last double word of data. Bit 2 corresponds to byte 2 of the last double word of data. Bit 3 corresponds to byte 3 of the last double word of data.
  • [0039]
    The example packet headers of FIGS. 4, 5, 6, and 8 include a Requestor ID field, a Tag field, an Attribute field, and a Virtual Channel ID field. The Requestor ID field and the Tag field together form a Transaction ID field. The Requestor ID field is divided into a Bus Number field, a Device Number field, and a Function Number field.
  • [0040]
    The Tag field is a 5-bit field generated by each requesting device. The tag value is unique for all outstanding requests that require a completion for that requesting device. The Transaction ID field is included with all Requests and Completions. The Requestor ID field for these example embodiments is a 16-bit value that is unique for every function (a function is one independent section of a multi-function device identified in configuration space by a unique function number). Functions capture the Bus Number supplied with all configuration writes completed by the function, and supply this number in the Bus Number section of the Requestor ID field. Each logical device in a component is designed to respond to a unique Device Number for configuration requests addressing that component. For these example embodiments a component may contain many (perhaps up to several dozen) logical devices. Each function associated with a logical device in a component is designed to respond to a unique function number for configuration requests addressing that component and logical device. Each logical device may contain up to eight logical functions.
  • [0041]
    The Attributes field specifies characteristics of the transaction. Attributes that may be specified in the attributes field include a priority attribute, transaction ordering attributes, and cache coherency management attributes.
  • [0042]
    The Virtual Channel ID field identifies the virtual channel. For these example embodiments, the Virtual Channel ID field is a 4-bit field that allows identification of up to 16 virtual channels on a per transaction basis. For these example embodiments, virtual channel 0 is used for general purpose traffic and a virtual channel other than 0 is used for isochronous traffic.
  • [0043]
    FIG. 6 is a diagram of a packet header for a Message. As seen in Table 2, messages may or may not include data and may or may not require completion. Messages are decoded by all devices in a system that support the enhanced general input/output interconnection architecture.
  • [0044]
    For message requests, the Message field is decoded in order to determine the specific cycle and to determine whether the message includes data and whether the message requires completion. The Message field for this embodiment is an 8-bit field located where the byte enable fields normally reside for other transaction types. Unsupported messages are treated by the receiving device as no-completion-required (no-completion-required transactions discussed below).
  • [0045]
    Messages for this example embodiment are divided into groups. There are eight groups that include data with the request and eight groups that do not. Other embodiments are possible using different numbers of groups. For this embodiment, as shown in Table 2, the eight groups that include data with the requests have a value of b110 in the Fmt field. The eight groups that do not include data have a value of b010 in the Fmt field. The sub-field s[2:0] incorporates one bit from the Type field and the two bits from the Et/El field. The sub-field s[2:0] indicates one of eight groups.
  • [0046]
    Examples of various messages that may be implemented include, but are not limited to, the following: messages for unlocking devices; messages for resetting devices; messages indicating a correctable error condition; messages indicating an uncorrectable error condition; messages indicating a fatal error condition; messages used to report bad request packets; messages relating to power management; messages related to ordering control/management; and messages for emulating legacy (e.g., PCI) interrupt signals (or other legacy signals). These various message types can be subdivided into one of the previously discussed groups. For example, all of the power management messages may be included in one group and the interrupt signaling messages may be included in another. Embodiments are also possible where one or more groups are set aside for vendor-specific use.
  • [0047]
    FIG. 7 is a diagram showing a request header format for a configuration transaction. The configuration space is one of the four supported address spaces for these example embodiments.
  • [0048]
    FIG. 8 is a diagram showing one embodiment of a format for a completion header. All read requests and some write requests require completion. Completions include a completion header that, for some types of completions, are followed by some number of double-words of data. The Completion Status[2:0] field shown in FIG. 8 indicates the status for a completion. Table 3 shows one example encoding scheme. TABLE-US-00003 TABLE 3 Completion Status Field Encoding Scheme Completion Status[2:0] Status 000 Successful Completion 001 Unsupported Request—Expecting Completion 011 Reserved 100 Completer Abort.
  • [0049]
    The Completer ID[15:0] field contains the same type of information as the Requestor ID field described above. The value provided in the Completer ID field corresponds to the bus/device/function of the agent that completes the request. Completion headers contain the same values for Requester ID, Tag, and Channel ID as were supplied in the header of the request packet. Completion headers also contain the same value in the Attribute field as was initially supplied with the header of the request. Completion packets are routed by switches and root complexes to the port that initiated the corresponding request transaction.
  • [0050]
    For memory read request transactions, individual completion packets may provide less than the full amount of data requested by the corresponding read request so long as all of the completion packets associated with the corresponding read request, when combined, return the amount of data specified. For these example embodiments, I/O and Configuration read requests are completed with exactly one completion packet.
  • [0051]
    A completion that includes data specifies the amount of data in the packet header. If the completion packet actually contains an amount of data that differs from the specified amount, a malformed transaction layer packet results.
  • [0052]
    FIGS. 9 a and 9 b combined form a flow diagram of an example embodiment of a method for handling received transaction layer packets. The operations described below do not necessarily need to occur in a serial fashion. Some embodiments may perform some operations simultaneously. At block 905, a check is made to determine whether the values contained in the Fmt and Length fields of the received packet match the actual size of the packet. A mismatch indicates a malformed packet and an error case results as shown at block 925. Error case handling will be discussed below. If the actual size of the received packet does not indicate a mismatch with the Fmt and Length fields, then processing continues at block 910.
  • [0053]
    If the received packet is a memory request using 64 bit addressing, then at block 910 the address bits [63:32] are checked to see whether any of the address bits [63:32] are non-zero. If none of the address bits [63:32] are non-zero, then the result is a malformed packet and processing proceeds to the error case block 925. If at least one of the address bits [63:32] are non-zero, then processing continues at block 915.
  • [0054]
    At block 915, a check is made to determine whether any fields in the packet header contain reserved values. If reserved values are found, then the result is an malformed packet and processing proceeds to block 925. If no reserved values are found, then processing continues at block 930.
  • [0055]
    At block 930, a determination is made as to whether the packet is a request packet or a completion packet. If the packet is a completion packet, then processing proceeds to the completion handling block 935. Completion handling will be discussed more fully below. If the received packet is not a completion packet, then processing continues at block 940. Note that all packets that flow to block 940 are request packets.
  • [0056]
    At block 940, a check is made to determine whether the request packet is a request type that is supported by the completing device. If the request type is not supported, then the result is an unsupported request and processing proceeds to the error case block 925. For this example embodiment, if the unsupported request type is a broadcast message or a message using an encoding reserved for broadcast messages, then the packet is silently dropped and no error case results. If the request type is supported by the completing device, then processing continues at block 945.
  • [0057]
    If, as shown at block 945, the completing device is unable to respond to the request packet due to an internal error, then the result is a “completer abort” and processing proceeds to error case block 925. Otherwise, the request is serviced at block 950. In servicing the request, it may be necessary to repeat the processing indicated by blocks 940 and 945.
  • [0058]
    Once the request is serviced successfully, then processing continues at block 955. As indicated by block 955, if the processed request requires a completion, then a completion packet is returned at block 960.
  • [0059]
    FIG. 10 is a flow diagram of one embodiment of a method for handling error conditions associated with received request packets. As seen at block 1010, if the received request is expecting a completion, then a completion with the appropriate completion status is transmitted at block 1020. The completion is routed back to the requesting device. If the received request is not expecting a completion, then an error message is transmitted to the requesting device at block 1030. The error is reported to the system at block 1040. The error message transmitting operating denoted at block 1030 may be implemented as a programmable option.
  • [0060]
    Some systems may include one or more PCI buses in addition to the previously discussed enhanced general input/output interconnection architecture. For memory, I/O, and configuration requests traveling through the enhanced general input/output interconnection architecture and destined to a device on a PCI bus, the completion status for these embodiments represents the actual PCI termination for the cycle. For example, a non-posted PCI cycle must actually be serviced on the PCI bus before a completion status can be determined. For all other cases, the completion status values are defined as discussed below.
  • [0061]
    When a request is completed successfully by the completing device, the resulting completion status value is “Successful Completion” (encoded in the completion status field as “000” for this embodiment as indicated in Table 3). For example, a read request from a host bridge is routed through a switch to a completer endpoint. The Completer responds with a completion packet indicating a successful completion status and also responds with the data for the read request. The switch routes this completion packet back to the host bridge.
  • [0062]
    When a request is received and decoded by the completing device, but the completing device does not support the requested transaction and the request requires a completion, the resulting completion status is “Unsupported Request” (encoded in the completion status field as “001” for this embodiment as indicated in Table 3). One example of an unsupported request would be a memory read request to an out-of-range address. In this case, the completer is not able to support the request and the requester is expecting a completion.
  • [0063]
    For the case where a request is received and decoded by the completing device and the completing device is unable to support the requested transaction and the requesting device in not expecting a completion, the resulting completion status is an unsupported request. Since the requesting device is not expecting a completion, the completion status is communicated to the requesting device via a message as described above in connection with FIG. 10. An example of an unsupported request where the requesting device is not expecting a completion is a memory write transaction to an out-of-range address. The communication of the completion status via a message may be implemented as an optional feature.
  • [0064]
    When a completing device receives and decodes a request, but the completing device is unable to respond due to an internal error, the resulting completion status is a “Completer Abort” (encoded in the completion status field as “100” for this embodiment).
  • [0065]
    When a completing device receives a packet that violates packet formation rules, the result is a “Malformed Packet.” The completing device responds to this situation by transmitting a “Malformed Packet” error message that is routed to the requesting device. A switch that receives a malformed packet must, for this embodiment, route the packet to the upstream port if no other port can be positively identified as the intended destination port.
  • [0066]
    When a read completion has a completion status other than “Successful Completion,” no data is returned with the completion packet. The read completion with the non-successful completion status is the last completion transmitted for the request. For example, a completer may split a read request into four parts for servicing and the second completion packet results in a completer abort completion status. The final two completion packets are not transmitted. The requesting device, once it receives the completion packet with the non-successful completion status, considers the request terminated and should not expect additional completion packets corresponding to that read request.
  • [0067]
    FIG. 11 is a flow diagram of one embodiment of a method for handling a completion packet that is not expected by a system agent. An “unexpected completion” occurs when an agent receives a completion that does not correspond to any outstanding requests issued by that same agent. For the example method of FIG. 11, block 1110 indicates that if there is no unexpected completion then normal operation continues at block 1120. If, however, an unexpected completion is received, the unexpected completion packet is discarded at block 1130. After the packet is discarded, the above error condition may be reported to the system at block 1140. For this example embodiment, the reporting of the error may be an option that is programmable by software.
  • [0068]
    FIG. 12 is a flow diagram of one embodiment of a method for a requesting device handling a completion packet with a completion status other than “Successful Completion.” Block 1210 indicates that if the completion status is “Successful Completion”, then normal operation continues at block 1220. If the completion status is other than “Successful Completion”, then at block 1230 the value of the Completer ID field is recorded. For this embodiment the Completer ID value is stored in a register. Then, at block 1240, a “Received Unsuccessful Completion” bit is set in a register in the requesting device for this embodiment. The above error condition may be reported at block 1250. The reporting of the error condition may be implemented as a programmable option. A software agent may use the Completer ID value and the “Received Unsuccessful Completion” bit to track down the source of the error condition.
  • [0069]
    FIG. 13 is a flow diagram of one embodiment of a method for a completing device handling a completion packet with a completion status other than “Successful Completion.” Block 1310 indicates that if the completion status of a transmitted completion packet is “Successful Completion”, then normal operation continues at block 1320. If the completion status is other than “Successful Completion”, then at block 1330 the value of the Requester ID and Tag fields are recorded. For this embodiment, the Requester ID and Tag values are stored in one or more registers. Then, at block 1340, a “Transmitted Unsuccessful Completion” bit is set in a register in the completing device for this embodiment. The above error condition may be reported at block 1350. The reporting of the error condition may be implemented as a programmable option. A software agent may use the Requester ID and Tag values and the “Transmitted Unsuccessful Completion” bit to track down the source of the error condition.
  • [0070]
    In the foregoing specification the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.
  • [0071]
    Reference in the specification to “an embodiment,” “one embodiment,” “some embodiments,” or “other embodiments” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least some embodiments, but not necessarily all embodiments, of the invention. The various appearances of “an embodiment,” “one embodiment,” or “some embodiments” are not necessarily all referring to the same embodiments.
  • [0072]
    While the present invention has been described with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover all such modifications and variations as fall within the true spirit and scope of this present invention.

Claims (13)

    What is claimed is:
  1. 1. An apparatus, comprising:
    a non-mobile electronic appliance including a processor, a root complex, a host bridge, and switch wherein the non-mobile electronic appliance further includes,
    a protocol stack including layers to communicate data over an interconnect;
    wherein the protocol stack is to assemble a plurality of packets, each of the plurality of packets to include:
    a first field to hold a first value to indicate a first packet of the plurality of
    packets which is to include a data payload and to hold a second value to indicate a particular
    packet of the plurality of packets and is not to include a data payload,
    a type field to indicate a packet type for the particular packet, and
    a value field to indicate an identifier to be associated with the particular packet.
  2. 2. The apparatus of claim 1, wherein the packet is a data packet.
  3. 3. The apparatus of claim 1, wherein the protocol stack including layers comprises a physical layer and a data link layer.
  4. 4. The apparatus of claim 1, wherein the interconnect includes a communication link.
  5. 5. The apparatus of claim 1, wherein the interconnect is to support a plurality of devices.
  6. 6. The apparatus of claim 1, wherein the apparatus is to operate within a packet-based interconnection architecture.
  7. 7. An electronic appliance, comprising:
    a server including a processor, a root complex, a host bridge, and switch wherein the server further includes,
    a protocol stack including layers to communicate data over an interconnect;
    wherein the protocol stack is to assemble a plurality of packets, each of the plurality of packets to include:
    a first field to indicate a format for a packet type;
    a second field to indicate a transaction completion status;
    a third field to indicate an identification of a first device which processed
    the transaction completion in response to a request; and
    a fourth field to indicate an identification of a second device which initiated the request.
  8. 8. The electronic appliance of claim 7, wherein the second field includes a three-bit format field.
  9. 9. The electronic appliance of claim 7 includes at least one of a cellular telephone, handheld computer, multimedia device, and a digital camera.
  10. 10. The electronic appliance of claim 7, wherein the transaction completion status is an indication of a correct receipt of a packet.
  11. 11. The electronic appliance of claim 7, wherein the first device includes an endpoint device.
  12. 12. The electronic appliance of claim 7, wherein the interconnect is to support networks of devices.
  13. 13. The electronic appliance of claim 7, wherein the layers includes a transaction layer.
US14108679 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device Abandoned US20140105228A1 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US10040755 US7099318B2 (en) 2001-12-28 2001-12-28 Communicating message request transaction types between agents in a computer system using multiple message groups
US11452882 US7769883B2 (en) 2001-12-28 2006-06-13 Communicating message request transaction types between agents in a computer system using multiple message groups
US12824833 US8582602B2 (en) 2001-12-28 2010-06-28 Communicating a message request transaction to a logical device
US13722927 US20130114602A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device
US14108679 US20140105228A1 (en) 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US14108679 US20140105228A1 (en) 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US13722927 Continuation US20130114602A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device

Publications (1)

Publication Number Publication Date
US20140105228A1 true true US20140105228A1 (en) 2014-04-17

Family

ID=21912752

Family Applications (11)

Application Number Title Priority Date Filing Date
US10040755 Active 2022-05-22 US7099318B2 (en) 2001-12-28 2001-12-28 Communicating message request transaction types between agents in a computer system using multiple message groups
US11452882 Active 2024-03-15 US7769883B2 (en) 2001-12-28 2006-06-13 Communicating message request transaction types between agents in a computer system using multiple message groups
US12824833 Active 2023-05-10 US8582602B2 (en) 2001-12-28 2010-06-28 Communicating a message request transaction to a logical device
US13722927 Abandoned US20130114602A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device
US13722904 Abandoned US20130117490A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device
US14108679 Abandoned US20140105228A1 (en) 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device
US14108675 Abandoned US20140105108A1 (en) 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device
US14143671 Abandoned US20140133499A1 (en) 2001-12-28 2013-12-30 Communicating a message request transaction to a logical device
US14144400 Abandoned US20150078401A9 (en) 2001-12-28 2013-12-30 Communicating message request transaction types between agents in a computer system using multiple message groups
US14144406 Abandoned US20150082091A9 (en) 2001-12-28 2013-12-30 Communicating message request transaction types between agents in a computer system using multiple message groups
US14799165 Pending US20160070671A1 (en) 2001-12-28 2015-07-14 Communicating a message request transaction to a logical device

Family Applications Before (5)

Application Number Title Priority Date Filing Date
US10040755 Active 2022-05-22 US7099318B2 (en) 2001-12-28 2001-12-28 Communicating message request transaction types between agents in a computer system using multiple message groups
US11452882 Active 2024-03-15 US7769883B2 (en) 2001-12-28 2006-06-13 Communicating message request transaction types between agents in a computer system using multiple message groups
US12824833 Active 2023-05-10 US8582602B2 (en) 2001-12-28 2010-06-28 Communicating a message request transaction to a logical device
US13722927 Abandoned US20130114602A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device
US13722904 Abandoned US20130117490A1 (en) 2001-12-28 2012-12-20 Communicating a message request transaction to a logical device

Family Applications After (5)

Application Number Title Priority Date Filing Date
US14108675 Abandoned US20140105108A1 (en) 2001-12-28 2013-12-17 Communicating a message request transaction to a logical device
US14143671 Abandoned US20140133499A1 (en) 2001-12-28 2013-12-30 Communicating a message request transaction to a logical device
US14144400 Abandoned US20150078401A9 (en) 2001-12-28 2013-12-30 Communicating message request transaction types between agents in a computer system using multiple message groups
US14144406 Abandoned US20150082091A9 (en) 2001-12-28 2013-12-30 Communicating message request transaction types between agents in a computer system using multiple message groups
US14799165 Pending US20160070671A1 (en) 2001-12-28 2015-07-14 Communicating a message request transaction to a logical device

Country Status (5)

Country Link
US (11) US7099318B2 (en)
EP (2) EP2063604B1 (en)
CN (2) CN1608256A (en)
DE (1) DE60232814D1 (en)
WO (1) WO2003058470A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9946683B2 (en) 2014-12-24 2018-04-17 Intel Corporation Reducing precision timing measurement uncertainty

Families Citing this family (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7099318B2 (en) * 2001-12-28 2006-08-29 Intel Corporation Communicating message request transaction types between agents in a computer system using multiple message groups
US7103064B2 (en) * 2003-01-21 2006-09-05 Nextio Inc. Method and apparatus for shared I/O in a load/store fabric
US8346884B2 (en) * 2003-01-21 2013-01-01 Nextio Inc. Method and apparatus for a shared I/O network interface controller
US7046668B2 (en) * 2003-01-21 2006-05-16 Pettey Christopher J Method and apparatus for shared I/O in a load/store fabric
US7836211B2 (en) * 2003-01-21 2010-11-16 Emulex Design And Manufacturing Corporation Shared input/output load-store architecture
US8032659B2 (en) * 2003-01-21 2011-10-04 Nextio Inc. Method and apparatus for a shared I/O network interface controller
US20060050693A1 (en) * 2004-09-03 2006-03-09 James Bury Building data packets for an advanced switching fabric
US20060050722A1 (en) * 2004-09-03 2006-03-09 James Bury Interface circuitry for a receive ring buffer of an as fabric end node device
US7260661B2 (en) * 2004-09-03 2007-08-21 Intel Corporation Processing replies to request packets in an advanced switching context
US7949794B2 (en) 2006-11-02 2011-05-24 Intel Corporation PCI express enhancements and extensions
US7756014B1 (en) * 2007-02-22 2010-07-13 Integrated Device Technology, Inc. Device and method for handling catastrophic routing
US8176391B2 (en) * 2008-01-31 2012-05-08 International Business Machines Corporation System to improve miscorrection rates in error control code through buffering and associated methods
US8352806B2 (en) * 2008-01-31 2013-01-08 International Business Machines Corporation System to improve memory failure management and associated methods
US9128868B2 (en) * 2008-01-31 2015-09-08 International Business Machines Corporation System for error decoding with retries and associated methods
US8185800B2 (en) * 2008-01-31 2012-05-22 International Business Machines Corporation System for error control coding for memories of different types and associated methods
US8171377B2 (en) 2008-01-31 2012-05-01 International Business Machines Corporation System to improve memory reliability and associated methods
US8181094B2 (en) * 2008-01-31 2012-05-15 International Business Machines Corporation System to improve error correction using variable latency and associated methods
US8185801B2 (en) 2008-01-31 2012-05-22 International Business Machines Corporation System to improve error code decoding using historical information and associated methods
US8910233B2 (en) 2008-12-22 2014-12-09 Mediatek Inc. Signal processing apparatuses capable of processing initially reproduced packets prior to buffering the initially reproduced packets
US8055805B2 (en) 2009-03-31 2011-11-08 Intel Corporation Opportunistic improvement of MMIO request handling based on target reporting of space requirements
US8340056B2 (en) * 2009-09-25 2012-12-25 Meteorcomm Llc Systems and methods for interoperability positive train control
US8782461B2 (en) * 2010-09-24 2014-07-15 Intel Corporation Method and system of live error recovery
CN102137092A (en) * 2010-12-10 2011-07-27 华为技术有限公司 Method and system for supporting conference system media packet capturing in multimedia subsystem
US8750333B2 (en) * 2011-02-14 2014-06-10 Telefonaktiebolaget Lm Ericsson (Publ) Backwards-compatible approach to fields of a protocol layer
US8437343B1 (en) 2012-05-22 2013-05-07 Intel Corporation Optimized link training and management mechanism
US8446903B1 (en) 2012-05-22 2013-05-21 Intel Corporation Providing a load/store communication protocol with a low power physical unit
US8549205B1 (en) 2012-05-22 2013-10-01 Intel Corporation Providing a consolidated sideband communication channel between devices
US9128811B2 (en) 2012-06-26 2015-09-08 Intel Corporation Assigning addresses to devices on an interconnect
US8924611B2 (en) 2012-06-26 2014-12-30 Intel Corporation Providing a serial protocol for a bidirectional serial interconnect
US8972640B2 (en) 2012-06-27 2015-03-03 Intel Corporation Controlling a physical link of a first protocol using an extended capability structure of a second protocol
US9152596B2 (en) 2012-06-29 2015-10-06 Intel Corporation Architected protocol for changing link operating mode
US9141556B2 (en) 2012-08-18 2015-09-22 Qualcomm Technologies, Inc. System translation look-aside buffer with request-based allocation and prefetching
US9262270B2 (en) * 2012-12-28 2016-02-16 Intel Corporation Live error recovery
US9261934B2 (en) 2013-03-15 2016-02-16 Intel Corporation Dynamic response improvement of hybrid power boost technology
WO2015030819A1 (en) * 2013-08-30 2015-03-05 Hewlett-Packard Development Company, L.P. Completion packet return
US9612643B2 (en) 2014-03-29 2017-04-04 Intel Corporation Controlling the CPU slew rates based on the battery state of charge
US9710406B2 (en) 2014-12-15 2017-07-18 Intel Corporation Data transmission using PCIe protocol via USB port

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5828835A (en) * 1995-05-10 1998-10-27 3Com Corporation High throughput message passing process using latency and reliability classes
US6542504B1 (en) * 1999-05-28 2003-04-01 3Com Corporation Profile based method for packet header compression in a point to point link
US20030115380A1 (en) * 2001-08-24 2003-06-19 Jasmin Ajanovic General input/output architecture, protocol and related methods to support legacy interrupts
US20030115513A1 (en) * 2001-08-24 2003-06-19 David Harriman Error forwarding in an enhanced general input/output architecture and related methods
US20030115391A1 (en) * 2001-08-24 2003-06-19 Jasmin Ajanovic Enhanced general input/output architecture and related methods for establishing virtual channels therein
US6678283B1 (en) * 1999-03-10 2004-01-13 Lucent Technologies Inc. System and method for distributing packet processing in an internetworking device
US6791947B2 (en) * 1996-12-16 2004-09-14 Juniper Networks In-line packet processing
US7873699B2 (en) * 2001-05-30 2011-01-18 Lg Electronics Inc. Network control system for home appliances

Family Cites Families (55)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3690058A (en) * 1969-09-25 1972-09-12 Suwa Seikosha Kk Electric or electronic timepiece
BE758811A (en) * 1969-11-28 1971-04-16 Burroughs Corp information processing system having a storage structure for treatment without nested
US3735363A (en) * 1971-04-07 1973-05-22 Burroughs Corp Information processing system employing stored microprogrammed processors and access free field memories
US4058672A (en) * 1976-11-10 1977-11-15 International Telephone And Telegraph Corporation Packet-switched data communications system
US4464717A (en) * 1982-03-31 1984-08-07 Honeywell Information Systems Inc. Multilevel cache system with graceful degradation capability
DE3332601A1 (en) 1983-09-09 1985-03-28 Siemens Ag memory cells having to register of addresses of faulty memory content circuitry
US4930069A (en) * 1987-11-18 1990-05-29 International Business Machines Corporation Mechanism and method for transferring data between bus units having varying master and slave DMA capabilities
JPH0746322B2 (en) 1988-05-23 1995-05-17 日本電気株式会社 Failure device-specific system
US5187780A (en) 1989-04-07 1993-02-16 Digital Equipment Corporation Dual-path computer interconnect system with zone manager for packet memory
JPH06500655A (en) * 1990-10-03 1994-01-20
CA2065578C (en) 1991-04-22 1999-02-23 David W. Carr Packet-based data compression method
JP2700843B2 (en) 1991-12-10 1998-01-21 三菱電機株式会社 Multiplex communication control unit
JPH0619785A (en) 1992-03-27 1994-01-28 Matsushita Electric Ind Co Ltd Distributed shared virtual memory and its constitution method
US5687388A (en) * 1992-12-08 1997-11-11 Compaq Computer Corporation Scalable tree structured high speed input/output subsystem architecture
US5457701A (en) * 1994-01-06 1995-10-10 Scientific-Atlanta, Inc. Method for indicating packet errors in a packet-based multi-hop communications system
JP3625302B2 (en) 1994-07-19 2005-03-02 株式会社東芝 Data delivery device and method for a network system
US5678007A (en) 1994-11-22 1997-10-14 Microsoft Corporation Method and apparatus for supporting multiple outstanding network requests on a single connection
US5748633A (en) * 1995-07-12 1998-05-05 3Com Corporation Method and apparatus for the concurrent reception and transmission of packets in a communications internetworking device
US5870538A (en) 1995-07-19 1999-02-09 Fujitsu Network Communications, Inc. Switch fabric controller comparator system and method
DE19531936A1 (en) 1995-08-17 1997-02-20 Schering Ag Combination preparation for contraception kits containing them and a method using this
US5920705A (en) 1996-01-31 1999-07-06 Nokia Ip, Inc. Method and apparatus for dynamically shifting between routing and switching packets in a transmission network
US5968197A (en) 1996-04-01 1999-10-19 Ericsson Inc. Method and apparatus for data recovery
JPH10341247A (en) 1997-06-10 1998-12-22 Sony Corp Data transmitter, data receiver, data transmission system and data transmission method
US6760307B2 (en) 1997-08-29 2004-07-06 Intel Corporation Method and apparatus for controlling the flow of data between servers using optimistic transmitter
US6084869A (en) * 1997-10-06 2000-07-04 Hughes Electronics Corporation Resource reservation for packet-switched multiple-path communication system
US6131809A (en) * 1997-11-28 2000-10-17 Diebold, Incorporated Control system communication apparatus and method for currency recycling automated banking machine
US6395637B1 (en) 1997-12-03 2002-05-28 Electronics And Telecommunications Research Institute Method for fabricating a inductor of low parasitic resistance and capacitance
US6690648B2 (en) 1998-02-24 2004-02-10 Canon Kabushiki Kaisha Data communication apparatus, method, and system utilizing reception capability information of a destination node
US6055236A (en) 1998-03-05 2000-04-25 3Com Corporation Method and system for locating network services with distributed network address translation
US6154839A (en) 1998-04-23 2000-11-28 Vpnet Technologies, Inc. Translating packet addresses based upon a user identifier
JP2000003330A (en) * 1998-06-16 2000-01-07 Sony Corp Device and method for information processing, and provision medium
US6515967B1 (en) * 1998-06-30 2003-02-04 Cisco Technology, Inc. Method and apparatus for detecting a fault in a multicast routing infrastructure
US6359877B1 (en) 1998-07-21 2002-03-19 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for minimizing overhead in a communication system
US6374282B1 (en) * 1998-08-28 2002-04-16 Compaq Computer Corporation Method and apparatus for tracking multi-threaded system area network (SAN) traffic
US6389016B1 (en) 1998-10-14 2002-05-14 Nortel Networks Limited Data communication system and method for transporting data
US6424625B1 (en) 1998-10-28 2002-07-23 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for discarding packets in a data network having automatic repeat request
US20030110317A1 (en) * 1998-11-03 2003-06-12 Jasmin Ajanovic Method and apparatus for an improved interface between a memory control hub and an input/output control hub
US6175884B1 (en) * 1998-11-03 2001-01-16 Intel Corporation Efficient communication of transaction types using separate and orthogonal attribute fields in packet headers transferred between hubs in a computer system
JP2000209220A (en) 1999-01-14 2000-07-28 Toshiba Corp Computer, network controller, system using them and remote start method
DE60038264T2 (en) 1999-05-31 2009-04-23 Thomson Licensing A method for pre-processing of data packets in a bus interface
CN1136706C (en) * 1999-09-01 2004-01-28 信息产业部武汉邮电科学研究院 Adaption method for integrating Internet with quasi-synchronous digital system
US6636912B2 (en) * 1999-10-07 2003-10-21 Intel Corporation Method and apparatus for mode selection in a computer system
US6480965B1 (en) * 1999-10-07 2002-11-12 Intel Corporation Power management method for a computer system having a hub interface architecture
US6519731B1 (en) 1999-10-22 2003-02-11 Ericsson Inc. Assuring sequence number availability in an adaptive hybrid-ARQ coding system
US6496895B1 (en) * 1999-11-01 2002-12-17 Intel Corporation Method and apparatus for intializing a hub interface
US7039047B1 (en) * 1999-11-03 2006-05-02 Intel Corporation Virtual wire signaling
US6822976B1 (en) * 1999-11-03 2004-11-23 Intel Corporation Method and apparatus for high throughput multiplexing of data
EP1162796B1 (en) * 2000-06-09 2012-08-15 Broadcom Corporation Cascading of gigabit switches
US7013302B2 (en) * 2000-12-22 2006-03-14 Nortel Networks Limited Bit field manipulation
US7583623B2 (en) * 2001-03-02 2009-09-01 Ofer Zimmerman Method and system for packing management messages in a communication system
US7333514B2 (en) 2001-08-09 2008-02-19 Telefonaktiebolaget Lm Ericsson (Publ) Flexible frame scheduler for simultaneous circuit-and packet-switched communication
US7177971B2 (en) * 2001-08-24 2007-02-13 Intel Corporation General input/output architecture, protocol and related methods to provide isochronous channels
US6965571B2 (en) 2001-08-27 2005-11-15 Sun Microsystems, Inc. Precise error reporting
US7099318B2 (en) * 2001-12-28 2006-08-29 Intel Corporation Communicating message request transaction types between agents in a computer system using multiple message groups
US8792434B2 (en) * 2008-10-08 2014-07-29 Telefonaktiebolaget Lm Ericsson Method and apparatus for selecting control channel elements for physical downlink control channel

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5828835A (en) * 1995-05-10 1998-10-27 3Com Corporation High throughput message passing process using latency and reliability classes
US6791947B2 (en) * 1996-12-16 2004-09-14 Juniper Networks In-line packet processing
US6678283B1 (en) * 1999-03-10 2004-01-13 Lucent Technologies Inc. System and method for distributing packet processing in an internetworking device
US6542504B1 (en) * 1999-05-28 2003-04-01 3Com Corporation Profile based method for packet header compression in a point to point link
US7873699B2 (en) * 2001-05-30 2011-01-18 Lg Electronics Inc. Network control system for home appliances
US20030115380A1 (en) * 2001-08-24 2003-06-19 Jasmin Ajanovic General input/output architecture, protocol and related methods to support legacy interrupts
US20030115513A1 (en) * 2001-08-24 2003-06-19 David Harriman Error forwarding in an enhanced general input/output architecture and related methods
US20030115391A1 (en) * 2001-08-24 2003-06-19 Jasmin Ajanovic Enhanced general input/output architecture and related methods for establishing virtual channels therein

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9946683B2 (en) 2014-12-24 2018-04-17 Intel Corporation Reducing precision timing measurement uncertainty

Also Published As

Publication number Publication date Type
US7099318B2 (en) 2006-08-29 grant
WO2003058470A1 (en) 2003-07-17 application
EP1459196B1 (en) 2009-07-01 grant
US20140115391A1 (en) 2014-04-24 application
US20150082091A9 (en) 2015-03-19 application
DE60232814D1 (en) 2009-08-13 grant
US20160070671A1 (en) 2016-03-10 application
EP2063604B1 (en) 2011-07-06 grant
US20130117490A1 (en) 2013-05-09 application
CN1608256A (en) 2005-04-20 application
US20140112353A1 (en) 2014-04-24 application
US20140105108A1 (en) 2014-04-17 application
US8582602B2 (en) 2013-11-12 grant
US20100260206A1 (en) 2010-10-14 application
EP2063604A2 (en) 2009-05-27 application
CN102984123B (en) 2016-12-21 grant
US20150078401A9 (en) 2015-03-19 application
US20060233199A1 (en) 2006-10-19 application
EP2063604A3 (en) 2009-08-19 application
US7769883B2 (en) 2010-08-03 grant
CN102984123A (en) 2013-03-20 application
US20030123484A1 (en) 2003-07-03 application
EP1459196A1 (en) 2004-09-22 application
US20130114602A1 (en) 2013-05-09 application
US20140133499A1 (en) 2014-05-15 application

Similar Documents

Publication Publication Date Title
US6009488A (en) Computer having packet-based interconnect channel
US7555002B2 (en) Infiniband general services queue pair virtualization for multiple logical ports on a single physical port
US7046668B2 (en) Method and apparatus for shared I/O in a load/store fabric
US7219183B2 (en) Switching apparatus and method for providing shared I/O within a load-store fabric
US7457906B2 (en) Method and apparatus for shared I/O in a load/store fabric
US7133405B2 (en) IP datagram over multiple queue pairs
US7804862B1 (en) Token ID mechanism for network data transfer
US7174413B2 (en) Switching apparatus and method for providing shared I/O within a load-store fabric
US6948004B2 (en) Host-fabric adapter having work queue entry (WQE) ring hardware assist (HWA) mechanism
US7099955B1 (en) End node partitioning using LMC for a system area network
US6910145B2 (en) Data transmission across asynchronous clock domains
US6763402B2 (en) Data storage subsystem
US20100232448A1 (en) Scalable Interface for Connecting Multiple Computer Systems Which Performs Parallel MPI Header Matching
US20050071472A1 (en) Method and system for hardware enforcement of logical partitioning of a channel adapter's resources in a system area network
US5041963A (en) Local area network with an active star topology comprising ring controllers having ring monitor logic function
US6912610B2 (en) Hardware assisted firmware task scheduling and management
US7058735B2 (en) Method and apparatus for local and distributed data memory access (“DMA”) control
US6708247B1 (en) Extending universal serial bus to allow communication with USB devices at a remote location
US7334178B1 (en) Randomized self-checking test system
US20060018341A1 (en) Method and apparatus for shared I/O in a load/store fabric
US7356636B2 (en) Virtualized PCI switch
US6789143B2 (en) Infiniband work and completion queue management via head and tail circular buffers with indirect work queue entries
US7496699B2 (en) DMA descriptor queue read and cache write pointer arrangement
US7283473B2 (en) Apparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a system area network
US20030120852A1 (en) Multiple port allocation and configurations for different port operation modes on a host