Scaleable wormhole-routing concentrator

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S427000

Reexamination Certificate

active

06687253

ABSTRACT:

BACKGROUND OF THE INVENTION
A communication or computing network is composed of several or many devices that are physically connected through a communication medium, for example a metal or fiber optic cable. One type of device that can be included in a network is a concentrator. For example, a large-scale time-division switching network may include a central switching network and a series of concentrators that are connected to input and output terminals of other devices in the switching network.
Concentrators are typically used to support multiport connectivity to a network. A concentrator is a device that is connected to a plurality of shared communications lines that concentrates information onto fewer lines. Concentrators inherently reduce the capacity of an interconnect path by increasing the occurrence of blocking and data loss, or by calling for storage of information in buffers.
A persistent problem that arises in massively parallel computing and in communications occurs when moving the data to the processors and users. This problem is exacerbated in systems that incorporate concentrators due to the inherent reduction in capacity.
What is needed is a concentrator structure that rapidly routes data and improves information flow by avoiding blockages, that is scaleable virtually without limit, and that supports low latency and high throughput.
SUMMARY OF THE INVENTION
An interconnect structure substantially improves operation of an information concentrator through usage of single-bit routing through control cells using a control signal. The terms “cell” or “control cell” refer to a simple switching element. The term “node” refers to a cell or group of cells that operate as a unit. The interconnect structure and operating technique support wormhole routing and flow of messages. Message packets entering the structure are never discarded, so that any packet that enters the structure is guaranteed to exit.
In accordance with an aspect of the present invention, an interconnect structure includes a ribbon of interconnect lines connecting a plurality of nodes in nonintersecting paths. The ribbon of interconnect lines winds through a plurality of levels from the source level to the destination level. The number of turns of a winding decreases from the source level to the destination level. The interconnect structure further includes a plurality of columns formed by interconnect lines coupling the nodes across the ribbon in cross-section through the windings of the levels. A method of communicating data over the interconnect structure incorporates a high-speed minimum logic method for routing data packets down multiple hierarchical levels.


REFERENCES:
patent: 5280586 (1994-01-01), Kunz et al.
patent: 5408231 (1995-04-01), Bowdon
patent: 5535197 (1996-07-01), Cotton
patent: 5541914 (1996-07-01), Krishnamoorthy et al.
patent: 5649108 (1997-07-01), Spiegel et al.
patent: 5859981 (1999-01-01), Levin et al.
patent: 5917426 (1999-06-01), Yoshifuji
patent: 0 868 104 (1998-09-01), None
patent: 0 966 123 (1999-12-01), None
patent: 0 966 123 (2001-02-01), None
patent: WO 97/30555 (1997-08-01), None

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

Scaleable wormhole-routing concentrator does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scaleable wormhole-routing concentrator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaleable wormhole-routing concentrator will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3332414

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