Method and apparatus for address transfers, system...

Data processing: generic control systems or specific application – Generic control system – apparatus or process – Plural processors

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C710S120000, C711S110000, C711S003000

Reexamination Certificate

active

06466825

ABSTRACT:

BACKGROUND
The system of
FIG. 1
is a prototypical prior art symmetric multiprocessor (SMP) system
100
. This traditional approach provides uniform access to memory
130
over a shared system bus
110
. Each processor
120
has an associated cache and cache controller. The caches are individually managed according to a common cache coherency protocol to insure that all software is well behaved. The caches continually monitor (snoop) the shared system bus
110
, watching for cache updates and other system transactions. Transactions are often decomposed into different component stages, controlled by different system bus signals, such that different stages of multiple transactions may be overlapped in time to permit greater throughput. Nevertheless, for each stage, subsequent transactions make sequential use of the shared bus. The serial availability of the bus insures that transactions are performed in a well-defined order. Without strong transaction ordering, cache coherency protocols fail and system and application software will not be well behaved.
A first problem with the above-described traditional SMP system is that the serial availability of the bus limits the scalability of the SMP system. As more processors are added, eventually system performance is limited by the saturation of the shared system bus.
A second problem of traditional SMP systems is that multiple cycles are required to process each transaction. This is partially attributed to the use of multi-point tri-state busing of lightly pipelined transactions.
A third problem exists for existing SMP systems using pipelined bus structures. Difficulties may arise from permitting an initiator to perform locked operations. Normally, a simple priority scheme (such as a rotating priority) is used to permit all initiators to generate transactions on an equal access basis. Locked operations permit transaction initiators to make a number of subsequent transactions without surrendering the bus to other initiators in the short term. This is necessary to implement semaphores used to prevent race and deadlock conditions. Unfortunately, interactions between such locked operations and simple bus priority schemes may result in an initiator being starved for access for excessive periods.
What is needed is an SMP system architecture that provides greater scalability by permitting concurrent use of multiple buses, while still providing a system serialization point to maintain strong transaction ordering and cache coherency. What is also needed is an SMP architecture that further provides increased transaction throughputs. Additionally, an SMP architecture is needed to enable locked operations while preventing initiator starvation.
SUMMARY
A preferred embodiment of a symmetric multiprocessor system includes a switched fabric (switch matrix) for data transfers that provides multiple concurrent buses that enable greatly increased bandwidth between processors and shared memory. A Transaction Controller, Transaction Bus, and Transaction Status Bus are used for serialization, centralized cache control, and highly pipelined address transfers. The shared Transaction Controller serializes transaction requests from Initiator devices that can include CPU/Cache modules and Peripheral Bus modules. The Transaction Bus of an illustrative embodiment is implemented using segmented buses, distributed muxes, point-to-point wiring, and supports transaction processing at a rate of one transaction per clock cycle. The Transaction Controller monitors the Transaction Bus, maintains a set of duplicate cache-tags for all CPU/Cache modules, maps addresses to Target devices, performs centralized cache control for all CPU/Cache modules, filters unnecessary Cache transactions, and routes necessary transactions to Target devices over the Transaction Status Bus. The Transaction Status Bus includes both bus-based based and point-to-point control of the target devices. A modified rotating priority scheme is used to provide Starvation-free support for Locked buses and memory resources via backoff operations. Speculative memory operations are supported to further enhance performance.


REFERENCES:
patent: 4315308 (1982-02-01), Jackson
patent: 4438494 (1984-03-01), Budde et al.
patent: 4480307 (1984-10-01), Budde et al.
patent: 5313609 (1994-05-01), Baylor et al.
patent: 5335335 (1994-08-01), Jackson et al.
patent: 5440698 (1995-08-01), Sindhu et al.
patent: 5511226 (1996-04-01), Zilka
patent: 5513335 (1996-04-01), McClure
patent: 5524234 (1996-06-01), Martinez, Jr. et al.
patent: 5535363 (1996-07-01), Prince
patent: 5537569 (1996-07-01), Masubuchi
patent: 5537575 (1996-07-01), Foley
patent: 5550988 (1996-08-01), Sarangdhar et al.
patent: 5553310 (1996-09-01), Taylor et al.
patent: 5561779 (1996-10-01), Jackson
patent: 5568620 (1996-10-01), Sarangdhar et al.
patent: 5574868 (1996-11-01), Marisetty
patent: 5577204 (1996-11-01), Brewer et al.
patent: 5581729 (1996-12-01), Nishtala et al.
patent: 5588131 (1996-12-01), Borrill
patent: 5594886 (1997-01-01), Smith et al.
patent: 5606686 (1997-02-01), Tarui et al.
patent: 5634043 (1997-05-01), Self et al.
patent: 5634068 (1997-05-01), Nishtala et al.
patent: 5644754 (1997-07-01), Weber
patent: 5655100 (1997-08-01), Ebrahim et al.
patent: 5657472 (1997-08-01), Van Loo et al.
patent: 5682516 (1997-10-01), Sarangdhar et al.
patent: 5684977 (1997-11-01), Van Loo et al.
patent: 5696910 (1997-12-01), Pawlowski
patent: 5796605 (1998-08-01), Hagersten
patent: 5829034 (1998-10-01), Hagersten et al.
patent: 5895495 (1999-04-01), Arimilli et al.
patent: 5897656 (1999-04-01), Vogt et al.
patent: 5940856 (1999-08-01), Arimilli et al.
patent: 5946709 (1999-08-01), Arimilli et al.
patent: 6065077 (2000-05-01), Fu
patent: 6249520 (2001-06-01), Steely, Jr. et al.
patent: 6279084 (2001-08-01), VanDoren et al.
Technical White Paper, Sun TM Enterprise TM 10000 Server, Sun Microsystems, Sep. 1998.
Alan Charlesworth, Starfire: Extending the SMP Envelope, IEEE Micro, Jan./Feb. 1998, pp. 39-49.
Joseph Heinrich, Origin TM and Onyz2 TM Theory of Operations Manual, Document No. 007-3439-002, Silicon Graphics, Inc., 1997.
White Paper, Sequent's NUMA-Q SMP Architecture, Sequent, 1997.
White Paper, Eight-way Multiprocessing, Hewlett-Packard, Nov. 1997.
George White & Pete Vogt, Profusion, a Buffered, Cache-Coherent Crossbar Switch, presented at Hot Interconnects Symposium V, Aug. 1997.
Alan Charlesworth, et al., Gigaplane—XB: Extending the Ultra Enterprise Family, presented at Hot Interconnects Symposium V, Aug. 1997.
James Loudon & Daniel Lenoski, The SGI Origin: A ccNUMA Highly Scalable Server, Silcon Graphics, Inc., presented at the Proc. Of the 24thInt'l Symp. Computer Architecture, Jun. 1997.
Mike Galles, Spider: A High-Speed Network Interconnect, IEEE Micro, Jan./Feb. 1997, pp. 34-39.
T.D. Lovett, R. M. Clapp and R. J. Safranek, NUMA-Q: an SCI-based Enterprise Server, Sequent, 1996.
Daniel E. Lenoski & Wolf-Dietrich Weber, Scalable Shared-Memory Multiprocessing, Morgan Kaufmann Publishers, 1995, pp. 143-159.
David B. Gustavson, The Scalable coherent Intefrace and Related Standards Projects, (as reprinted in Advanced Multimicroprocessor Bus Architectures, Janusz Zalewski, IEEE computer Society Press, 1995, pp. 195-207.)
Kevin Normoyle, et al., UltraSPARC TM Port Architecture, Sun Microsystems, Inc., presented at Hot Interconnects III, Aug. 1995, UltraSparc Interfaces.
Kai Hwang, Advanced Computer Architecture: Parellelism, Scalability, Programmability, McGraw-Hill, 1993, pp. 355-357.
Jim Handy, The Cache Memory Book, Academic Press, 1993, pp. 161-169.
Angel L. Decegama, Parallel Processing Architectures and VLSI Hardware, vol. 1, Prentice-Hall, 1989, pp. 341-344.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for address transfers, system... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for address transfers, system..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for address transfers, system... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2991445

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.