US20020056023A1 - Mesh network with method and apparatus for interleaved binary exchange - Google Patents
Mesh network with method and apparatus for interleaved binary exchange Download PDFInfo
- Publication number
- US20020056023A1 US20020056023A1 US09/879,030 US87903001A US2002056023A1 US 20020056023 A1 US20020056023 A1 US 20020056023A1 US 87903001 A US87903001 A US 87903001A US 2002056023 A1 US2002056023 A1 US 2002056023A1
- Authority
- US
- United States
- Prior art keywords
- node
- nodes
- information
- quadrant
- array
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000012546 transfer Methods 0.000 claims abstract description 26
- 230000008569 process Effects 0.000 description 13
- 230000005540 biological transmission Effects 0.000 description 6
- 230000008707 rearrangement Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 238000003491 array Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
Definitions
- Latency ( ⁇ ) the latency is defined as the start up time required to transfer a message and includes fixed overheads associated with each message. ⁇ typically has the units of seconds.
- Rearrangement rate ( ⁇ ) the rearrangement rate is the rate at which information can be rearranged at the node for further transmission. ⁇ typically has the units of bytes/sec.
- the first term of the equation relates to the latency of the system, the second term corresponds to the system bandwidth, and the last term defines the rearrangement rate.
- Table I shows the different terms of the equation for the method of the present invention (entitled Interleaved Binary Exchange) with similar terms for information exchange equations relating to the Direct Exchange algorithm, Binary Exchange algorithm and the Quadrant Exchange algorithm.
Abstract
A method for transferring information within a mesh network that has an array of nodes defined by four quadrants. The method includes the initial step of transferring information from a set of nodes in one quadrant to a set of nodes located in an adjacent quadrant. The transfer of information simultaneously occurs in both a vertical and horizontal direction within the array. Information is then transferred between nodes within the same quadrant and subquadrants.
Description
- 1. FIELD OF THE INVENTION
- The present invention relates to a method of transmitting information within a network.
- 2. DESCRIPTION OF RELATED ART
- To increase the size, speed and scalability of computer systems, computers may be linked together within a network to process information in parallel. Such systems are commonly referred to as parallel processing networks. Parallel processing networks typically have a plurality of microprocessor based components coupled together by busses and associated hardware. Each processor based component functions as a node which can transmit information to other nodes within the network.
- The nodes can be arranged as a plurality of interconnected cubes, commonly referred to as a hypercube. Hypercubes require a large number of data links, which increase the size of the system.
- The nodes can also be arranged in a two-dimensional array, commonly referred to as a network mesh. FIGS. 1a-d show a method of transferring information within a mesh that is commonly referred to as the Direct Exchange Algorithm. In the Direct Exchange method, information is transferred from one node to another node within the same row of the mesh. The process is repeated until the information of one node is transferred to each of the nodes within the row. For example, as shown in FIG. 1a, in the first step, the information from
node 1 is transferred tonode 3,node 2 transfers information tonode 1,node 3 transfers information tonode 4 and the information ofnode 4 is transferred tonode 2. The process of transferring information between nodes is repeated in accordance with the patterns shown in FIGS. 1b, 1 c and 1 d. The information can then be transferred between rows and the process is repeated. Although the Direct Exchange Algorithm has a relatively high transmission rate, the number of messages and the start-up time to send the messages from each node rapidly increases with the size of the mesh. - FIGS. 2a-f and 3 a-d show other methods of transferring information within a mesh, commonly referred to as the Binary Exchange Algorithm and the Quadrant Exchange Algorithm, respectively. Both of theses methods utilize a store and forward approach, wherein each node can both receive and forward information transmitted by another node. As shown in FIG. 2a, in the first step of the Binary Exchange method, the nodes in one half of the mesh transmit information to nodes in the other half of the mesh in a horizontal direction. The process is repeated by sending the information from one half of the mesh to the other half of the mesh in a vertical direction, as shown in FIG. 2b. As shown in FIGS. 2c-f, the information is then transferred within quadrants and subquadrants of the mesh.
- In the Quadrant Exchange method, information is transferred within rectangular groups of nodes as shown in FIGS. 3a and 3 b. As shown in FIG. 3C, the information is then transferred within separate quadrants of the mesh. Although both the Binary and Quadrant Exchange methods can be used in large mesh networks, the start-up time and transmission rate are relatively slow. Additionally, the Quadrant method is susceptible to node contention. It would be desirable to provide an algorithm for a mesh network, that was not susceptible to node contention and had a relatively high complete information exchange rate.
- The present invention is a method for transferring information within a mesh network that has an array of nodes defined by four quadrants. The method includes the initial steps of transferring information from a set of nodes in one quadrant to a set of nodes located in an adjacent quadrant. The transfer of information simultaneously occurs in both a vertical and horizontal direction within the array. Information is then transferred between nodes within the same quadrant and subquadrants.
- The objects and advantages of the present invention will become more readily apparent to those ordinarily skilled in the art after reviewing the following detailed description and accompanying drawings, wherein:
- FIGS. 1a-d are schematics showing information being transferred between nodes arranged in a row in accordance with a method in the prior art;
- FIGS. 2a-f are schematics showing information being transferred between nodes arranged in a two-dimensional array in accordance with a method in the prior art;
- FIGS. 3a-c are schematics showing information being transferred between nodes arranged in a two-dimensional array in accordance with a method in the prior art;
- FIG. 4 is a schematic of a mesh network having an array of nodes that can transfer information;
- FIG. 5 is a schematic showing a node exchanging data with four neighboring nodes;
- FIG. 6a is a schematic of a four by four array of nodes showing a first step of the present method;
- FIG. 6b is a schematic similar to FIG. 3a showing a second step of the method;
- FIG. 6c is a schematic similar to FIG. 3a showing a third step of the method;
- FIG. 6d is a schematic similar to FIG. 3a showing a fourth step of the method;
- FIGS. 7a-h are schematics showing the method in an eight by eight array of nodes.
- Referring to the drawings more particularly by reference numbers, FIG. 4 shows a mesh network which has a plurality of nodes labeled1-16. Each node is capable of transmitting and receiving information from another node. As shown in FIG. 5, in the preferred embodiment, each node is a functional computer on a
card 20 that can be plugged into the network. Thecard 20 contains a microprocessor, memory and other associated hardware required to process information. Thecomputer cards 20 contain aninterface 22 that couples the components of the card to a number ofbusses 24. The busses are connected to other cards (nodes) and provide a medium to transfer information between the cards. The cards typically process information in parallel, wherein the mesh is a parallel processing network. - Each card generates an address for the destination node, along with the information that is to be transmitted to the other node. The address and information are then sent to a node in accordance with the algorithm of the present invention. The transmitting node may also receive information from the destination node. The receiving node stores both the address and the information sent by the transmitting node. If the receiving node has a matching address (destination node) then the node processes the information. If the address of the receiving card does not match the destination address, then the card forwards the address and information to the next node, again in accordance with the algorithm of the present invention. In the preferred embodiment, each node transfers information to a receiving node through a dedicated bus, to avoid bus contention within the system.
- The network has a
controller 26 which controls the transfer of information between the nodes. Thecontroller 26 controls which node will receive the information. For example, in accordance with the algorithm of the present invention, thecard 20 atnode 1 may initially exchange information withnode 3, then exchange information withnode 9 and finally exchange information withnodes controller 26 enables the interface of the cards atnodes controller 26 may initially allow information generated bynode 1 to be transmitted tonode 3, and the information generated bynode 3 to be subsequently transmitted tonode 1. The controller can control the bus and corresponding node that is to receive the information by providing a command to the card or driving active one or more control signals that enable each bus. - If the information sent by
node 3 is to be processed bynode 1, the card atnode 1 processes the information. If the information transmitted bynode 3 is not to be processed bynode 1,node 1 retransmits the information generated bynode 3 tonode 9 in accordance with the second step of the algorithm.Node 1 also receives information fromnode 9, and the process is repeated withnodes - FIGS. 6a-d show the steps of transferring information in accordance with an algorithm of the present claimed invention. The method allows the nodes located along a diagonal line of the array to transfer information from one half of the mesh to another half of the mesh. The information is transferred in both a horizontal and vertical direction within the array. The process of vertically and horizontally transferring information from nodes along a diagonal line may be repeated a predetermined number of times. The information is then transferred between nodes within the same quadrant and subquadrants of the nodal array.
- FIGS. 6a-d show the steps of transferring information within a 4 by 4 array of nodes in accordance with an algorithm of the present invention. The lines indicate the path of information transferred between the corresponding nodes. The first step is shown in FIG. 6a, wherein
nodes nodes nodes nodes - The second step of the algorithm is shown in FIG. 6b, wherein the nodes that transferred information horizontally in the first step, transfer information vertically, and the nodes that transferred information vertically transfer horizontally. Accordingly, in the second step,
nodes nodes nodes nodes - FIGS. 6c and 6 d, show steps three and four of the present algorithm, respectively, wherein the nodes transfer information within the same quadrant of the mesh. In step three (FIG. 6c) the nodes all transfer information horizontally with an adjacent node in the same quadrant. In step four (FIG. 6d) the nodes all transfer information vertically with an adjacent node in the same quadrant. The steps shown in FIGS. 6a-d are then repeated.
- FIGS. 7a-h show the algorithm of the present invention being performed within an 8 by 8 array of nodes. Like the process of transferring information in the 4 by 4 array, the nodes in one quadrant of the mesh transfer information to nodes in an adjacent quadrant of the array in both the vertical and horizontal directions. The process of transferring information between quadrants of nodes is repeated three more times as shown in FIGS. 7b-d. The nodes then transfer information with nodes of the same quadrant and subquadrant as shown in FIGS, 7 e-h. Although 4 by 4 and 8 by 8 nodal arrays are shown and described, it is to be understood that the algorithm of the present claimed invention can be used in other two-dimensional nodal arrays.
- The complete time to exchange information between nodes can be defined by the following three parameters.
- Latency (α): the latency is defined as the start up time required to transfer a message and includes fixed overheads associated with each message. α typically has the units of seconds.
- Bandwidth (B): the bandwidth is the rate at which information can be transmitted along the communication links between the nodes. B typically has the units of bytes/sec.
- Rearrangement rate (δ): the rearrangement rate is the rate at which information can be rearranged at the node for further transmission. δ typically has the units of bytes/sec.
-
- wherein;
- m=the bytes of data transferred.
- n=the number of nodes in the network.
- K=log2{square root}{square root over (n)} {or k such that n=2k·2k}.
- The first term of the equation relates to the latency of the system, the second term corresponds to the system bandwidth, and the last term defines the rearrangement rate. Table I shows the different terms of the equation for the method of the present invention (entitled Interleaved Binary Exchange) with similar terms for information exchange equations relating to the Direct Exchange algorithm, Binary Exchange algorithm and the Quadrant Exchange algorithm.
TABLE I Start-Up Time Transmission Time Rearrangement Time Binary Exchange Absolute 2(2k − 1)α Relative ˜2 ˜2 1 Direct Exchange Absolute 2(3k−2)α None Relative 22k/4 1/2 0 Quadrant Exchange Absolute 3(2k − 1) α Relative ˜3 ˜3/2 1 Interleaved Binary Absolute 2k α Exchange Relative 1 1 1 - As shown in Table I, the algorithm of the present invention provides improved performance over both the Binary Exchange and Quadrant Exchange algorithms by reducing the start-up and transmission times. The Direct Exchange algorithm provides better performance for both the transmission time and the rearrangement time, but the start-up time and number of messages increases drastically for larger mesh networks. The present invention thus provides an algorithm that improves the performance of scalable parallel processing networks over algorithms in the prior art.
- While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on the broad invention, and that this invention not be limited to the specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art.
Claims (8)
1. A method for transmitting information within a network that has an array of nodes arranged in four quadrants, comprising the steps of:
a) transferring information from nodes in each quadrant to nodes in an adjacent quadrant in both a horizontal direction and a vertical direction within the array; and,
b) transferring information between nodes within a same quadrant.
2. The method as recited in claim 1 , wherein said step (a) is repeated a predetermined number of times before step (b).
3. The method as recited in claim 1 , wherein step (b) is repeated a predetermined number of times.
4. The method as recited in claim 1 , wherein in step (a) each node transfers information to another node having a same location within the adjacent quadrant.
5. A method for transmitting information within a network that has an array of nodes arranged in four quadrants, comprising the steps of:
a) transferring information from nodes in each quadrant to nodes having a same location in an adjacent quadrant in both a horizontal direction and a vertical direction within the array;
b) repeating step (a) a predetermined number of times;
c) transferring information between nodes within a same quadrant; and,
d) repeating step (b) a predetermined number of times.
6. A method for transmitting information within a network that has nodes one through sixteen arranged in a four by four array wherein nodes one through four are in a first row, nodes five through eight are in a second row, nodes nine through twelve are in a third row and nodes thirteen through sixteen are in a fourth row, comprising the steps of:
a) transferring information between node one and node three, between node nine and node eleven, between node six and node eight, between node fourteen and node sixteen, between node two and node ten, between node four and node twelve, between node five and node thirteen, between node seven and node fifteen;
b) transferring information between node one and node nine, between node three and node eleven, between node six and node fourteen, between node eight and node sixteen, between node two and node four, between node five and node seven, between node ten and node twelve, between node thirteen and node fifteen;
c) transferring information between node one and node two, between node three and node four, between node five and node six, between node seven and node eight, between node nine and node ten, between node eleven and node twelve, between node thirteen and node fourteen, between node fifteen and node sixteen; and,
d) transferring information between node one and node five, between node two and node six, between node three and node seven, between node four and node eight, between node nine and node thirteen, between node ten and node fourteen, between node eleven and node fifteen, between node twelve and node sixteen.
7. An information network, comprising:
an array of nodes arranged in four quadrants, said nodes transfer information from nodes in each quadrant to nodes in an adjacent quadrant in both a horizontal direction and a vertical direction within said array, and then further transfer information between nodes within a same quadrant.
8. The network as recited in claim 7 , wherein each node transfers information to another node having a same location within the adjacent quadrant.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/879,030 US6460128B1 (en) | 1994-05-11 | 2001-06-12 | Mesh network with method and apparatus for interleaved binary exchange |
US10/188,956 US6948048B2 (en) | 1994-05-11 | 2002-07-02 | Method and apparatus for interleaved exchange in a network mesh |
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US24118294A | 1994-05-11 | 1994-05-11 | |
US57169495A | 1995-12-12 | 1995-12-12 | |
US08/773,262 US6173387B1 (en) | 1994-05-11 | 1996-12-23 | Interleaved exchange in a network mesh |
US09/624,287 US6356992B1 (en) | 1994-05-11 | 2000-07-24 | Method and apparatus for interleaved exchange in a network mesh |
US09/879,030 US6460128B1 (en) | 1994-05-11 | 2001-06-12 | Mesh network with method and apparatus for interleaved binary exchange |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/624,287 Continuation US6356992B1 (en) | 1994-05-11 | 2000-07-24 | Method and apparatus for interleaved exchange in a network mesh |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/188,956 Division US6948048B2 (en) | 1994-05-11 | 2002-07-02 | Method and apparatus for interleaved exchange in a network mesh |
Publications (2)
Publication Number | Publication Date |
---|---|
US20020056023A1 true US20020056023A1 (en) | 2002-05-09 |
US6460128B1 US6460128B1 (en) | 2002-10-01 |
Family
ID=26934073
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/773,262 Expired - Fee Related US6173387B1 (en) | 1994-05-11 | 1996-12-23 | Interleaved exchange in a network mesh |
US09/624,287 Expired - Fee Related US6356992B1 (en) | 1994-05-11 | 2000-07-24 | Method and apparatus for interleaved exchange in a network mesh |
US09/879,030 Expired - Fee Related US6460128B1 (en) | 1994-05-11 | 2001-06-12 | Mesh network with method and apparatus for interleaved binary exchange |
US10/188,956 Expired - Fee Related US6948048B2 (en) | 1994-05-11 | 2002-07-02 | Method and apparatus for interleaved exchange in a network mesh |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/773,262 Expired - Fee Related US6173387B1 (en) | 1994-05-11 | 1996-12-23 | Interleaved exchange in a network mesh |
US09/624,287 Expired - Fee Related US6356992B1 (en) | 1994-05-11 | 2000-07-24 | Method and apparatus for interleaved exchange in a network mesh |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/188,956 Expired - Fee Related US6948048B2 (en) | 1994-05-11 | 2002-07-02 | Method and apparatus for interleaved exchange in a network mesh |
Country Status (1)
Country | Link |
---|---|
US (4) | US6173387B1 (en) |
Families Citing this family (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6173387B1 (en) * | 1994-05-11 | 2001-01-09 | Intel Corporation | Interleaved exchange in a network mesh |
US6023753A (en) * | 1997-06-30 | 2000-02-08 | Billion Of Operations Per Second, Inc. | Manifold array processor |
US6732215B2 (en) * | 2001-02-05 | 2004-05-04 | Total Impact | Super scalable multiprocessor computer system |
US7835372B2 (en) * | 2002-05-13 | 2010-11-16 | Weilin Wang | System and method for transparent wireless bridging of communication channel segments |
US7069483B2 (en) * | 2002-05-13 | 2006-06-27 | Kiyon, Inc. | System and method for identifying nodes in a wireless mesh network |
US20050201346A1 (en) * | 2003-05-13 | 2005-09-15 | Weilin Wang | Systems and methods for broadband data communication in a wireless mesh network |
US8780770B2 (en) * | 2002-05-13 | 2014-07-15 | Misonimo Chi Acquisition L.L.C. | Systems and methods for voice and video communication over a wireless network |
US7941149B2 (en) * | 2002-05-13 | 2011-05-10 | Misonimo Chi Acquistion L.L.C. | Multi-hop ultra wide band wireless network communication |
US7957356B2 (en) | 2002-05-13 | 2011-06-07 | Misomino Chi Acquisitions L.L.C. | Scalable media access control for multi-hop high bandwidth communications |
US7852796B2 (en) * | 2002-05-13 | 2010-12-14 | Xudong Wang | Distributed multichannel wireless communication |
GB2400195B (en) * | 2003-03-31 | 2005-06-29 | Micron Technology Inc | Active memory processing array topography and method |
US7379424B1 (en) * | 2003-08-18 | 2008-05-27 | Cray Inc. | Systems and methods for routing packets in multiprocessor computer systems |
US7937557B2 (en) * | 2004-03-16 | 2011-05-03 | Vns Portfolio Llc | System and method for intercommunication between computers in an array |
US20060172699A1 (en) * | 2005-02-01 | 2006-08-03 | Takashi Goto | Positioning system and method for positioning wireless terminals |
US7586888B2 (en) | 2005-02-17 | 2009-09-08 | Mobitrum Corporation | Method and system for mesh network embedded devices |
US7630736B2 (en) | 2005-10-11 | 2009-12-08 | Mobitrum Corporation | Method and system for spatial data input, manipulation and distribution via an adaptive wireless transceiver |
US7904615B2 (en) * | 2006-02-16 | 2011-03-08 | Vns Portfolio Llc | Asynchronous computer communication |
US7617383B2 (en) * | 2006-02-16 | 2009-11-10 | Vns Portfolio Llc | Circular register arrays of a computer |
US7966481B2 (en) | 2006-02-16 | 2011-06-21 | Vns Portfolio Llc | Computer system and method for executing port communications without interrupting the receiving computer |
US8305936B2 (en) | 2006-07-27 | 2012-11-06 | Mobitrum Corporation | Method and system for dynamic information exchange on a mesh network in a vehicle |
US7801058B2 (en) | 2006-07-27 | 2010-09-21 | Mobitrum Corporation | Method and system for dynamic information exchange on mesh network devices |
US8305935B2 (en) | 2006-07-27 | 2012-11-06 | Mobitrum Corporation | Method and system for dynamic information exchange on location aware mesh network devices |
US8411590B2 (en) | 2006-07-27 | 2013-04-02 | Mobitrum Corporation | Mesh network remote control device |
USRE47894E1 (en) | 2006-07-27 | 2020-03-03 | Iii Holdings 2, Llc | Method and system for dynamic information exchange on location aware mesh network devices |
US8427979B1 (en) | 2006-07-27 | 2013-04-23 | Mobitrum Corporation | Method and system for dynamic information exchange on location aware mesh network devices |
US8175613B2 (en) * | 2006-08-04 | 2012-05-08 | Misonimo Chi Acquisitions L.L.C. | Systems and methods for determining location of devices within a wireless network |
JP4861484B2 (en) * | 2006-12-07 | 2012-01-25 | ミソニモ チ アクイジションズ エル.エル.シー. | System and method for assigning time slots and channels |
US7555637B2 (en) * | 2007-04-27 | 2009-06-30 | Vns Portfolio Llc | Multi-port read/write operations based on register bits set for indicating select ports and transfer directions |
US20100023730A1 (en) * | 2008-07-24 | 2010-01-28 | Vns Portfolio Llc | Circular Register Arrays of a Computer |
US8543768B2 (en) | 2008-11-13 | 2013-09-24 | International Business Machines Corporation | Memory system including a spiral cache |
US8527726B2 (en) | 2008-11-13 | 2013-09-03 | International Business Machines Corporation | Tiled storage array with systolic move-to-front reorganization |
US8689027B2 (en) * | 2008-11-13 | 2014-04-01 | International Business Machines Corporation | Tiled memory power management |
KR101558172B1 (en) * | 2014-10-14 | 2015-10-08 | 숭실대학교산학협력단 | The method and device for interleaving for error distribution and the recording medium for performing the method |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4709327A (en) * | 1983-05-31 | 1987-11-24 | Hillis W Daniel | Parallel processor/memory circuit |
US5038386A (en) * | 1986-08-29 | 1991-08-06 | International Business Machines Corporation | Polymorphic mesh network image processing system |
US5170393A (en) * | 1989-05-18 | 1992-12-08 | California Institute Of Technology | Adaptive routing of messages in parallel and distributed processor systems |
US5103393A (en) * | 1990-06-29 | 1992-04-07 | Digital Equipment Corporation | Method of dynamically allocating processors in a massively parallel processing system |
JPH04106512A (en) | 1990-08-27 | 1992-04-08 | Canon Inc | Rear focus system variable power lens |
US5630162A (en) * | 1990-11-13 | 1997-05-13 | International Business Machines Corporation | Array processor dotted communication network based on H-DOTs |
US5689719A (en) | 1991-06-28 | 1997-11-18 | Sanyo Electric O., Ltd. | Parallel computer system including processing elements |
JPH0821910B2 (en) * | 1992-03-19 | 1996-03-04 | 日本電気株式会社 | Optical mesh coupling bus interconnection |
US5333279A (en) * | 1992-06-01 | 1994-07-26 | Intel Corporation | Self-timed mesh routing chip with data broadcasting |
US5495618A (en) * | 1992-08-26 | 1996-02-27 | Eastman Kodak Company | System for augmenting two dimensional data sets in a two dimensional parallel computer system |
US6173387B1 (en) * | 1994-05-11 | 2001-01-09 | Intel Corporation | Interleaved exchange in a network mesh |
-
1996
- 1996-12-23 US US08/773,262 patent/US6173387B1/en not_active Expired - Fee Related
-
2000
- 2000-07-24 US US09/624,287 patent/US6356992B1/en not_active Expired - Fee Related
-
2001
- 2001-06-12 US US09/879,030 patent/US6460128B1/en not_active Expired - Fee Related
-
2002
- 2002-07-02 US US10/188,956 patent/US6948048B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
US20030033500A1 (en) | 2003-02-13 |
US6356992B1 (en) | 2002-03-12 |
US6948048B2 (en) | 2005-09-20 |
US6173387B1 (en) | 2001-01-09 |
US6460128B1 (en) | 2002-10-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20020056023A1 (en) | Mesh network with method and apparatus for interleaved binary exchange | |
DE3533847C2 (en) | Deflecting packet switching switching matrix with internal packet transmission | |
US4739476A (en) | Local interconnection scheme for parallel processing architectures | |
DE69635834T2 (en) | High speed data network system and method | |
EP0371772B1 (en) | Memory accessing switch network | |
DE69633894T2 (en) | Modem for the communication of high-speed data | |
US7706361B2 (en) | Reconfigurable, fault tolerant, multistage interconnect network and protocol | |
US5751710A (en) | Technique for connecting cards of a distributed network switch | |
US20080183779A1 (en) | Method and System for Optimal Parallel Computing Performance | |
EP0514043A2 (en) | Computing system | |
EP0492174A2 (en) | Parallel processor | |
DE69735546T2 (en) | PACKAGE-LEADED GUIDANCE ARCHITECTURE FOR MULTIPLE SIMULTANEOUS CONNECTIONS | |
JPS61100046A (en) | Loop transmission method | |
US5039986A (en) | High speed dynamic allocator for various length time slots | |
DE102005062576B4 (en) | Electronic control device with a parallel data bus | |
JP2000020501A (en) | Parallel computer system and communication method between arithmetic processing units | |
JP3183484B2 (en) | Protocol processing device | |
US6745233B1 (en) | Data transfer technique for distributed memory type parallel computer | |
JPH08167909A (en) | Output buffer type atm switch | |
CN116488961B (en) | Public unit gateway, communication method and communication system | |
JP2749725B2 (en) | Communication method of parallel computer | |
JPH11212942A (en) | Interconnection net work method of large scale parallel processing computer system | |
DE4134012B4 (en) | A multi-node computer system and method for communicating information in a multi-node computer system | |
JPH02268046A (en) | Packet multiplexer | |
EP0398678B1 (en) | Optimized interconnect systems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20141001 |