Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories
Reexamination Certificate
2005-09-27
2005-09-27
Padmanabhan, Mano (Department: 2188)
Electrical computers and digital processing systems: memory
Storage accessing and control
Hierarchical memories
C711S154000, C711S167000, C712S237000, C710S052000
Reexamination Certificate
active
06950905
ABSTRACT:
A method may involve: receiving a request to perform a block write to a target device and data associated with the block write; buffering the data associated with the block write prior to completing the block write to the target device; storing an indication identifying a block address range of the block write; receiving a request to perform a read to the target device; and determining whether an address of the read is within the block address range of the block write identified by the indication. In some embodiments, such a method may allow the read to complete ahead of the block write dependent on whether the address of the read is within the block address range of the block write identified by the indication.
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: 5889974 (1999-03-01), Harriman 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: 6170063 (2001-01-01), Golding
patent: 6260095 (2001-07-01), Goodrum
patent: 6298407 (2001-10-01), Davis et al.
patent: 6324599 (2001-11-01), Zhou et al.
patent: 6453375 (2002-09-01), Derr et al.
patent: 6678804 (2004-01-01), Funatogawa et al.
patent: 0 785 512 (1997-07-01), None
patent: 99/26429 (1999-05-01), None
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 Biderectional Signally 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 Multicompter 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-29, San Diego, 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.
Song Jasmine
Sun Microsystems Inc.
LandOfFree
Write posting memory interface with block-based read-ahead... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Write posting memory interface with block-based read-ahead..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Write posting memory interface with block-based read-ahead... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3389701