Multiplex communications – Communication techniques for information carried in plural... – Combining or distributing information via time channels
Reexamination Certificate
2008-01-29
2008-01-29
Pham, Chi (Department: 2616)
Multiplex communications
Communication techniques for information carried in plural...
Combining or distributing information via time channels
C370S230100, C370S364000, C370S474000, C710S052000, C710S310000
Reexamination Certificate
active
10369795
ABSTRACT:
A method may involve: receiving an even number of odd-sized packets for transmission over a double data rate link; re-packetizing the even number of odd-sized packets into several even-sized packets; transmitting the even-sized packets over the double data rate link; and de-packetizing the even-sized packets to reform the even number of odd-sized packets. Re-packetizing may involve dividing each of the even number of odd-sized packets into an even-sized portion and a remaining portion. Each even-sized portion may be transferred as one of the even-sized packets. The remaining portions of each of the even number of odd-sized packets may be combined to form another one of even-sized packets. De-packetizing may involve associating each of several portions of one of the even-sized packets with a respective other one of the even-sized packets.
REFERENCES:
patent: 5689646 (1997-11-01), Thorson
patent: 5689661 (1997-11-01), Hayashi et al.
patent: 5701416 (1997-12-01), Thorson et al.
patent: 5720025 (1998-02-01), Wilkes et al.
patent: 5737628 (1998-04-01), Birrittella et al.
patent: 5970232 (1999-10-01), Passint et al.
patent: 6016510 (2000-01-01), Quattromani et al.
patent: 6023753 (2000-02-01), Pechanek et al.
patent: 6055618 (2000-04-01), Thorson
patent: 6101181 (2000-08-01), Passint et al.
patent: 6167502 (2000-12-01), Pechanek et al.
patent: 6337830 (2002-01-01), Faue
patent: 6356544 (2002-03-01), O'Connor
patent: 6741562 (2004-05-01), Keirouz et al.
patent: 6854117 (2005-02-01), Roberts
patent: 2003/0095559 (2003-05-01), Sano et al.
patent: 2003/0165158 (2003-09-01), Davies et al.
patent: 2004/0090920 (2004-05-01), Wang
patent: 0 785 512 (1997-07-01), None
patent: 1420409 (2004-05-01), None
patent: 99/26429 (1999-05-01), None
Kim, C.H. et al., “A 64-Mbit, 640-MByte/s Bidirectional Data Strobed, Double-Data-Rate SDRAM With a 40-mW DLL for a 256-MByte Memory System,” IEEE Journal on Solid-State Circuits, Nov. 1998. vol. 33, iss. 11, pp. 1703-1710.
Bradley Kuszmaul, Mercury Computer Systems, Inc., “The RACE Network Architecture,” (posted at www.mc.com/techlit/#tech—brief prior to this), 6 pages.
R.Y. Wang, T.E. Anderson and D.A. Patterson, “Virtual Log Based File Systems For a Programmable Disk,” Proc. Third Symposium on Operating Systems Design and Implementation, Feb. 1999 (Also appeared as University of California Technical Report CSD-98-1031, 16 pages.
Prasant Mohapatra, Wormhole Routing Techniques for Directly Connected Multicomputer Systems, ACM Computing Surveys, vol. 30, No. 3, Sep. 1998, 37 pages.
Christopher Glass and Lionel Ni, “The Turn Model for Adaptive Routing,” Journal of the Association for Computing Machinery, vol. 41, No. 5, Sep. 1994, pp. 874-902.
Reddy, Dept. of Computer & Information Sciences, “A Dynamically Reconfigurable WDM LAN Based on Reconfigurable Circulant Graph,” IEEE, 1996, 4 pages.
Various Abstracts beginning with Funahashi, Jouraku and Amano, “Adaptive Routing for Recursive Diagonal Torus,” Transactions of the Institute of Electronics, Information and Communication Engineers D-I, vol. J83D-I, No. 11, Nov. 2000, pp. 1143-1153.
Milan Kovacevic, Center for Telecommunications Research, “On Torus Topologies with Random Extra Links,” IEEE 1996, pp. 410-418.
Dally, et al., The Torus Routing Chip, Distributed Computing, Springer-Verlag 1986, pp. 187-196.
Susan Hinrichs, “A Compile Time Model for Composing Parallel Programs,” IEEE Parallel and Distributed Technology, 1995, 19 pages.
“CRAY T3D System Architecture Overview Manual,” ftp://ftp.cray.com/product-info/mpp/T3D—Architecture—Over/T3D.overview.html, Cray Research, 1993, 40 pages.
Marco Fillo, et al., “The M-Machine Multicomputer,” Laboratory for Computer Science, Massachusetts Institute of Technology, A.I. Memo No. 1532, Ann Arbor,. Mar. 1995, 14 pages.
Noakes, et al., “The J-Machine Multicomputer: An Architectural Evaluation,” Proceedings of the 20thInternational Symposium on Computer Architecture, May 1993, 12 pages.
Dally, et al., “Architecture of a Message-Driven Processor,” International Conference on Computer Architecture, Jun. 1987, pp. 189-196.
Dennison, Lee and Dally, “High-Performance Bidirectional Signalling in VLSI,” Massachusetts Institute of Technology, Oct. 12, 1992, 20 pages.
Dally, et al., “Architecture and Implementation of the Reliable Router,” Mass. Institute of Technology, Proceedings of Hot Interconnects II, Stanford CA, Aug. 1994, 12 pages.
Dally, et al., “The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers,” Proceedings of the First International Parallel Computer Routing and Communication Workshop, Seattle WA, May 1994, 15 pages.
Dennison, et al., “Low-Latency Plesiochronous Data Retiming,” Mass. Institute of Technology, Proceedings of the 1995 Advanced Research in VLSI Conference, Chapel Hill NC, Mar. 1995, 12 pages.
Whay S. Lee, “Mechanism for Efficient, Protected Messaging,” Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, Jan. 20, 1999, 147 pages.
Dennison, “Reliable Interconnect Networks for Parallel Computers,” Mass. Institute of Technology, Dept. of Electrical Engineering and Computer Science, Apr. 18, 1991, 79 pages.
Thucydides Xanthopoulos, “Fault Tolerant Adaptive Routing in Multicomputer Networks,” Dept. of Electrical Engineering and Computer Science , Mass. Institute of Technology, Jan. 20, 1995, 152 pages.
Dennison, “The Reliable Router: An Architecture for Fault Tolerant Interconnect,” Dept. of Electrical Engineering and Computer Science, Mass Institute of Technology, May 24, 1996, 145 pages.
“Introduction To Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes,” F. Thomson Leighton, Morgan Kaufmann Publishers, 1992, pp. 1-831.
Christopher J. Glass and Lionel Ni, “Fault-Tolerant Wormhole Routing in Meshes,” Technical Report, MSU-CPS-ACS-72, Oct. 30, 1992 (revised May 25, 1993), 28 pages.
Stefan Savage and John Wilkes, “AFRAID-A Frequently Redundant Array of Independent Disks,” Proceedings of the 1996 USENIX Technical Conference, pp. 27-39, San Diego, CA, Jan. 1996, 13 pages.
Steve Ward, et al., “A Modular, Scalable Communications Substrate,” MIT Laboratory for Computer Science, Jul. 1993, 10 pages.
Christopher Glass and Lionel Ni, “The Turn Model for Adaptive Routing,” Technical Reports, MSU-CPS-ACS-44, Oct. 10, 1991 (revised Mar. 2, 1992), pp. 278-287 (numbered herein as 1-20).
Thomas Stricker, “Message Routing on Irregular 2D-Meshes and Tori,” School of Computer Science, Carnegie Mellon Univ., Jan. 15, 1991, pp. 170-177 (numbered herein as 1-19).
Dally, et al., “The J-Machine: A Restrospective,” in 25 Years of the International Symposia on Computer Architecture-Selected Papers. pp. 54-58.
Acton John D.
Nixon Walter T.
Wu Chia Y.
Kowert Robert C.
Meyertons Hood Kivlin Kowert & Goetzel P.C.
Mills Donald L
Pham Chi
Sun Microsystems Inc.
LandOfFree
Transmitting odd-sized packets over a double data rate link does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Transmitting odd-sized packets over a double data rate link, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transmitting odd-sized packets over a double data rate link will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3910415