Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1999-11-09
2003-07-08
Sheikh, Ayaz (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C709S201000, C709S202000, C709S232000, C709S241000, C711S141000, C711S146000, C712S028000
Reexamination Certificate
active
06591307
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates in general to data processing and, in particular, to communication within a data processing system. Still more particularly, the present invention relates to a multi-node data processing system and communication protocol that support a partial combined response.
2. Description of the Related Art
It is well-known in the computer arts that greater computer system performance can be achieved by harnessing the processing power of multiple individual processors in tandem. Multi-processor (MP) computer systems can be designed with a number of different architectures, of which various ones may be better suited for particular applications depending upon the design point, performance requirements, and software environment of each application. Known architectures include, for example, the symmetric multiprocessor (SMP) and non-uniform memory access (NUMA) architectures. Until the present invention, it has generally been assumed that greater scalability and hence greater performance is obtained by designing more hierarchical computer systems, that is, computer systems having more layers of interconnects and fewer connections per interconnect.
The present invention recognizes, however, that such hierarchical computer systems incur extremely high access latency for the percentage of data requests and other transactions that must be communicated between processors coupled to different interconnects. For example, even for the relatively simple case of an 8-way SMP system in which four processors present in each of two nodes are coupled by an upper level bus and the two nodes are themselves coupled by a lower level bus, communication of a data request between processors in different nodes will incur bus aquisition and other transaction-related latency at each of three buses. Because such latencies are only compounded by increasing the depth of the interconnect hierarchy, the present invention recognizes that it would be desirable and advantageous to provide an improved data processing system architecture having reduced latency for transaction between physically remote processors.
SUMMARY OF THE INVENTION
The present invention realizes the above and other advantages in a multi-node data processing system having a non-hierarchical interconnect architecture.
In accordance with the present invention, a data processing system includes an interconnect, a plurality of nodes coupled to the interconnect that each include at least one agent, response logic within each node, and a queue. In response to snooping a transaction on the interconnect, each agent outputs a snoop response. In addition, the queue, which has an associated agent, allocates an entry to service the transaction. The response logic within each node accumulates a partial combined response of its node and any preceding node until a complete combined response for all of the plurality of nodes is obtained. However, prior to the associated agent receiving the complete combined response, the queue speculatively deallocates the entry if the partial combined response indicates that an agent other than the associated agent will service the transaction.
All objects, features, and advantages of the present invention will become apparent in the following detailed written description.
REFERENCES:
patent: 3766526 (1973-10-01), Buchanan
patent: 4905145 (1990-02-01), Sauber
patent: 5032985 (1991-07-01), Curran et al.
patent: 5081623 (1992-01-01), Ainscow
patent: 5179715 (1993-01-01), Andoh et al.
patent: 5327570 (1994-07-01), Foster et al.
patent: 5488694 (1996-01-01), McKee et al.
patent: 5588122 (1996-12-01), Garcia
patent: 5592622 (1997-01-01), Isfeld et al.
patent: 5623628 (1997-04-01), Brayton et al.
patent: 5659759 (1997-08-01), Yamadia
patent: 5715428 (1998-02-01), Wang et al.
patent: 5734922 (1998-03-01), Hagersten et al.
patent: 5781757 (1998-07-01), Deshpande
patent: 5787468 (1998-07-01), Clark
patent: 5852716 (1998-12-01), Hagersten
patent: 5860109 (1999-01-01), Hagersten et al.
patent: 5881312 (1999-03-01), Dulong
patent: 5884046 (1999-03-01), Antonov
patent: 5887138 (1999-03-01), Hagersten et al.
patent: 5895484 (1999-04-01), Arimilli et al.
patent: 5937167 (1999-08-01), Arimilli et al.
patent: 5938765 (1999-08-01), Dove et al.
patent: 5958011 (1999-09-01), Arimilli et al.
patent: 5958019 (1999-09-01), Hagersten et al.
patent: 5983301 (1999-11-01), Baker et al.
patent: 6006286 (1999-12-01), Baker et al.
patent: 6009456 (1999-12-01), Frew et al.
patent: 6009472 (1999-12-01), Boudou et al.
patent: 6011777 (2000-01-01), Kunzinger
patent: 6067611 (2000-05-01), Carpenter et al.
patent: 6081874 (2000-06-01), Carpenter et al.
patent: 6148327 (2000-11-01), Whitebread et al.
patent: 6148361 (2000-11-01), Carpenter et al.
patent: 6161189 (2000-12-01), Arimilli et al.
patent: 6181262 (2001-01-01), Bennett
patent: 6219741 (2001-04-01), Pawlowski et al.
patent: 6333938 (2001-12-01), Baker
patent: 6338122 (2002-01-01), Baumgartner et al.
patent: 6343347 (2002-01-01), Arimilli et al.
patent: 6421775 (2002-07-01), Brock et al.
Farrens et al., “Workload and Implementation Considerations for Dynamic Base Register Caching”, Proceedings of the 24th Annual International Symposium on Microarchitecture, pp. 62-62, Nov. 1991.
Cho et al., “Removing Timing Contraints of Snooping in a Bus-Based COMA Multiprocessor”, International Conference on Parallel and Distributed Computing and Systems, Oct. 1996.
Preiss et al., “A Cache-based Message Passing Scheme for a Shared-Bus”, The 15th Annual International Symposium on Computer Archtiecture, pp. 358-364, Jun. 1988.
Park et al., “Address Compression Through Base Register Caching”, Proceedings of the 23rd Annual Workshop and Symposium on Microprogramming and Microarchitecture, pp. 193-199, 1990.
Arimilli Ravi Kumar
Fields, Jr. James Stephen
Guthrie Guy Lynn
Joyner Jody Bern
Lewis Jerry Don
Bracewell & Patterson L.L.P.
International Business Machines - Corporation
Salys Casimer K.
Sheikh Ayaz
Won Young
LandOfFree
Multi-node data processing system and method of queue... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multi-node data processing system and method of queue..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-node data processing system and method of queue... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3038482