Mechanism to improve performance in a multi-node computer...

Electrical computers and digital data processing systems: input/ – Input/output data processing – Input/output access regulation

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S201000, C709S223000, C712S032000

Reexamination Certificate

active

06862634

ABSTRACT:
In a distributed multi-node computer system each switch provides routing of data packets between CPU nodes, I/O nodes, and memory nodes. Each switch is connected through a corresponding I/O node to a network interface controller (NIC) for transferring data packets on a network. Each NIC is memory-mapped. Part of the system address space forms a send window for each NIC connected to a corresponding switch. A mechanism for controlling data packets transmission is defined such that each CPU write to a NIC send window is atomic and self-defining, i.e., it does not rely on immediately preceding write to determine where the data packet should be sent. Using “address aliasing”, CPU writes to the aliased part of the NIC send window are always directed to the NIC connected to the same switch as the CPU which did the write.

REFERENCES:
patent: 5175839 (1992-12-01), Ikeda et al.
patent: 5465338 (1995-11-01), Clay
patent: 5561780 (1996-10-01), Glew et al.
patent: 5592671 (1997-01-01), Hirayama
patent: 5727150 (1998-03-01), Laudon et al.
patent: 5761460 (1998-06-01), Santos et al.
patent: 5829032 (1998-10-01), Komuro et al.
patent: 5859985 (1999-01-01), Gormley et al.
patent: 5887134 (1999-03-01), Ebrahim
patent: 6006255 (1999-12-01), Hoover et al.
patent: 6014690 (2000-01-01), VanDoren et al.
patent: 6026472 (2000-02-01), James et al.
patent: 20020184345 (2002-12-01), Masuyama et al.
patent: 20020186711 (2002-12-01), Masuyama et al.
patent: 20030005070 (2003-01-01), Narasimhamurthy et al.
patent: 20030005156 (2003-01-01), Miryala et al.
patent: 20030007457 (2003-01-01), Farrell et al.
patent: 20030007493 (2003-01-01), Oi et al.
patent: 20030023666 (2003-01-01), Conway et al.
Abandah, Gheith A., and Davidson, Edward S., Effects of Architectural and Technological Advances on the HP/Convex Exemplar's Memory and Communication Performance, IEEE 1998—1063-6897, pp. 318-329.
Falsafi, Babak and Wood, David A., Reactive NUMA: A Design for Unifying S-COMA and CC-NUMA, ISCA '97, CO, USA, pp. 229-240.
Geralds, John in Silicon Valley. Sun enhances partitioning in Starfire Unix server. Dec. 8, 1999 VNU Business Publishing Limited [retrieved on Apr. 11, 2001]. Retrieved from the internet: URL:http://www.vnunet.com/print/104311.
IBM. The IBM NUMA-Q enterprise server architecture.Solving issues of latency and scalability in multiprocessor systems. Jan. 19, 2000, 10 pages.
Lovett, Tom and Clapp, Russell; StiNG: A CC-NUMA Computer System for the Commercial Marketplace; ISCA '95, PA, USA, pp. 308-317.
Servers White Paper.Sun Enterprise™1000 Server: Dynamic System Domains. Sun Microsystems, Inc., Palo Alto, CA, USA. 2001. [retrieved on Apr. 11, 2001]. Retrieved from the internet: URL:http://www.sun.com/servers/white-papers/domains.html?pagestyle=print.
Unisys White Paper.Cellular Multiprocessing Shared Memory: Shared Memory and Windows, Sep. 2000, pp. 1-16.
Willard, Christopher, and IDC White Paper.Superdome—Hewlett-Packard Extends Its High-End Computing Capabilities, (2000), pp. 1-20.

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

Mechanism to improve performance in a multi-node computer... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanism to improve performance in a multi-node computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism to improve performance in a multi-node computer... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3434402

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