Multi-node network with internode switching performed within processor nodes, each node separately processing data and control messages

• US 5,675,736 A
• Filed: 07/24/1996
• Issued: 10/07/1997
• Est. Priority Date: 05/24/1995
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hunter, Paul Wayne, Hartung, Michael Howard, Ko, Michael Anthony, Menon, Jaishankar Moothedath, Nowlen, David Ronald, Brady, James Thomas, Finney, Damon W., Mendelsohn, Noah R., Lang, Donald J.
• Primary Examiner(s): Geckil, Mehmet B.
• Application Number:
  US08/685,770
• Time in Patent Office: 440 Days
• Field of Search: 395/200.01, 395/200.15, 395/200.03, 395/200.07, 395/200.08, 395/441
• US Class Current: 709/239
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/247 using M:N active or standby paths
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 69/14 Multichannel or multilink protocols
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A distributed data processing system includes a plurality of nodes interconnected by bidirectional communication links. Each node includes a control message line for handling of control messages and a control memory for storing the control messages. Each node further includes data message line for handling of data messages and a data memory for storing the data messages. A processor in the node causes the data message line to queue and dispatch data messages from the data memory and the control message line to queue and dispatch control messages from the control memory. Each node includes N bidirectional communication links enabling the node to have at least twice as much input/output bandwidth as the control message line and data message line, combined. An input/output switch includes a routing processor and is coupled between the N bidirectional communication links, the data message line and control message line. The input/output switch dispatches either a control message or a data message over at least one of the bidirectional communication links in accordance with an output from the routing control processor, thereby enabling each communication link to carry either data or control messages. If a communication link is busy with either a control or a data message, the routing control processor increments to another communication link to enable dispatch of a queued message.

Claims

1. A distributed data processing system configured as a disk drive controller array, comprising:

a plurality of disk drive controller nodes, each disk drive controller node directly connected to each of N other nodes via a bi-directional communication link, where N>

=4, each said node thereby having at least twice as much input/output bandwidth as internal message handling bandwidth, each disk drive controller node further comprising;

control message means for substantially independent handling of control messages;

control memory means coupled to said control message means for storing control messages;

disk drive means;

data message means for substantially independent handling of data messages;

data memory means coupled to said data message means for storing data messages to and from said disk drive means;

processor means coupled to each of the aforesaid means, for causing said data message means to assemble, queue and dispatch data messages from said data memory means and said control message means to assemble, queue and dispatch control messages from said control memory means, said data messages generally being substantially longer than said control messages; and

input/output (I/O) switch means coupled between said N bi-directional communication links and said data message means and control message means and including routing control means, for utilizing said N bidirectional communication links to enable concurrent dispatch of control messages and data messages in accord with outputs from said routing control means, said I/O switch means employing said N bidirectional communication links to enable dispatch of said control messages, without requiring delay thereof pending completion of dispatch of said data messages.

2. The distributed data processing system as recited in claim 1, wherein said routing control means is responsive to a message received via a bidirectional communication link, which message is addressed to another node, to direct said message to said another node without involving an operation of said processor means.

3. The distributed data processing system as recited in claim 1, wherein said I/O switch means dispatches data messages and control messages in an order received from said data message means and control message means, respectively, and in a case when a data message and control message are received substantially simultaneously, dispatches said control message before said data message.

4. The distributed data processing system as recited in claim 1, wherein said routing control means comprises:

table means including an entry for each destination node, said entry specifying a primary bidirectional communication link to be allocated for messages addressed said destination node and plural alternate bidirectional communication links to be employed in case said primary bidirectional communication link is busy.

5. The distributed data processing system as recited in claim 1, wherein each address appended to a message for said destination node includes a value employed by said routing control means to determine whether said message to said destination node is to be transmitted over just one or plural ones of said bi-directional communication links.

6. The distributed data processing system as recited in claim 4, wherein said routing control means includes control means responsive to received message address header information to determine if said information indicates another node, and if yes, to access an entry in said table means corresponding to said information and to enable dispatch of said message, all without involvement of said processor means.

7. The distributed data processing system as recited in claim 1, wherein said processor means controls said data message means and data memory means to assemble indefinitely long data messages with interspersed cyclic redundancy codes (CRC) for error checking, each said CRC positioned at a position in said indefinitely along data messages which is within an error detection capability of said CRC, an indefinitely long data message comprising header information followed by data as read from a track or tracks of a disk drive.

8. The distributed data processing system as recited in claim 1, further comprising:

means in said control message means for determining whether a received control message is a first type to be processed by said processor means or a second type to be processed by an order execution unit; and

an order execution unit for receiving second type control messages and for performing an operation required by said second type control message without intervention of said processor means.

9. The distributed data processing system as recited in claim 8, wherein said second type control message requests a state report and said order execution unit retrieves a state value, inserts said state value into a response control message and dispatches said response control message.

10. The distributed data processing system as recited in claim 1, wherein said control memory means and data memory means comprise two portions of a unitary random access memory.