WASHINGTON TAYLOR
Architects in Cambridge, MA

License number
Massachusetts 4101
Expiration Date
Aug 31, 2004
Type
Architect
Address
Address
Cambridge, MA 02138

Professional information

Washington Taylor Photo 1

Computer System And Method Using A Kautz-Like Digraph To Interconnect Computer Nodes And Having Control Back Channel Between Nodes

US Patent:
7751344, Jul 6, 2010
Filed:
Nov 8, 2006
Appl. No.:
11/594423
Inventors:
Judson S. Leonard - Newton MA, US
Matthew H. Reilly - Stow MA, US
Lawrence C. Stewart - Wayland MA, US
Washington Taylor - Cambridge MA, US
Assignee:
SiCortex, Inc. - Maynard MA
International Classification:
H04L 12/28
US Classification:
370255, 370230, 370231, 370235, 370236, 370237, 370254, 709220, 709221, 709222, 709225, 709226, 709227, 709228, 709229
Abstract:
Computer system and method using a Kautz-like digraph to interconnect computer nodes and having control back channel between nodes. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)k; The data interconnections from a node x to a node y in the topology satisfy the relationship y=(−x*k−j) mod O, where 1≦j≦k; and each x,y pair includes a unidirectional control link from node y to node x to convey flow control and error information from a receiving node y to a transmitting node x.


Washington Taylor Photo 2

Computer System And Method Using Efficient Module And Backplane Tiling To Interconnect Computer Nodes Via A Kautz-Like Digraph

US Patent:
2008012, May 29, 2008
Filed:
Nov 8, 2006
Appl. No.:
11/594416
Inventors:
Judson S. Leonard - Newton MA, US
Matthew H. Reilly - Stow MA, US
Lawrence C. Stewart - Wayland MA, US
Washington Taylor - Cambridge MA, US
International Classification:
G06F 15/173
US Classification:
709252
Abstract:
Computer systems and methods using efficient module and backplane tiling to interconnect computer nodes via a Kautz-like digraph. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)k. The interconnections from a node x to a node y in the topology satisfy the relationship y=(−x*k−j) mod O, where 1≦j≦k, and the computing nodes are arranged onto a plurality of modules. Each module has an equal plurality of computing nodes on it. A majority of the inter-node connections are contained on the plurality of modules and a minority of the inter-node connections are inter-module connections. Inter-module connections are routed among modules in parallel on an inter-module connection plane.