Method and apparatus for simulating m-dimension connection netwo

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364229, 3642294, 3642383, 3642591, 364284, 3642844, G06F 1320

Patent

active

050500694

ABSTRACT:
In accordance with the invention, each element or mode in the n-dimensional connection pattern is assigned a unique binary number or address by numbering the elements. Next, the individual binary digits of the address associated with each element are assigned to the different dimensions of the connection pattern of m dimension according to a fixed rule. Each set of binary digits that is so assigned to a dimension is then treated as the address of the node in that dimension in a gray code space; and the nodes that are its nearest neighbors in that dimension are those nodes that bear the Gray code values immediately before it and immediately after it in the Gray code sequence. Data are then routed to the nearest neighbor in one direction in a dimension by forwarding them from one node to the node bearing the next succeeding (or preceding) Gray code address and a node can be conditioned to receive such data by having it look for data from the node with the next preceding (or succeeding) address.

REFERENCES:
patent: 4065808 (1977-12-01), Schomberg et al.
patent: 4523273 (1985-06-01), Adams, III et al.
patent: 4598400 (1986-07-01), Hillis
patent: 4639857 (1987-01-01), McCanny et al.
patent: 4644496 (1987-02-01), Andrews
patent: 4709327 (1987-11-01), Hillis et al.
patent: 4727474 (1988-02-01), Batcher
patent: 4739476 (1988-04-01), Fiduccia
E. N. Gilbert, "Gray Codes and Paths on the N-Cube.", The Bell System Technical Journal (May 1958), pp. 815-826.
Martin Gardner, "The Binary Gray Code." In: Knotted Doughnuts and Other Mathematical Entertainments, W. H. Freeman and Company, New York, (pp. 11-27).
W. Lin et al., "Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor.", IEEE Transactions on Computers, vol. C-35, No. 10, (Oct. 1986), pp. 910-915.
T. Bartee, "Read-Only Memories", in: T. Bartee Digital Computer Fundamentals (New York, McGraw-Hill Book Company, 1977), pp. 316-318.
H. Taub et al., "The Grey Reflected Binary Code", in: H. Taub et al., Digital Integrated Electronics (New York, McGraw-Hill, Inc., 1977), pp. 106-107.
F. P. Preparata et al., "The Cube-Connected Cycles: A Versatile Network Parallel Computation", Communications of the ACM, vol. 24, No. 5, (May 1981), pp. 300-309.
NCR Handbook (NCR45CG72), "Geometric Arithmetic Parallel Processor", 1st Ed., Dayton, Ohio, NCR Corporation, 1984, pp. 1-12.
NCR Handbook (NCR45CG72 GAPP Application Note No. 3), "Detection of Edges and Gradients in Binary and Gray Scale Images with the Gapp Processor", 1st ed., Dayton, Ohio, NCR Corporation, 1985, pp. 1-23.
L. Adams, "Modeling Algorithm Execution Lime on Processor Arrays.", IEEE Computer (Jul. 1984), pp. 38-43.
R. Asbury et al., "Concurrent Computers for Inherently Parallel Problems", Computer Design (Sep. 1, 1985), pp. 99-102, 104, 106, 107.
K. Batcher, "Design of a Massively Parallel Processor", IEEE Transactions on Computers, vol. C-29, No. 9 (Sep. 1980), pp. 836-840.
T. Hoshino t al., "An Invitation to the World of PAX", IEEE, Computer (May 1986), pp. 68-79.
C. Seitz, "The Cosmic Cube", Communications of the ACM, vol. 28, No. 1, (Jan. 1985), pp. 22-33.

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

Method and apparatus for simulating m-dimension connection netwo does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for simulating m-dimension connection netwo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for simulating m-dimension connection netwo will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1921947

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