Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2006-11-08
2010-02-09
Sheikh, Ayaz R (Department: 2419)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S254000, C370S203000
Reexamination Certificate
active
07660270
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)kn−1. 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.
REFERENCES:
patent: 5134690 (1992-07-01), Samatham
patent: 5513371 (1996-04-01), Cypher et al.
patent: 6721311 (2004-04-01), Samsudin et al.
patent: 2006/0056308 (2006-03-01), Gusat et al.
Samatham, M. and Pradhan, D. “The De Bruijn Multiprocessor Network: A versatile Parallel Processing and Sorting Network for VLSI”. IEEE Transactions on Computers, vol. 38, No. 4, Apr. 1989.
Panchapakesan, G. and Sengupta, A. “On Multihop Optical Network Topology using Kautz Digraphs”. IEEE Xplore. University of South Carolina. Copyright 1995 IEEE.
Samatham, M. and Pradhan, D. “The De Bruijn Multiprocessor Netowrk: A Versatile Parallel Processing and Sorting Network for VLSI”. IEEE Transactions on Computers, vol. 38, No. 4, Apr. 1989.
Liu, Guoping and Lee, Y. “Optimal Routing Algorithsm for Generalized de Bruijn Digraphs”. Parallel Processing, 1993. ICPP 1993. International Conference on Parallel Processing. vol. 3, Aug. 16-20, 1993, pp. 167-174.
Smit, “An Algorithm for Generating Node Disjoint Routes in Kautz Diagraphs,” IEEE, 1991, pp. 102-107.
International Search Report for PCT/US07/82851 mailed Mar. 26, 2008.
Leonard Judson S.
Reilly Matthew H.
Stewart Lawrence C.
Taylor Washington
Chapin IP Law LLC
Chau Peter
Sheikh Ayaz R
SiCortex, Inc.
LandOfFree
Computer system and method using efficient module and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer system and method using efficient module and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer system and method using efficient module and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4195158