Scalable direct memory access using validation of host and...

Details Scalable direct memory access using validation of host and... Scalable direct memory access using validation of host and...

2005-05-24

2010-11-09

Kindred, Alford W (Department: 2181)

Electrical computers and digital data processing systems: input/

Input/output data processing

Direct memory accessing

Reexamination Certificate

active

07831745

ABSTRACT:
A host station and a scatter gather engine (SGE) station communicate with each other. In the host station, a host generation indication is maintained. In the SGE station, an SGE generation indication is maintained. Information, including the host generation indication maintained in the host station, is written into an entry of a data structure in a memory associated with the host station. In the SGE station, information is received from each of at least one of the entries of the data structure. The received information is processed, including comparing the SGE generation indication maintained in the SGE station to the host generation indication in the entry to determine whether the information in that entry includes valid information.

REFERENCES:
patent: 4445116 (1984-04-01), Grow
patent: 4533996 (1985-08-01), Hartung et al.
patent: 5497476 (1996-03-01), Oldfield et al.
patent: 5778189 (1998-07-01), Kimura et al.
patent: 6087581 (2000-07-01), Emmer et al.
patent: 6226680 (2001-05-01), Boucher et al.
patent: 6240094 (2001-05-01), Schneider
patent: 6247060 (2001-06-01), Boucher et al.
patent: 6334153 (2001-12-01), Boucher et al.
patent: 6389479 (2002-05-01), Boucher et al.
patent: 6393487 (2002-05-01), Boucher et al.
patent: 6397316 (2002-05-01), Fesas, Jr.
patent: 6401177 (2002-06-01), Koike
patent: 6427171 (2002-07-01), Craft et al.
patent: 6427173 (2002-07-01), Boucher et al.
patent: 6434620 (2002-08-01), Boucher et al.
patent: 6470415 (2002-10-01), Starr et al.
patent: 6510164 (2003-01-01), Ramaswamy et al.
patent: 6591302 (2003-07-01), Boucher et al.
patent: 6594268 (2003-07-01), Aukia et al.
patent: 6625671 (2003-09-01), Collette et al.
patent: 6658480 (2003-12-01), Boucher et al.
patent: 6681244 (2004-01-01), Cross et al.
patent: 6687758 (2004-02-01), Craft et al.
patent: 6697868 (2004-02-01), Craft et al.
patent: 6708223 (2004-03-01), Wang et al.
patent: 6708232 (2004-03-01), Obara
patent: 6717946 (2004-04-01), Hariguchi et al.
patent: 6751665 (2004-06-01), Philbrick et al.
patent: 6757245 (2004-06-01), Kuusinen et al.
patent: 6757746 (2004-06-01), Boucher et al.
patent: 6798743 (2004-09-01), Ma et al.
patent: 6807581 (2004-10-01), Starr et al.
patent: 6813652 (2004-11-01), Stadler et al.
patent: 6862648 (2005-03-01), Yatziv
patent: 6941386 (2005-09-01), Craft et al.
patent: 7031267 (2006-04-01), Krumel
patent: 7093099 (2006-08-01), Bodas et al.
patent: 7114096 (2006-09-01), Freimuth et al.
patent: 7133902 (2006-11-01), Saha et al.
patent: 7133914 (2006-11-01), Holbrook
patent: 7191318 (2007-03-01), Tripathy et al.
patent: 7239642 (2007-07-01), Chinn et al.
patent: 7254637 (2007-08-01), Pinkerton et al.
patent: 7260631 (2007-08-01), Johnson et al.
patent: 7284047 (2007-10-01), Barham et al.
patent: 7313623 (2007-12-01), Elzur et al.
patent: 7376147 (2008-05-01), Seto et al.
patent: 7408906 (2008-08-01), Griswold et al.
patent: 2001/0010046 (2001-07-01), Muyres et al.
patent: 2001/0021949 (2001-09-01), Blightman et al.
patent: 2001/0036196 (2001-11-01), Blightman et al.
patent: 2001/0037406 (2001-11-01), Philbrick et al.
patent: 2002/0039366 (2002-04-01), Sano
patent: 2002/0087732 (2002-07-01), Boucher et al.
patent: 2002/0091844 (2002-07-01), Craft et al.
patent: 2002/0095519 (2002-07-01), Philbrick et al.
patent: 2002/0156927 (2002-10-01), Boucher et al.
patent: 2002/0161919 (2002-10-01), Boucher et al.
patent: 2003/0018516 (2003-01-01), Ayala et al.
patent: 2003/0035436 (2003-02-01), Denecheau et al.
patent: 2003/0140124 (2003-07-01), Burns
patent: 2003/0200284 (2003-10-01), Philbrick et al.
patent: 2004/0003094 (2004-01-01), See
patent: 2004/0003126 (2004-01-01), Boucher et al.
patent: 2004/0030745 (2004-02-01), Boucher et al.
patent: 2004/0054813 (2004-03-01), Boucher et al.
patent: 2004/0062245 (2004-04-01), Sharp et al.
patent: 2004/0062246 (2004-04-01), Boucher et al.
patent: 2004/0064578 (2004-04-01), Boucher et al.
patent: 2004/0064589 (2004-04-01), Boucher et al.
patent: 2004/0064590 (2004-04-01), Starr et al.
patent: 2004/0073703 (2004-04-01), Boucher et al.
patent: 2004/0078480 (2004-04-01), Boucher et al.
patent: 2004/0088262 (2004-05-01), Boucher et al.
patent: 2004/0100952 (2004-05-01), Boucher et al.
patent: 2004/0111535 (2004-06-01), Boucher et al.
patent: 2004/0117509 (2004-06-01), Craft et al.
patent: 2004/0158640 (2004-08-01), Philbrick et al.
patent: 2004/0165592 (2004-08-01), Chen et al.
patent: 2004/1058793 (2004-08-01), Blightman et al.
patent: 2004/0190533 (2004-09-01), Modi et al.
patent: 2004/0199808 (2004-10-01), Freimuth et al.
patent: 2004/0213235 (2004-10-01), Marshall et al.
patent: 2004/0240435 (2004-12-01), Craft et al.
patent: 2005/0071490 (2005-03-01), Craft et al.
patent: 2005/0120037 (2005-06-01), Maruyama et al.
patent: 2005/0122986 (2005-06-01), Starr et al.
patent: 2005/0135378 (2005-06-01), Rabie et al.
patent: 2005/0135412 (2005-06-01), Fan
patent: 2005/0147126 (2005-07-01), Qiu et al.
patent: 2005/0190787 (2005-09-01), Kuik et al.
patent: 2005/0216597 (2005-09-01), Shah et al.
patent: 2005/0259678 (2005-11-01), Gaur
patent: 2005/0289246 (2005-12-01), Easton et al.
patent: 2006/0039413 (2006-02-01), Nakajima et al.
patent: 2006/0080733 (2006-04-01), Khosmood et al.
patent: 2006/0133267 (2006-06-01), Alex et al.
patent: 2006/0206300 (2006-09-01), Garg et al.
patent: 2006/0209693 (2006-09-01), Davari et al.
patent: 2006/0221946 (2006-10-01), Shalev et al.
patent: 2006/0281451 (2006-12-01), Zur
patent: 2007/0064737 (2007-03-01), Williams
patent: 2007/0110436 (2007-05-01), Bennett
patent: 2008/0002731 (2008-01-01), Tripathy et al.
patent: 2008/0232386 (2008-09-01), Gorti et al.
Clark et al., “An Analysis of TCP Processing Overhead,” IEEE Communications Magazine, Jun. 1989, pp. 23-29.
Woodside et al., “The Protocol Bypass Concept for High Speed OSI Data Transfer,” Research Paper. Available at:http://citeseer.ist.psu.edu/cache/papers/cs/26104/http:zSzzSzwww.sce.carleton.cazSzftpzSzpubzSzcmwzSzbpjan90.pdf/woodside90protocol.pdf.
Rütsche et al., “TCP/IP on the Parallel Protocol Engine,” High Performace Networking, (IV, C-14), Elsevier Science Publishers, B.V. North Holland 1993.
Thia et al., “High-Speed OSI Protocol Bypass Algorithm with Window Flow Control,” IFIP WG6.4 Third International Workshop on Protocols for High-Speed Networks, Stockholm, Sweden, May 13-15, 1992, pp. 53-68.
Thia et al., “A Reduced Operation Protocol Engine(ROPE)for a Multiple-Layer Bypass Architecture,” Protocols for High-Speed Networks IV, 4th IFIP International Workshop, Aug. 10-12, 1994, Vancouver, B.C., Canada, pp. 224-239.
Rütsche et al., “Architectures of Multimedia Communication Subsystems,” IFIP Transactions; vol. C-23 archive, Proceedings of the IFIP TC6 International Conference on Information Networks and Data Communication table of contents, pp. 217-230, Year of Publication: 1994.
Dalton et al., “Afterburner: Architectural Support for High-Performance Protocols,” http://www.hpl.hp.com/techreports/93/HPL-93-46.pdf, Jul. 1993, 18 pages.
TRM Technologies, Inc., “L4/L7 Switching,” Downloaded from http://www.trm.ca/pages/t-tech7.html on Feb. 16, 2006, 3 pages.
Madsen et al., “Wireless Data Communication,” Fall 2003 Presentation, Wireless Networks Division (WING), Allborg University.
Yocum et al., “Anypoint: Extensible Transport Switching on the Edge,” Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, Mar. 26-28, 2003, Seattle, WA, USA.
International Search Report in PCT/US02/12679, dated Jul. 23, 2002.
Office Action in U.S. Appl. No. 10/474,500, mailed Oct. 4, 2007.
Office Action in U.S. Appl. No. 11/137,146, mailed Mar. 5, 2008.
Office Action in U.S. Appl. No. 11/250,894, mailed Jun. 26, 2008.
Notice of Allowance in U.S. Appl. No. 10/474,500, mailed Jul. 1, 2008.
Allowed Claims from U.S. Appl. No. 10/474,500.
Office Action in U.S. Appl. No. 11/217,661, mailed Sep. 18, 2008.
Office Action in U.S. Appl. No. 11/313,003, mailed Aug. 22, 2008.
Office Action in U.S. Appl. No. 11/330,89

Affiliated with

Also associated with

Rating

Scalable direct memory access using validation of host 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 Scalable direct memory access using validation of host and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable direct memory access using validation of host and... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4251170