WO1999016195A1 - Full-duplex communication processor - Google Patents

Full-duplex communication processor Download PDF

Info

Publication number
WO1999016195A1
WO1999016195A1 PCT/US1998/020003 US9820003W WO9916195A1 WO 1999016195 A1 WO1999016195 A1 WO 1999016195A1 US 9820003 W US9820003 W US 9820003W WO 9916195 A1 WO9916195 A1 WO 9916195A1
Authority
WO
WIPO (PCT)
Prior art keywords
transmit
receive
frame
frames
data
Prior art date
Application number
PCT/US1998/020003
Other languages
French (fr)
Inventor
Bradley Roach
Peter Fiacco
Greg Scherer
Original Assignee
Emulex Corporation
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
Application filed by Emulex Corporation filed Critical Emulex Corporation
Priority to EP98951937A priority Critical patent/EP1021879A4/en
Priority to CA002304340A priority patent/CA2304340C/en
Priority to JP2000513373A priority patent/JP2001517895A/en
Publication of WO1999016195A1 publication Critical patent/WO1999016195A1/en
Priority to KR1020007003187A priority patent/KR100315245B1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/546Message passing systems or structures, e.g. queues
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/901Buffering arrangements using storage descriptor, e.g. read or write pointers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/10Program control for peripheral devices
    • G06F13/12Program control for peripheral devices using hardware independent of the central processor, e.g. channel or peripheral processor
    • G06F13/124Program control for peripheral devices using hardware independent of the central processor, e.g. channel or peripheral processor where hardware is a sequential transfer control unit, e.g. microprocessor, peripheral processor or state-machine
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/14Handling requests for interconnection or transfer
    • G06F13/20Handling requests for interconnection or transfer for access to input/output bus
    • G06F13/28Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access DMA, cycle steal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2801Broadband local area networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/9084Reactions to storage capacity overflow
    • H04L49/9089Reactions to storage capacity overflow replacing packets in a storage arrangement, e.g. pushout
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2213/00Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F2213/28DMA
    • G06F2213/2802DMA using DMA transfer descriptors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/12Protocol engines

Definitions

  • This invention relates to devices for transferring data in computer networks, and more particularly to a device for receiving, generating and transmitting frames of data across a computer network boundary.
  • Area-wide networks e.g., LANs and WANs
  • channels are two approaches that have been developed for computer network architectures.
  • Traditional networks offer a great deal of flexibility and relatively long distance capabilities.
  • Channels such as Enterprise System Connection (ESCON) and Small Computer System Interface (SCSI), have been developed for high performance and high reliability.
  • ESCON Enterprise System Connection
  • SCSI Small Computer System Interface
  • Channels typically use dedicated short-distance connections between computers or between computers and peripherals.
  • Fibre Channel a new network standard known as "Fibre Channel”.
  • Fibre Channel systems combine the speed and reliability of channels with the flexibility and connectivity of networks. Fibre Channel products currently can run at very high data rates, such as 266 or 1062 Mbps. These speeds are sufficient to handle quite demanding applications such as uncompressed, full motion, high-quality video.
  • Fibre Channel There are generally three ways to deploy Fibre Channel: simple point-to-point connections; arbitrated loops; and switched fabrics.
  • the simplest topology is the point-to- point configuration, which simply connects any two Fibre Channel systems directly.
  • Arbitrated loops are Fibre Channel ring connections that provide shared access to bandwidth via arbitration.
  • Switched Fibre Channel networks yield the highest performance by leveraging the benefits of cross-point switching.
  • the Fibre Channel fabric works something like a traditional phone system.
  • the fabric can connect varied devices such as work stations, PCs, servers, routers, mainframes, and storage devices that have Fibre Channel interface ports. Each such device can have an origination port that "calls" the fabric by entering the address of a destination port in a frame header.
  • the Fibre Channel specification defines the structure of this frame. (This frame structure raises data transfer issues that will be discussed below and addressed by the present invention).
  • the Fibre Channel fabric does all the work of setting up the desired connection, hence the frame originator does not need to be concerned with complex routing algorithms. There are no complicated permanent virtual circuits (PVCs) to set up.
  • Fibre Channel fabrics can handle more than 16 million addresses, and so are capable of accommodating very large networks.
  • the fabric can be enlarged by simply adding ports.
  • the aggregate data rate of a fully configured Fibre Channel network can be in the tera-bit-per-second range.
  • FIGURE 1 shows a number of ways of using Fibre Channel technology.
  • point- to-point connections 10 are shown connecting mainframes to each other.
  • a Fibre Channel arbitrated loop 11 is shown connecting disk storage units.
  • a Fibre Channel switch fabric 12 connects work stations 13, mainframes 14, servers 15, disk drives 16 and local area networks (LANs) 17.
  • the LANs include, for example, Ethernet, Token Ring and FDDI networks.
  • FC-0 the physical media layer
  • FC-1 the coding and decoding layer
  • FC-2 the actual transport mechanism, including the framing protocol and flow control between nodes
  • FC-3 the common services layer
  • FC-4 the upper layer protocol.
  • Fibre Channel operates at relatively high speed, it would be desirable to increase speeds further to meet the needs of faster processors.
  • One way to do this would be to eliminate, or reduce, delays that occur at interface points.
  • One such delay occurs during the transfer of a frame from the FC-1 layer to the FC-2 layer.
  • devices linked by a Fibre Channel data link receive Fibre Channel frames serially.
  • a protocol engine receives these frames and processes them at the next layer, the FC-2 layer shown in FIGURE 2.
  • the functions of the protocol engine includes validating each frame; queuing up DMA operations to transfer each frame to the host; and building transmit frames.
  • objects of the invention include: increasing data transfer processing speeds in high speed networks such as the Fibre Channel network; providing a technique that can speed up a protocol engine's processing of data frames; providing a protocol engine that can perform high speed full duplex processing of data without involving the host CPU on a frame-by-frame basis; minimizing data traffic between a protocol engine and a host CPU and system memory; and generally offloading protocol processing from a host CPU.
  • the invention is directed to the processing and transferring of frames of data in a computer data link.
  • the invention is a full-duplex communication processor that uses dual micro-coded engines and specialized hardware to build transmit frames, validate receive frames, and set up host DMA operations without involving a host CPU and without one or more resident microprocessors.
  • a preferred embodiment of the invention uses independent dedicated transmit and receive protocol processors. These independent processors communicate with each other using a transfer ready queue.
  • a context manager provides context information that is used by the receive processor to validate received frames and by the transmit processor to build transmit frame headers.
  • a preferred embodiment of the invention 1) implements a full-duplex communication processor with independent transmit and receive processors that communicates directly to the host driver software through host memory resident "command", “unsolicited data”, and “response” rings; 2) establishes communication between the dual processors to allow the receive processor to queue work for the transmit processor, which allows a remote device send a frame to the receive processor that will "wake-up" the transmit processor to send data to the remote device without involving the host CPU; and 3) establishes an interlocked information table that allows the transmit and receive processors to operate on the same Input/Output (I/O) command.
  • I/O Input/Output
  • the data channel is a Fibre Channel data link and the full- duplex communication processor is configured to process FC-2 protocol Fibre Channel frames.
  • FIGURE 1 is a block diagram of a prior art complex computer network utilizing Fibre Channel technology.
  • FIGURE 2 is a diagram of the five functional layers of the prior art Fibre Channel standard.
  • FIGURE 3 is a simplified block diagram of a communication processing system in accordance with a preferred embodiment of the invention.
  • FIGURE 4 is a diagram of a typical prior art Fibre Channel frame of data.
  • FIGURE 5 is a simplified block diagram of a full-duplex communication processor in accordance with a preferred embodiment of the invention.
  • FIGURE 6 is a diagram of an Exchange Context Resource Index (XRI) in accordance with a preferred embodiment of the invention.
  • XRI Exchange Context Resource Index
  • the invention includes a full-duplex commumcation processor that improves frame transmission and frame reception rates in high speed data links such as the Fibre Channel.
  • full-duplex network communication is accomplished without involving the host CPU.
  • FIGURE 3 shows a Fibre Channel communication system 20 utilizing the full-duplex communication processor 22 in accordance with a preferred embodiment of the invention.
  • Serial data is received along a Fibre Channel data link 24.
  • Frames generally will comprise three portions, a preamble, a data or "payload" portion, and a trailer portion.
  • the Fibre Channel frame consists of a start of frame (SOF) word (four bytes); a data portion comprising a frame header (six bytes), between zero and 2112 payload bytes, and a cyclical redundancy check (CRC) word (4 bytes); and an end of frame (EOF) word (4 bytes).
  • the frame header is used to control link applications, control device protocol transfers, and detect missing or out of order frames.
  • the CRC word indicates whether there is a problem in the transmission, such as a data corruption, or whether some part of the frame was dropped during transmission.
  • Frames received from the Fibre Channel data link 24 are processed by an NL port 36 which decodes and parallelizes the incoming serial data into words.
  • the NL port 36 assembles the words into frames.
  • the NL port 36 also checks the CRC word for each frame received and adds a resulting "good-bad" CRC status indicator to other status information bits within an EOF status word that is generated from the EOF word.
  • the NL port 36 then writes the frames into a receive frame FIFO buffer 28. Further details of a preferred FIFO buffer module 28 are described in co-pending patent application entitled "RECEIVE FRAME FIFO WITH END OF FRAME BYPASS", Serial No. 08/935,898 filed on September 23, 1997, and assigned to the same assignee of the present invention, the disclosure of which is incorporated by reference.
  • Fibre Channel frames are then received by the full-duplex communication processor 22. also referred to as a protocol engine.
  • Several functions are performed by the full duplex communication processor 22, including: 1 ) queuing up a host command to write the data in a received frame into host memory through direct memory access (DMA); 2) validating the frame header to ensure that the frame is the next logical frame that should be received; 3) determining whether the frame is defective or not; and 4) generating transmit frames in response to a received frame or host-generated transmit command.
  • DMA direct memory access
  • the full-duplex communication processor 22 does not include a microprocessor. Instead, dual microcoded engines are employed in order to separate the protocol engine receive tasks from the protocol engine transmit tasks.
  • the full-duplex communication processor 22 includes a receive protocol engine 30 and a transmit protocol engine 32. These protocol engines communicate to each other through a transfer ready queue 60.
  • the receive protocol engine 30 validates the receive frame headers received from the receive frame buffer 28.
  • the transmit protocol engine 32 builds transmit frames and sends them to the Fibre Channel data link 24 through a transmit FIFO 66 and the NL port 36.
  • the full duplex communication processor 22 works in conjunction with a host computer 40 that includes host driver software 38 and host memory 42.
  • the transmit and receive protocol engines 30, 32 communicate directly to the host driver software 38.
  • Full-duplex communication is achieved because the receive and transmit protocol engines operate independently and concurrently.
  • An interlocked context information table is used to permit the receive and transmit protocol engines to operate on the same I/O command, as described in more detail below.
  • the full-duplex communication processor 22 is able to process frames without involving the host CPU on a frame-by-frame basis.
  • one function of the full-duplex communication processor 22 is to allow a remote device to send a frame along the Fibre Channel link 24 to the receive protocol engine 30 which will "wake up" the transmit protocol engine 32 to send data to the remote device through the NL port 36 to the Fibre Channel link 24.
  • data may reside, for example, in the host memory 42.
  • FIGURE 5 shows additional details of the full-duplex communication processor 22 of a preferred embodiment of the invention.
  • the full-duplex communication processor 22 includes data structures resident in host memory 42, which may include contiguous and non-contiguous physical memory.
  • a Fibre Channel frame is received by the receive protocol engine 30 through the NL port 36.
  • An NL port status unit 44 performs the function of timing receive frame sequence and monitoring NL port interrupts.
  • the received frame is sent through a sequencer 46 to a receive buffer control unit 48 which places the received frame in a receive buffer 50.
  • the frame header in the receive buffer 50 is then automatically placed into the receive protocol engine 30.
  • a lookup field inside each frame header includes a pointer to an associated context.
  • the associated context is initialized by the host driver 38 within the host memory 42, and contains information indicating where to put a particular frame of data in host memory 42. More particularly, the context contains fields such as maximum frame size, current buffer pointer and length, and small computer systems interface (SCSI) state information, defined in a list of buffers.
  • SCSI small computer systems interface
  • the host memory unit 42 typically will comprise many megabytes of memory, and each particular frame will fit into one slot in that memory. Each frame header tells the receive protocol engine 30 which context to access or "pull down" for that particular frame so that the receive protocol engine can validate that frame .
  • the context is pulled down from the host memory 42 under control of the context manager engine 52 through a host memory interface 54.
  • the receive protocol engine sequencer 46 then validates the frame.
  • the context pointed to by a frame header will tell the receive protocol engine 30 what to do with the frame.
  • the frame may be a communication frame such as a "transfer ready" that tells the transmitter that the target is now ready to accept data. This would cause the receive frame to pass to the transfer ready queue 60. The transmit command would then be sent to the transmit protocol engine 32).
  • the second case involves sending a frame to a buffer pointer list, which is a sequential list of buffer descriptors.
  • the first entry in the list contains the total transfer size in bytes. In the illustrated embodiment, only word transfers are performed by the full-duplex communication processor 22. Hence, if the total transfer size is not an integral number of 4-byte words, additional bytes are transferred to the next boundary.
  • Subsequent entries in the buffer list consist of two parts each, one part being a multi-byte address that points to the start of a buffer and the other part being the size and usage of the buffer.
  • each buffer pointer list includes buffer list modifier (BLM) bits that describe the buffer usage and which are used to build an outgoing Fibre Channel frame header (the FC-2 header) for each transmit frame.
  • the full-duplex communication processor 22 must build the frame header and corresponding frame control (F_CTL) bits, and transfer the frame header to a transmit FIFO 66 before transferring the payload via a DMA operation.
  • the BLM bits and the buffer lengths in the buffer lists assist the full-duplex communication processor 22 in determining whether a frame is the last one in a series of frames.
  • the BLM bits control proper placement of received data and status information into the buffer segments.
  • One example of a task performed by the full-duplex communication processor 22 is the processing of a command to write data to a disk drive on the Fibre Channel link 24 from a remote device.
  • a write command is sent and the full-duplex communication processor transfers the command to the disk drive which sends back a transfer ready message to the receive protocol engine 30 indicating that the disk drive is ready to accept the data.
  • This message goes to the transfer ready queue 60 which instructs the transmit protocol engine 32 to retrieve the data from host memory 42, generate a frame and transmit the data to the disk drive.
  • the transmit protocol engine 32 is triggered by either of two events: one is the presence of an entry in the transfer ready queue 60, and the other is by action of the command ring controller 62.
  • An Exchange Context Resource Index (XRI) is used to process each command.
  • the command ring is a circular queue of command entries, generally read and write commands. These read and write commands can be used, for example, to communicate commands to a remote device such as a disk drive.
  • the size and base memory address of the command ring is specified in a command ring base register which contains "put" and "get” pointers that are used for managing the command ring as follows: the host driver 38 manages the put pointer, incrementing the pointer whenever a command is queued to the command ring 62.
  • the full-duplex communication processor 22 manages the get pointer, incrementing the pointer whenever a command is read from the ring.
  • a command other than a full-frame transmission provides a pointer to a buffer pointer list.
  • the buffer pointer list contains the total transfer size in the first buffer list entry and buffer pointer-size pairs in subsequent buffer list entries.
  • the XRI field in the command will then be used to instruct the context manager 52 to pull down the appropriate context to the transmit protocol engine 32.
  • This transfer called an exchange, tells the transmit protocol engine 32 where the engine is in that particular buffer ring list, how much data the frame has and what stage it is in, etc.
  • the context also contains the next frame header.
  • the next frame header is initially built by the host driver 38 but thereafter the transmit protocol engine 32 builds subsequent frame headers.
  • the context manager 52 retrieves each frame header from the host memory 42 and passes the header to the transmit header controller 68, which sends the frame header to the NL port 36 through the transmit FIFO 66.
  • the system begins following the buffer list in a process that gathers data from host memory.
  • the context for a command contains a pointer to the buffer list.
  • One entry at a time is pulled down from the buffer list by the buffer list ring controller 70.
  • the frame header is transferred to the transmit FIFO 66 through a transmit header control 68.
  • a payload segmenter 72 begins to pull in payload (frame data) and put the payload data into the transmit FIFO 66.
  • the last task is to write an end of frame (EOF) word to the transmit FIFO 66.
  • the EOF word is an indication to the NL port 36 to begin transmitting the assembled frame onto the Fiber Channel link 24.
  • the receive protocol engine 30 contains an acknowledge FIFO 74 which generates an acknowledge frame (basically a modified form of the receive frame header) that is sent back over the Fibre Channel link 24 to the sender to acknowledge receipt.
  • an acknowledge FIFO 74 which generates an acknowledge frame (basically a modified form of the receive frame header) that is sent back over the Fibre Channel link 24 to the sender to acknowledge receipt.
  • the full-duplex communication processor 22 also includes receive and transmit protocol engine registers 76 and 78. These registers contain autonomous protocol management functions that are linked and synchronized through the context registers in the context manager 52.
  • the context manager 52 manages coherency and caching of exchange context from the host memory 42, and also synchronizes accesses by the receive and transmit protocol engine 30, 32 to the cached exchange context contained in the context registers 80.
  • the context manager 52 and the receive and transmit protocol engines 30, 32 communicate with the host 40 through host memory interface 54 which includes a peripheral components interface (PCI), direct memory access (DMA) controller (not shown), and a PCI slave interface (not shown).
  • the protocol engine registers 76, 78 contain the PCI slave interface and interrupt controller for the protocol engines 30, 32.
  • the context manager 52. receive and transmit protocol engines 30, 32 provide status to and from the protocol engine register 76, 78 for the PCI slave interface and interrupt controller.
  • the receive and transmit protocol engines 30, 32 implement the Fibre Channel protocol by using two independent programmable sequencers 46 and 63.
  • sequencers 46, 63 allows the protocol engine state machine to be implemented in a variable writable control store RAM, which is downloaded into the receive and transmit protocol engine registers 76, 78 during initialization.
  • the host 40 can access this writable control store RAM and can read and write the writable control store RAM through a protocol register map.
  • the use of the sequencers adds great flexibility to the protocol engine state machine implementation since, by changing code in the writable control store RAM, new or different functionality can be downloaded to the full-duplex communication processor 22.
  • the full-duplex communication processor 22 can be implemented on a single chip (such as an application specific integrated circuit (ASIC)), alone or together with other functions.
  • the full-duplex communication processor 22 can cache one instance of the most recent transmit and receive context. However, by adding additional on-chip memory, additional instances of context can be cached.
  • each context is divided into two host memory structures: remote port context and exchange context.
  • An exchange context is contained in an Exchange Context Resource Index (XRI) which is used to process a command.
  • XRI Exchange Context Resource Index
  • an exchange context is a structure that describes a complete exchange or controls transmission of one or more sequences. The structure is pointed to by an entry in an exchange pointer table.
  • An XRI context contains the supporting context needed for an operation to take place immediately or through separate sequences.
  • the data to send, or the buffers to receive data are described by a buffer pointer list consisting of a set of buffer list entries that point to the actual buffers.
  • a buffer list entry contains the address and length of a buffer and control bits to indicate sequence initiative, end of exchange, end of sequence, etc.
  • the XRI context provides storage for working-register contents.
  • the XRI contexts are used by the full-duplex communication processor 22 for: Fibre Channel Protocol (FCP) exchanges that it originates: transmission exchanges; and temporary purposes to control transmission of a single frame or multiple frame sequences.
  • FCP Fibre Channel Protocol
  • the XRI context may be used by the host driver 38 for keeping track of exchanges for which data is received into buffer ring buffers.
  • the first word is the XRI control- status word.
  • the XRI control-status word contains configuration fields that are set by the host driver.
  • the Total Transfer Size word reflects sequencer activity.
  • FCP Fibre Channel protocol
  • the XRI control-status word shows the remaining byte count for write operations and the cumulative received byte count for read operations.
  • the XRI control-status word shows the remaining byte count if the operation is halted before the complete sequence is transmitted.
  • the Rxeng control-status word is used by the receive protocol engine 30 to validate frames.
  • the Current Buffer List Address word reflects sequencer activity, as does the Current Buffer Offset Address word.
  • the buffer list modifier (BLM) bits are set from the corresponding bits of a buffer list entry (BLE) read under sequencer control.
  • the Residual Buffer Length in word five reflects sequencer activity. Whenever a sequencer reads a BLE, this field receives the buffer word count. Whenever a sequencer issues a DMA operation to transfer data to or from the buffer, the word count is reduced by the length of the transfer data.
  • the Current Buffer Burst Length word also reflects transmit sequencer activity.
  • the Fibre Channel FC-2 header in words 7-12, is used to generate header information for each frame transmitted by the transmit protocol engine 22.
  • the R_CTL/TYPE ring control 56 controls buffer rings that are used to receive all frames except FCP responder frames, i.e., for a locally originated FCP exchange.
  • Three R_CTL/TYPE buffer rings assist the host in demultiplexing incoming frames for the appropriate driver entry points.
  • An R_CTL/TYPE buffer ring is a fixed-size sequential list of buffer descriptors. The list is managed by hardware as a logical ring. Buffer descriptors are like buffer list entries in a buffer pointer list, but do not contain BLM bits.
  • the host driver 42 specifies the location and size of each buffer ring in the corresponding base register. Specific registers specify which entries in the R_CTL/TYPE buffer rings are valid. Each register consists of a put pointer and a get pointer. The receive buffers for each ring are used in the exact order in which the host driver put the corresponding buffer descriptions into the ring.
  • Loop initialization is initiated locally under host control or remotely by some other port.
  • the host driver either originates or passes on Fibre Channel Extended Link Services (ELS) frames that determine the addresses and capabilities of the ports on the loop.
  • ELS Fibre Channel Extended Link Services
  • the host driver 38 is responsible for issuing Loop Initialization Select Master (LISM) ELS frames which facilitate the loop initialization process.
  • LISM Loop Initialization Select Master
  • Initialization is needed because both the receive and transmit protocol engines 30, 32 are basically two autonomous engines running in full-duplex and they have minimal communication between the two of them.
  • the transmit protocol engine 32 is turned off and the receive protocol engine 30 is allowed to receive frames and then send them through the transmit protocol engine 32.
  • the receive protocol engine takes up "ownership" of the transmit protocol engine hardware and uses that hardware to forward frames, in particular, the LISM frames which are transmitted utilizing the transmit LISM control module 82.
  • the full-duplex communication processor of the present invention allows the development of a low-cost network interface card that does not require a microprocessor with local RAM, and further offers the following advantages: • independent transmit and receive processors;
  • the receive processor can queue work for the transmit processor
  • an interlocked information table allows the transmit and receive engines to operate on the same I/O command; • the transmit and receive processors can follow a single buffer list where the host can queue memory buffers that are a different size from the transmit or receive frames;

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Software Systems (AREA)
  • Computer And Data Communications (AREA)
  • Communication Control (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A full duplex communication processor (20) simultaneously sends and receives frames of data and commands. Separate transmit (32) and receive (30) protocol engines are controlled by separate sequencers. This enables frames of data to be received and transmitted simultaneously without involving the CPU (40) on a frame-by-frame basis.

Description

FULL-DUPLEX COMMUNICATION PROCESSOR
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to devices for transferring data in computer networks, and more particularly to a device for receiving, generating and transmitting frames of data across a computer network boundary.
2. Description of Related Art
The number of computers and peripherals has mushroomed in recent years. This has created a need for improved methods of interconnecting these devices. A wide variety of networking paradigms have been developed to enable different kinds of computers and peripheral components to communicate with each other.
There exists a bottleneck in the speed with which data can be exchanged along such networks. This is not surprising because increases in network architecture speeds have not kept pace with faster computer processing speeds. The processing power of computer chips has historically doubled about every 18 months, creating increasingly powerful machines and bandwidth hungry applications. It has been estimated that one megabit per second of input/output is generally required per "MIPs" (millions of instructions per second) of processing power. With CPUs now easily exceeding 200 MIPs, it is difficult for network architecture to keep up with these faster speeds.
Area-wide networks (e.g., LANs and WANs) and channels are two approaches that have been developed for computer network architectures. Traditional networks offer a great deal of flexibility and relatively long distance capabilities. Channels, such as Enterprise System Connection (ESCON) and Small Computer System Interface (SCSI), have been developed for high performance and high reliability. Channels typically use dedicated short-distance connections between computers or between computers and peripherals. Features of both channels and networks have been incorporated into a new network standard known as "Fibre Channel". Fibre Channel systems combine the speed and reliability of channels with the flexibility and connectivity of networks. Fibre Channel products currently can run at very high data rates, such as 266 or 1062 Mbps. These speeds are sufficient to handle quite demanding applications such as uncompressed, full motion, high-quality video.
There are generally three ways to deploy Fibre Channel: simple point-to-point connections; arbitrated loops; and switched fabrics. The simplest topology is the point-to- point configuration, which simply connects any two Fibre Channel systems directly. Arbitrated loops are Fibre Channel ring connections that provide shared access to bandwidth via arbitration. Switched Fibre Channel networks, called "fabrics", yield the highest performance by leveraging the benefits of cross-point switching.
The Fibre Channel fabric works something like a traditional phone system. The fabric can connect varied devices such as work stations, PCs, servers, routers, mainframes, and storage devices that have Fibre Channel interface ports. Each such device can have an origination port that "calls" the fabric by entering the address of a destination port in a frame header. The Fibre Channel specification defines the structure of this frame. (This frame structure raises data transfer issues that will be discussed below and addressed by the present invention). The Fibre Channel fabric does all the work of setting up the desired connection, hence the frame originator does not need to be concerned with complex routing algorithms. There are no complicated permanent virtual circuits (PVCs) to set up. Fibre Channel fabrics can handle more than 16 million addresses, and so are capable of accommodating very large networks. The fabric can be enlarged by simply adding ports. The aggregate data rate of a fully configured Fibre Channel network can be in the tera-bit-per-second range.
Each of the three basic types of Fibre Channel connections are shown in FIGURE 1, which shows a number of ways of using Fibre Channel technology. In particular, point- to-point connections 10 are shown connecting mainframes to each other. A Fibre Channel arbitrated loop 11 is shown connecting disk storage units. A Fibre Channel switch fabric 12 connects work stations 13, mainframes 14, servers 15, disk drives 16 and local area networks (LANs) 17. The LANs include, for example, Ethernet, Token Ring and FDDI networks.
An ANSI specification (X3.230-1994) defines the Fibre Channel network. The specification distributes Fibre Channel functions among five layers. As shown in FIGURE 2, the five functional layers of the Fibre Channel are: FC-0 - the physical media layer; FC-1 - the coding and decoding layer; FC-2 - the actual transport mechanism, including the framing protocol and flow control between nodes; FC-3 - the common services layer; and FC-4 - the upper layer protocol.
While the Fibre Channel operates at relatively high speed, it would be desirable to increase speeds further to meet the needs of faster processors. One way to do this would be to eliminate, or reduce, delays that occur at interface points. One such delay occurs during the transfer of a frame from the FC-1 layer to the FC-2 layer. At this interface, devices linked by a Fibre Channel data link receive Fibre Channel frames serially. A protocol engine receives these frames and processes them at the next layer, the FC-2 layer shown in FIGURE 2. The functions of the protocol engine includes validating each frame; queuing up DMA operations to transfer each frame to the host; and building transmit frames.
The high bit speeds of the Fibre Channel data link places extreme demands on the protocol engine. Hence, some protocol engines can only operate in half-duplex mode, which means that the protocol engine can process data in only one direction at a time. This significantly slows down the speed of the data transfer since either the transmit or the receive task must wait while the other task is performed. Full-duplex protocol engines can process both received and transmitted frames simultaneously. Hence full-duplex protocol engines significantly improve data throughput. However, in full-duplex protocol engines, usually two microprocessors, each with local RAM, are required to respectively handle transmit and receive operations. The use of dual microprocessors for these functions greatly increases the cost of the protocol engine.
Conventional approaches to handling frames generally rely on the involvement of a host CPU on a frame-by-frame basis. For example, validation of received frames and setting up direct memory access (DMA) operations and acknowledgments typically involve the host CPU, which limits frame transmission and reception rates and prevents the host CPU from performing other tasks. Further, a host CPU with software protocol "stacks" cannot keep up with fast networks such as Fiber Channel.
In view of the foregoing, objects of the invention include: increasing data transfer processing speeds in high speed networks such as the Fibre Channel network; providing a technique that can speed up a protocol engine's processing of data frames; providing a protocol engine that can perform high speed full duplex processing of data without involving the host CPU on a frame-by-frame basis; minimizing data traffic between a protocol engine and a host CPU and system memory; and generally offloading protocol processing from a host CPU.
SUMMARY OF THE INVENTION
The invention is directed to the processing and transferring of frames of data in a computer data link. The invention is a full-duplex communication processor that uses dual micro-coded engines and specialized hardware to build transmit frames, validate receive frames, and set up host DMA operations without involving a host CPU and without one or more resident microprocessors. A preferred embodiment of the invention uses independent dedicated transmit and receive protocol processors. These independent processors communicate with each other using a transfer ready queue. A context manager provides context information that is used by the receive processor to validate received frames and by the transmit processor to build transmit frame headers.
More particularly, a preferred embodiment of the invention: 1) implements a full-duplex communication processor with independent transmit and receive processors that communicates directly to the host driver software through host memory resident "command", "unsolicited data", and "response" rings; 2) establishes communication between the dual processors to allow the receive processor to queue work for the transmit processor, which allows a remote device send a frame to the receive processor that will "wake-up" the transmit processor to send data to the remote device without involving the host CPU; and 3) establishes an interlocked information table that allows the transmit and receive processors to operate on the same Input/Output (I/O) command.
In a preferred embodiment, the data channel is a Fibre Channel data link and the full- duplex communication processor is configured to process FC-2 protocol Fibre Channel frames.
The details of the preferred embodiment of the present invention are set forth in the accompanying drawings and the description below. Once the details of the invention are known, numerous additional innovations and changes will become obvious to one skilled in the art.
BRIEF DESCRIPTION OF THE DRAWINGS FIGURE 1 is a block diagram of a prior art complex computer network utilizing Fibre Channel technology.
FIGURE 2 is a diagram of the five functional layers of the prior art Fibre Channel standard. FIGURE 3 is a simplified block diagram of a communication processing system in accordance with a preferred embodiment of the invention.
FIGURE 4 is a diagram of a typical prior art Fibre Channel frame of data.
FIGURE 5 is a simplified block diagram of a full-duplex communication processor in accordance with a preferred embodiment of the invention.
FIGURE 6 is a diagram of an Exchange Context Resource Index (XRI) in accordance with a preferred embodiment of the invention.
Like reference numbers and designations in the various drawings refer to like elements.
DETAILED DESCRIPTION OF THE INVENTION The invention includes a full-duplex commumcation processor that improves frame transmission and frame reception rates in high speed data links such as the Fibre Channel. By using independent transmit and receive microcoded engines communicating directly to host driver software, full-duplex network communication is accomplished without involving the host CPU.
FIGURE 3 shows a Fibre Channel communication system 20 utilizing the full-duplex communication processor 22 in accordance with a preferred embodiment of the invention. Serial data is received along a Fibre Channel data link 24. Frames generally will comprise three portions, a preamble, a data or "payload" portion, and a trailer portion. In a Fibre Channel data link, for example, the Fibre Channel frame consists of a start of frame (SOF) word (four bytes); a data portion comprising a frame header (six bytes), between zero and 2112 payload bytes, and a cyclical redundancy check (CRC) word (4 bytes); and an end of frame (EOF) word (4 bytes). The frame header is used to control link applications, control device protocol transfers, and detect missing or out of order frames. The CRC word indicates whether there is a problem in the transmission, such as a data corruption, or whether some part of the frame was dropped during transmission.
Frames received from the Fibre Channel data link 24 are processed by an NL port 36 which decodes and parallelizes the incoming serial data into words. The NL port 36 assembles the words into frames. The NL port 36 also checks the CRC word for each frame received and adds a resulting "good-bad" CRC status indicator to other status information bits within an EOF status word that is generated from the EOF word. The NL port 36 then writes the frames into a receive frame FIFO buffer 28. Further details of a preferred FIFO buffer module 28 are described in co-pending patent application entitled "RECEIVE FRAME FIFO WITH END OF FRAME BYPASS", Serial No. 08/935,898 filed on September 23, 1997, and assigned to the same assignee of the present invention, the disclosure of which is incorporated by reference.
Fibre Channel frames are then received by the full-duplex communication processor 22. also referred to as a protocol engine. Several functions are performed by the full duplex communication processor 22, including: 1 ) queuing up a host command to write the data in a received frame into host memory through direct memory access (DMA); 2) validating the frame header to ensure that the frame is the next logical frame that should be received; 3) determining whether the frame is defective or not; and 4) generating transmit frames in response to a received frame or host-generated transmit command.
Unlike conventional protocol engines, the full-duplex communication processor 22 does not include a microprocessor. Instead, dual microcoded engines are employed in order to separate the protocol engine receive tasks from the protocol engine transmit tasks. In particular, the full-duplex communication processor 22 includes a receive protocol engine 30 and a transmit protocol engine 32. These protocol engines communicate to each other through a transfer ready queue 60. The receive protocol engine 30 validates the receive frame headers received from the receive frame buffer 28. The transmit protocol engine 32 builds transmit frames and sends them to the Fibre Channel data link 24 through a transmit FIFO 66 and the NL port 36.
The full duplex communication processor 22 works in conjunction with a host computer 40 that includes host driver software 38 and host memory 42. In particular, the transmit and receive protocol engines 30, 32 communicate directly to the host driver software 38. Full-duplex communication is achieved because the receive and transmit protocol engines operate independently and concurrently. An interlocked context information table is used to permit the receive and transmit protocol engines to operate on the same I/O command, as described in more detail below.
The full-duplex communication processor 22 is able to process frames without involving the host CPU on a frame-by-frame basis. For example, one function of the full-duplex communication processor 22 is to allow a remote device to send a frame along the Fibre Channel link 24 to the receive protocol engine 30 which will "wake up" the transmit protocol engine 32 to send data to the remote device through the NL port 36 to the Fibre Channel link 24. Such data may reside, for example, in the host memory 42.
FIGURE 5 shows additional details of the full-duplex communication processor 22 of a preferred embodiment of the invention. The full-duplex communication processor 22 includes data structures resident in host memory 42, which may include contiguous and non-contiguous physical memory.
A Fibre Channel frame is received by the receive protocol engine 30 through the NL port 36. An NL port status unit 44 performs the function of timing receive frame sequence and monitoring NL port interrupts. The received frame is sent through a sequencer 46 to a receive buffer control unit 48 which places the received frame in a receive buffer 50. The frame header in the receive buffer 50 is then automatically placed into the receive protocol engine 30. A lookup field inside each frame header includes a pointer to an associated context. In general, the associated context is initialized by the host driver 38 within the host memory 42, and contains information indicating where to put a particular frame of data in host memory 42. More particularly, the context contains fields such as maximum frame size, current buffer pointer and length, and small computer systems interface (SCSI) state information, defined in a list of buffers.
The host memory unit 42 typically will comprise many megabytes of memory, and each particular frame will fit into one slot in that memory. Each frame header tells the receive protocol engine 30 which context to access or "pull down" for that particular frame so that the receive protocol engine can validate that frame . The context is pulled down from the host memory 42 under control of the context manager engine 52 through a host memory interface 54. The receive protocol engine sequencer 46 then validates the frame.
Once frame validation is complete, the context pointed to by a frame header will tell the receive protocol engine 30 what to do with the frame. There are a number of possibilities, including: 1 ) send the frame out the Routing Control/Type (R_CTL/TYPE) ring control unit 56 where it then is sent to host memory 42 through the host memory interface 54; 2) send the frame through the Buffer List ring control unit 58 to one segment in the buffer pointer list inside host memory; and 3) process a non-data receive frame and associated payload . (For example, the frame may be a communication frame such as a "transfer ready" that tells the transmitter that the target is now ready to accept data. This would cause the receive frame to pass to the transfer ready queue 60. The transmit command would then be sent to the transmit protocol engine 32).
The second case involves sending a frame to a buffer pointer list, which is a sequential list of buffer descriptors. The first entry in the list contains the total transfer size in bytes. In the illustrated embodiment, only word transfers are performed by the full-duplex communication processor 22. Hence, if the total transfer size is not an integral number of 4-byte words, additional bytes are transferred to the next boundary. Subsequent entries in the buffer list consist of two parts each, one part being a multi-byte address that points to the start of a buffer and the other part being the size and usage of the buffer.
In accordance with the invention, each buffer pointer list includes buffer list modifier (BLM) bits that describe the buffer usage and which are used to build an outgoing Fibre Channel frame header (the FC-2 header) for each transmit frame. The full-duplex communication processor 22 must build the frame header and corresponding frame control (F_CTL) bits, and transfer the frame header to a transmit FIFO 66 before transferring the payload via a DMA operation. The BLM bits and the buffer lengths in the buffer lists assist the full-duplex communication processor 22 in determining whether a frame is the last one in a series of frames. For the receive protocol engine, the BLM bits control proper placement of received data and status information into the buffer segments. The BLM bits are described in related patent application serial number 08/937,065 entitled "COMMUNICATION PROCESSOR HAVING BUFFER LIST MODIFIER CONTROL BITS", filed on September 24, 1997, and assigned to the same assignee as the present invention, the disclosure of which is incorporated by reference.
One example of a task performed by the full-duplex communication processor 22 is the processing of a command to write data to a disk drive on the Fibre Channel link 24 from a remote device. A write command is sent and the full-duplex communication processor transfers the command to the disk drive which sends back a transfer ready message to the receive protocol engine 30 indicating that the disk drive is ready to accept the data. This message goes to the transfer ready queue 60 which instructs the transmit protocol engine 32 to retrieve the data from host memory 42, generate a frame and transmit the data to the disk drive.
The transmit protocol engine 32 is triggered by either of two events: one is the presence of an entry in the transfer ready queue 60, and the other is by action of the command ring controller 62. An Exchange Context Resource Index (XRI), described below, is used to process each command. The command ring is a circular queue of command entries, generally read and write commands. These read and write commands can be used, for example, to communicate commands to a remote device such as a disk drive. The size and base memory address of the command ring is specified in a command ring base register which contains "put" and "get" pointers that are used for managing the command ring as follows: the host driver 38 manages the put pointer, incrementing the pointer whenever a command is queued to the command ring 62. The full-duplex communication processor 22 manages the get pointer, incrementing the pointer whenever a command is read from the ring.
A command other than a full-frame transmission provides a pointer to a buffer pointer list. The buffer pointer list contains the total transfer size in the first buffer list entry and buffer pointer-size pairs in subsequent buffer list entries. The XRI field in the command will then be used to instruct the context manager 52 to pull down the appropriate context to the transmit protocol engine 32. This transfer, called an exchange, tells the transmit protocol engine 32 where the engine is in that particular buffer ring list, how much data the frame has and what stage it is in, etc. The context also contains the next frame header.
The next frame header is initially built by the host driver 38 but thereafter the transmit protocol engine 32 builds subsequent frame headers. The context manager 52 retrieves each frame header from the host memory 42 and passes the header to the transmit header controller 68, which sends the frame header to the NL port 36 through the transmit FIFO 66.
Once a frame header is built, the system begins following the buffer list in a process that gathers data from host memory. The context for a command contains a pointer to the buffer list. One entry at a time is pulled down from the buffer list by the buffer list ring controller 70. The frame header is transferred to the transmit FIFO 66 through a transmit header control 68. A payload segmenter 72 begins to pull in payload (frame data) and put the payload data into the transmit FIFO 66. Once a frame header and the payload data are in the transmit FIFO 66, the last task is to write an end of frame (EOF) word to the transmit FIFO 66. The EOF word is an indication to the NL port 36 to begin transmitting the assembled frame onto the Fiber Channel link 24. Once all frames are sent out successfully, a response is generated which is sent to the host driver 38, indicating that the frames associated with the pending command were, in fact, sent out successfully.
Likewise, the receive protocol engine 30 contains an acknowledge FIFO 74 which generates an acknowledge frame (basically a modified form of the receive frame header) that is sent back over the Fibre Channel link 24 to the sender to acknowledge receipt.
The full-duplex communication processor 22 also includes receive and transmit protocol engine registers 76 and 78. These registers contain autonomous protocol management functions that are linked and synchronized through the context registers in the context manager 52. The context manager 52 manages coherency and caching of exchange context from the host memory 42, and also synchronizes accesses by the receive and transmit protocol engine 30, 32 to the cached exchange context contained in the context registers 80.
In the preferred embodiment, the context manager 52 and the receive and transmit protocol engines 30, 32 communicate with the host 40 through host memory interface 54 which includes a peripheral components interface (PCI), direct memory access (DMA) controller (not shown), and a PCI slave interface (not shown). The protocol engine registers 76, 78 contain the PCI slave interface and interrupt controller for the protocol engines 30, 32. The context manager 52. receive and transmit protocol engines 30, 32 provide status to and from the protocol engine register 76, 78 for the PCI slave interface and interrupt controller.
The receive and transmit protocol engines 30, 32 implement the Fibre Channel protocol by using two independent programmable sequencers 46 and 63. The use of sequencers 46, 63 allows the protocol engine state machine to be implemented in a variable writable control store RAM, which is downloaded into the receive and transmit protocol engine registers 76, 78 during initialization. The host 40 can access this writable control store RAM and can read and write the writable control store RAM through a protocol register map. The use of the sequencers adds great flexibility to the protocol engine state machine implementation since, by changing code in the writable control store RAM, new or different functionality can be downloaded to the full-duplex communication processor 22.
The full-duplex communication processor 22 can be implemented on a single chip (such as an application specific integrated circuit (ASIC)), alone or together with other functions. For example, in the illustrated embodiment, the full-duplex communication processor 22 can cache one instance of the most recent transmit and receive context. However, by adding additional on-chip memory, additional instances of context can be cached.
XRI Context
In the preferred embodiment, each context is divided into two host memory structures: remote port context and exchange context. An exchange context is contained in an Exchange Context Resource Index (XRI) which is used to process a command. In particular, an exchange context is a structure that describes a complete exchange or controls transmission of one or more sequences. The structure is pointed to by an entry in an exchange pointer table. An XRI context contains the supporting context needed for an operation to take place immediately or through separate sequences. The data to send, or the buffers to receive data, are described by a buffer pointer list consisting of a set of buffer list entries that point to the actual buffers. As described above, a buffer list entry contains the address and length of a buffer and control bits to indicate sequence initiative, end of exchange, end of sequence, etc. For multiple-sequence operations the XRI context provides storage for working-register contents.
In the preferred embodiment, the XRI contexts are used by the full-duplex communication processor 22 for: Fibre Channel Protocol (FCP) exchanges that it originates: transmission exchanges; and temporary purposes to control transmission of a single frame or multiple frame sequences. The XRI context may be used by the host driver 38 for keeping track of exchanges for which data is received into buffer ring buffers.
An example of an XRI context is shown in FIGURE 6. The first word is the XRI control- status word. The XRI control-status word contains configuration fields that are set by the host driver. The Total Transfer Size word reflects sequencer activity. For Fibre Channel protocol (FCP) originated exchanges, the XRI control-status word shows the remaining byte count for write operations and the cumulative received byte count for read operations. For transmit sequence commands, the XRI control-status word shows the remaining byte count if the operation is halted before the complete sequence is transmitted. The Rxeng control-status word is used by the receive protocol engine 30 to validate frames. The Current Buffer List Address word reflects sequencer activity, as does the Current Buffer Offset Address word.
The buffer list modifier (BLM) bits are set from the corresponding bits of a buffer list entry (BLE) read under sequencer control. The Residual Buffer Length in word five reflects sequencer activity. Whenever a sequencer reads a BLE, this field receives the buffer word count. Whenever a sequencer issues a DMA operation to transfer data to or from the buffer, the word count is reduced by the length of the transfer data. The Current Buffer Burst Length word also reflects transmit sequencer activity.
The Fibre Channel FC-2 header, in words 7-12, is used to generate header information for each frame transmitted by the transmit protocol engine 22.
Referring again to FIGURE 5, the R_CTL/TYPE ring control 56 controls buffer rings that are used to receive all frames except FCP responder frames, i.e., for a locally originated FCP exchange. Three R_CTL/TYPE buffer rings assist the host in demultiplexing incoming frames for the appropriate driver entry points. An R_CTL/TYPE buffer ring is a fixed-size sequential list of buffer descriptors. The list is managed by hardware as a logical ring. Buffer descriptors are like buffer list entries in a buffer pointer list, but do not contain BLM bits.
The host driver 42 specifies the location and size of each buffer ring in the corresponding base register. Specific registers specify which entries in the R_CTL/TYPE buffer rings are valid. Each register consists of a put pointer and a get pointer. The receive buffers for each ring are used in the exact order in which the host driver put the corresponding buffer descriptions into the ring.
Loop initialization is initiated locally under host control or remotely by some other port. The host driver 38, the transmit and receive sequencers 46, 63, and the NL port 36 logic, all work together to complete the loop initialization procedure. During this procedure, the host driver either originates or passes on Fibre Channel Extended Link Services (ELS) frames that determine the addresses and capabilities of the ports on the loop. The host driver 38 is responsible for issuing Loop Initialization Select Master (LISM) ELS frames which facilitate the loop initialization process.
Initialization is needed because both the receive and transmit protocol engines 30, 32 are basically two autonomous engines running in full-duplex and they have minimal communication between the two of them. During initialization, the transmit protocol engine 32 is turned off and the receive protocol engine 30 is allowed to receive frames and then send them through the transmit protocol engine 32. Thus, the receive protocol engine takes up "ownership" of the transmit protocol engine hardware and uses that hardware to forward frames, in particular, the LISM frames which are transmitted utilizing the transmit LISM control module 82.
The full-duplex communication processor of the present invention allows the development of a low-cost network interface card that does not require a microprocessor with local RAM, and further offers the following advantages: • independent transmit and receive processors;
• the receive processor can queue work for the transmit processor;
• an interlocked information table allows the transmit and receive engines to operate on the same I/O command; • the transmit and receive processors can follow a single buffer list where the host can queue memory buffers that are a different size from the transmit or receive frames;
• receive frames are validated against the interlocked information table without involving the host CPU; • acknowledges to receive frames are generated without involving the host
CPU;
• efficient suspend/resume of I/O operations.
A number of embodiments of the present invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, it is to be understood that the invention is not to be limited by the specific illustrated embodiments, but only by the scope of the claims.

Claims

CLAIMSWhat is claimed is:
1. A communication processor comprising:
(a) a receive processor coupled to a computer network for receiving and validating frames of data, wherein the frames of data include commands;
(b) a transmit processor coupled to said computer network for constructing transmit frames;
(c) a transfer ready queue coupled between the transmit and receive processors, for transmitting commands in each frame of data having commands from the receive processor to the transmit processor;
(d) an interface circuit for coupling the receive and transmit processors and the transfer ready queue with a programmed host computer including a CPU and host memory; and (e) interlocked information table containing context information wherein the receive frame processor uses the context information to process receive frames without involving the CPU.
2. A communication processor according to claim 1, wherein the receive processor uses the context information to validate receive frames.
3. A communication processor according to claim 1, wherein the transmit processor uses the context information to build transmit frames.
4. A communication processor according to claims 2 or 3, further comprising a context manager for processing the context information, the context manager being under the control of host driver software.
5. A communication processor according to claim 1, wherein the transmit and receive processors each comprise independent microcoded engines, whereby the receive and transmit processors can each simultaneously process respective receive and transmit frames.
6. A communication processor according to claim 5, wherein the microcoded engines are sequencers, and the communication processor does not include a microprocessor.
7. A communication processor according to claim 1 , wherein the frames of data are Fibre Channel frames.
8. A commumcation processor according to claim 7, wherein the receive and transmit processors each implement an FC-2 Fibre Channel communications protocol.
9. A communication processor according to claim 1 , wherein the receive and transmit processors and the transfer ready queue are contained within a single integrated circuit.
10. A communication processor according to claim 1, wherein the interface circuit includes a direct memory access (DMA) interface.
11. A method of processing frames of data in a computer network comprising:
(a) receiving a first frame of data in a microcoded receive processor coupled to the computer network;
(b) transferring the first frame from the receive processor to a transfer ready queue;
(c) storing contextual information relating to the frame of data in an information table;
(d) using the contextual information to validate the first frame of data;
(e) transferring the first frame of data from the transfer ready queue to a microcoded transmit processor coupled to the computer network;
(f) constructing a transmit frame using information stored in the first frame of data in the transmit processor; and
(g) transferring the transmit frame to the computer network while simultaneously receiving a second frame of data in the receive processor.
12. A method according to claim 11 , wherein the first and second frames of data are Fibre Channel frames and the step of constructing a transmit frame includes the step of constructing a Fibre Channel transmit frame.
13. A method according to claim 11, further comprising the step of processing the context information in a context manager.
14. A method according to claim 11 , further comprising the steps of coupling the receive and transmit processors to a host computer, and using host driver software in the host computer to control the receive and transmit processors.
15. A method of according to claim 14, further comprising the step of storing the contextual information in memory located in the host computer.
16. A method according to claim 14, further comprising the step of coupling the receive and transmit processors to the host computer through a direct memory access (DMA) interface.
17. A computer network comprising: (a) source and destination computer devices;
(b) communication channel coupled to the source and destination computer devices;
(c) a receive processor coupled to the communication channel for receiving and validating frames of data from the source computer device, wherein the frames of data include commands;
(d) a transmit processor coupled to the computer network for constructing transmit frames;
(e) a transfer ready queue coupled between the transmit and receive processors, for transmitting commands in the frames of data having commands from the receive processor to the transmit processor;
(f) a host computer including a CPU, memory and host driver software;
(g) interface means for coupling the receive and transmit processors and the transfer ready queue with the host computer; and
(h) interlocked information table containing context information wherein the receive frame processor uses the context information to process the receive frames without involving the CPU.
18. A computer network according to claim 17, wherein the receive frame processor uses the context information to validate receive frames.
19. A computer network according to claim 17, wherein the transmit frame processor uses the context information to build transmit frames.
20. A computer network according to claim 17, further comprising a context manager for processing the context information, the context manager being under the control of the host driver software.
21. A computer network according to claim 17, wherein the frames of data are Fibre Channel frames.
22. A computer network according to claim 21 , wherein the receive and transmit frame processors each implement an FC-2 Fibre Channel communications protocol.
23. A computer network according to claim 17, wherein the interface means includes a direct memory access (DMA) interface.
24. A communication processor according to claim 17, wherein the interlocked information table is located in the host memory.
25. A communication processor according to claim 17, wherein the context information includes remote port context and exchange context.
26. A communication processor according to claim 17, wherein the frame includes a header having lookup fields indicating particular context information.
PCT/US1998/020003 1997-09-24 1998-09-24 Full-duplex communication processor WO1999016195A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP98951937A EP1021879A4 (en) 1997-09-24 1998-09-24 Full-duplex communication processor
CA002304340A CA2304340C (en) 1997-09-24 1998-09-24 Full-duplex communication processor
JP2000513373A JP2001517895A (en) 1997-09-24 1998-09-24 Full duplex communication processor used for fiber channel frame
KR1020007003187A KR100315245B1 (en) 1997-09-24 2000-03-24 Full-duplex communication processor which can be used for fibre channel frames

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/937,066 US6005849A (en) 1997-09-24 1997-09-24 Full-duplex communication processor which can be used for fibre channel frames
US08/937,066 1997-09-24

Publications (1)

Publication Number Publication Date
WO1999016195A1 true WO1999016195A1 (en) 1999-04-01

Family

ID=25469444

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1998/020003 WO1999016195A1 (en) 1997-09-24 1998-09-24 Full-duplex communication processor

Country Status (6)

Country Link
US (1) US6005849A (en)
EP (1) EP1021879A4 (en)
JP (1) JP2001517895A (en)
KR (1) KR100315245B1 (en)
CA (1) CA2304340C (en)
WO (1) WO1999016195A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003034239A1 (en) * 2001-10-15 2003-04-24 Advanced Micro Devices, Inc. Computer system i/o node
WO2007005702A2 (en) * 2005-06-30 2007-01-11 Intel Corporation Multi-threaded transmit transport engine for storage devices

Families Citing this family (66)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6185203B1 (en) 1997-02-18 2001-02-06 Vixel Corporation Fibre channel switching fabric
US6118776A (en) 1997-02-18 2000-09-12 Vixel Corporation Methods and apparatus for fiber channel interconnection of private loop devices
US6304910B1 (en) * 1997-09-24 2001-10-16 Emulex Corporation Communication processor having buffer list modifier control bits
US7133940B2 (en) 1997-10-14 2006-11-07 Alacritech, Inc. Network interface device employing a DMA command queue
US6757746B2 (en) 1997-10-14 2004-06-29 Alacritech, Inc. Obtaining a destination address so that a network interface device can write network data without headers directly into host memory
US7174393B2 (en) 2000-12-26 2007-02-06 Alacritech, Inc. TCP/IP offload network interface device
US6807581B1 (en) 2000-09-29 2004-10-19 Alacritech, Inc. Intelligent network storage interface system
US8539112B2 (en) 1997-10-14 2013-09-17 Alacritech, Inc. TCP/IP offload device
US6687758B2 (en) 2001-03-07 2004-02-03 Alacritech, Inc. Port aggregation for network connections that are offloaded to network interface devices
US7237036B2 (en) 1997-10-14 2007-06-26 Alacritech, Inc. Fast-path apparatus for receiving data corresponding a TCP connection
US8782199B2 (en) 1997-10-14 2014-07-15 A-Tech Llc Parsing a packet header
US7042898B2 (en) 1997-10-14 2006-05-09 Alacritech, Inc. Reducing delays associated with inserting a checksum into a network message
US6427171B1 (en) 1997-10-14 2002-07-30 Alacritech, Inc. Protocol processing stack for use with intelligent network interface device
US7167927B2 (en) 1997-10-14 2007-01-23 Alacritech, Inc. TCP/IP offload device with fast-path TCP ACK generating and transmitting mechanism
US6434620B1 (en) 1998-08-27 2002-08-13 Alacritech, Inc. TCP/IP offload network interface device
US6389479B1 (en) 1997-10-14 2002-05-14 Alacritech, Inc. Intelligent network interface device and system for accelerated communication
US7284070B2 (en) * 1997-10-14 2007-10-16 Alacritech, Inc. TCP offload network interface device
US6591302B2 (en) 1997-10-14 2003-07-08 Alacritech, Inc. Fast-path apparatus for receiving data corresponding to a TCP connection
US7076568B2 (en) 1997-10-14 2006-07-11 Alacritech, Inc. Data communication apparatus for computer intelligent network interface card which transfers data between a network and a storage device according designated uniform datagram protocol socket
US6427173B1 (en) 1997-10-14 2002-07-30 Alacritech, Inc. Intelligent network interfaced device and system for accelerated communication
US7185266B2 (en) 2003-02-12 2007-02-27 Alacritech, Inc. Network interface device for error detection using partial CRCS of variable length message portions
US7089326B2 (en) 1997-10-14 2006-08-08 Alacritech, Inc. Fast-path processing for receiving data on TCP connection offload devices
US8621101B1 (en) 2000-09-29 2013-12-31 Alacritech, Inc. Intelligent network storage interface device
US6697868B2 (en) 2000-02-28 2004-02-24 Alacritech, Inc. Protocol processing stack for use with intelligent network interface device
US6658480B2 (en) 1997-10-14 2003-12-02 Alacritech, Inc. Intelligent network interface system and method for accelerated protocol processing
US6226680B1 (en) 1997-10-14 2001-05-01 Alacritech, Inc. Intelligent network interface system method for protocol processing
US6289386B1 (en) * 1998-05-11 2001-09-11 Lsi Logic Corporation Implementation of a divide algorithm for buffer credit calculation in a high speed serial channel
US6353612B1 (en) 1998-06-19 2002-03-05 Brocade Communications Systems, Inc. Probing device
US7664883B2 (en) 1998-08-28 2010-02-16 Alacritech, Inc. Network interface device that fast-path processes solicited session layer read commands
US6772207B1 (en) 1999-01-28 2004-08-03 Brocade Communications Systems, Inc. System and method for managing fibre channel switching devices
US7328270B1 (en) * 1999-02-25 2008-02-05 Advanced Micro Devices, Inc. Communication protocol processor having multiple microprocessor cores connected in series and dynamically reprogrammed during operation via instructions transmitted along the same data paths used to convey communication data
US6643748B1 (en) 2000-04-20 2003-11-04 Microsoft Corporation Programmatic masking of storage units
US8019901B2 (en) 2000-09-29 2011-09-13 Alacritech, Inc. Intelligent network storage interface system
US20020118692A1 (en) * 2001-01-04 2002-08-29 Oberman Stuart F. Ensuring proper packet ordering in a cut-through and early-forwarding network switch
US7042891B2 (en) * 2001-01-04 2006-05-09 Nishan Systems, Inc. Dynamic selection of lowest latency path in a network switch
FR2831686B1 (en) * 2001-10-30 2005-05-20 Siemens Vdo Automotive METHOD AND DEVICE FOR COMMUNICATING ON A NETWORK OF A VEHICLE
US7047346B2 (en) * 2001-12-31 2006-05-16 Storage Technology Corporation Transparent fiber channel concentrator for point to point technologies
US7496689B2 (en) 2002-04-22 2009-02-24 Alacritech, Inc. TCP/IP offload device
US7543087B2 (en) 2002-04-22 2009-06-02 Alacritech, Inc. Freeing transmit memory on a network interface device prior to receiving an acknowledgement that transmit data has been received by a remote device
US7191241B2 (en) 2002-09-27 2007-03-13 Alacritech, Inc. Fast-path apparatus for receiving data corresponding to a TCP connection
US7337241B2 (en) 2002-09-27 2008-02-26 Alacritech, Inc. Fast-path apparatus for receiving data corresponding to a TCP connection
JP4432388B2 (en) * 2003-08-12 2010-03-17 株式会社日立製作所 I / O controller
US6996070B2 (en) 2003-12-05 2006-02-07 Alacritech, Inc. TCP/IP offload device with reduced sequential processing
US20050128945A1 (en) * 2003-12-11 2005-06-16 Chen-Chi Kuo Preventing a packet associated with a blocked port from being placed in a transmit buffer
JP3948454B2 (en) * 2003-12-12 2007-07-25 ソニー株式会社 COMMUNICATION DEVICE, COMMUNICATION SYSTEM, COMMUNICATION METHOD, AND PROGRAM
US8248939B1 (en) 2004-10-08 2012-08-21 Alacritech, Inc. Transferring control of TCP connections between hierarchy of processing mechanisms
CN1298049C (en) * 2005-03-08 2007-01-31 北京中星微电子有限公司 Graphic engine chip and its using method
CN1306594C (en) * 2005-03-08 2007-03-21 北京中星微电子有限公司 Graphic engine chip and its using method
US7738500B1 (en) 2005-12-14 2010-06-15 Alacritech, Inc. TCP timestamp synchronization for network connections that are offloaded to network interface devices
US8024396B2 (en) 2007-04-26 2011-09-20 Microsoft Corporation Distributed behavior controlled execution of modeled applications
JP4609458B2 (en) * 2007-06-25 2011-01-12 セイコーエプソン株式会社 Projector and image processing apparatus
US7970892B2 (en) 2007-06-29 2011-06-28 Microsoft Corporation Tuning and optimizing distributed systems with declarative models
US8239505B2 (en) 2007-06-29 2012-08-07 Microsoft Corporation Progressively implementing declarative models in distributed systems
US8230386B2 (en) * 2007-08-23 2012-07-24 Microsoft Corporation Monitoring distributed applications
US8181151B2 (en) 2007-10-26 2012-05-15 Microsoft Corporation Modeling and managing heterogeneous applications
US8225308B2 (en) 2007-10-26 2012-07-17 Microsoft Corporation Managing software lifecycle
US8099720B2 (en) * 2007-10-26 2012-01-17 Microsoft Corporation Translating declarative models
US7974939B2 (en) * 2007-10-26 2011-07-05 Microsoft Corporation Processing model-based commands for distributed applications
US7926070B2 (en) * 2007-10-26 2011-04-12 Microsoft Corporation Performing requested commands for model-based applications
US8539513B1 (en) 2008-04-01 2013-09-17 Alacritech, Inc. Accelerating data transfer in a virtual computer system with tightly coupled TCP connections
US8341286B1 (en) 2008-07-31 2012-12-25 Alacritech, Inc. TCP offload send optimization
US9306793B1 (en) 2008-10-22 2016-04-05 Alacritech, Inc. TCP offload device that batches session layer headers to reduce interrupts as well as CPU copies
JP5175773B2 (en) * 2009-02-27 2013-04-03 株式会社東芝 Communication apparatus, method and program
US8953631B2 (en) * 2010-06-30 2015-02-10 Intel Corporation Interruption, at least in part, of frame transmission
JP5571154B2 (en) * 2012-11-19 2014-08-13 株式会社東芝 Communication apparatus, method and program
US9195626B2 (en) * 2013-01-29 2015-11-24 Emulex Corporation Reducing write I/O latency using asynchronous Fibre Channel exchange

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5185736A (en) * 1989-05-12 1993-02-09 Alcatel Na Network Systems Corp. Synchronous optical transmission system
US5717689A (en) * 1995-10-10 1998-02-10 Lucent Technologies Inc. Data link layer protocol for transport of ATM cells over a wireless link

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0206743A3 (en) * 1985-06-20 1990-04-25 Texas Instruments Incorporated Zero fall-through time asynchronous fifo buffer with nonambiguous empty/full resolution
US5285448A (en) * 1990-03-01 1994-02-08 Hitachi, Ltd. Transmission system of system of system control information in a ring LAN system
DE69031220T2 (en) * 1990-12-20 1998-02-12 Ibm High speed multi-port FIFO buffer circuit
US5426639A (en) * 1991-11-29 1995-06-20 At&T Corp. Multiple virtual FIFO arrangement
US5243596A (en) * 1992-03-18 1993-09-07 Fischer & Porter Company Network architecture suitable for multicasting and resource locking
US5444853A (en) * 1992-03-31 1995-08-22 Seiko Epson Corporation System and method for transferring data between a plurality of virtual FIFO's and a peripheral via a hardware FIFO and selectively updating control information associated with the virtual FIFO's
US5546347A (en) * 1994-07-22 1996-08-13 Integrated Device Technology, Inc. Interleaving architecture and method for a high density FIFO
US5638518A (en) * 1994-10-24 1997-06-10 Lsi Logic Corporation Node loop core for implementing transmission protocol in fibre channel
US5519695A (en) * 1994-10-27 1996-05-21 Hewlett-Packard Company Switch element for fiber channel networks
US5548590A (en) * 1995-01-30 1996-08-20 Hewlett-Packard Company High performance frame time monitoring system and method for a fiber optic switch for a fiber optic network
EP0732659B1 (en) * 1995-03-17 2001-08-08 LSI Logic Corporation Controlling (n+i) I/O channels with (n) data managers in a homogeneous software programming environment

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5185736A (en) * 1989-05-12 1993-02-09 Alcatel Na Network Systems Corp. Synchronous optical transmission system
US5717689A (en) * 1995-10-10 1998-02-10 Lucent Technologies Inc. Data link layer protocol for transport of ATM cells over a wireless link

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BELLAMY J.: "DIGITAL TELEPHONY.", 1 January 1991, NEW YORK, NY : JOHN WILEY & SONS., US, ISBN: 978-0-471-62056-3, article KEISER B E, STRANGE E: "DIGITAL TELEPHONY AND NETWORK INTEGRATION SECOND EDITION", pages: 392 - 397, XP002915494, 023768 *
See also references of EP1021879A4 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003034239A1 (en) * 2001-10-15 2003-04-24 Advanced Micro Devices, Inc. Computer system i/o node
US6807599B2 (en) 2001-10-15 2004-10-19 Advanced Micro Devices, Inc. Computer system I/O node for connection serially in a chain to a host
CN1307568C (en) * 2001-10-15 2007-03-28 先进微装置公司 Computer system I/O node
WO2007005702A2 (en) * 2005-06-30 2007-01-11 Intel Corporation Multi-threaded transmit transport engine for storage devices
WO2007005702A3 (en) * 2005-06-30 2007-03-29 Intel Corp Multi-threaded transmit transport engine for storage devices
US8149854B2 (en) 2005-06-30 2012-04-03 Intel Corporation Multi-threaded transmit transport engine for storage devices

Also Published As

Publication number Publication date
JP2001517895A (en) 2001-10-09
CA2304340C (en) 2001-12-18
KR100315245B1 (en) 2001-11-26
US6005849A (en) 1999-12-21
KR20010024291A (en) 2001-03-26
CA2304340A1 (en) 1999-04-01
EP1021879A1 (en) 2000-07-26
EP1021879A4 (en) 2006-04-12

Similar Documents

Publication Publication Date Title
US6005849A (en) Full-duplex communication processor which can be used for fibre channel frames
US6185620B1 (en) Single chip protocol engine and data formatter apparatus for off chip host memory to local memory transfer and conversion
US6948004B2 (en) Host-fabric adapter having work queue entry (WQE) ring hardware assist (HWA) mechanism
US6304910B1 (en) Communication processor having buffer list modifier control bits
JP3448067B2 (en) Network controller for network adapter
KR100555394B1 (en) Methodology and mechanism for remote key validation for ngio/infiniband applications
US9100349B2 (en) User selectable multiple protocol network interface device
US6775719B1 (en) Host-fabric adapter and method of connecting a host system to a channel-based switched fabric in a data network
US5367643A (en) Generic high bandwidth adapter having data packet memory configured in three level hierarchy for temporary storage of variable length data packets
US20020071450A1 (en) Host-fabric adapter having bandwidth-optimizing, area-minimal, vertical sliced memory architecture and method of connecting a host system to a channel-based switched fabric in a data network
US6134617A (en) Method and apparatus for managing access to a loop in a data processing system
JPH02196541A (en) Method and device for connecting work station to local area network
JP2000200241A (en) Method for forming buffer structure in common memory, and network device
CA2182045A1 (en) Method and apparatus for tracking buffer availability
JP2000115252A (en) Method and device for controlling network data congestion
GB2409073A (en) Dedicated connection between CPU and network interface in multi-processor systems
CA2330014C (en) Method of mapping fibre channel frames based on control and type header fields
US6314100B1 (en) Method of validation and host buffer allocation for unmapped fibre channel frames
WO1999015973A1 (en) Receive frame fifo with end of frame bypass

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CA JP KR

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
ENP Entry into the national phase

Ref document number: 2304340

Country of ref document: CA

Ref country code: CA

Ref document number: 2304340

Kind code of ref document: A

Format of ref document f/p: F

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2000 513373

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 1020007003187

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 1998951937

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1998951937

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020007003187

Country of ref document: KR

WWG Wipo information: grant in national office

Ref document number: 1020007003187

Country of ref document: KR

WWW Wipo information: withdrawn in national office

Ref document number: 1998951937

Country of ref document: EP