Direct memory access in a hybrid computing environment

Electrical computers and digital data processing systems: input/ – Input/output data processing – Direct memory accessing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C710S008000, C710S015000, C710S033000, C710S052000

Reexamination Certificate

active

08010718

ABSTRACT:
Direct memory access (‘DMA’) in a hybrid computing environment that includes a host computer, an accelerator, the host computer and the accelerator adapted to one another for data communications by a system level message passing module, where DMA includes identifying, by the system level message passing module, a buffer of data to be transferred from the host computer to the accelerator according to a DMA protocol; segmenting, by the system level message passing module, the buffer of data into a predefined number of memory segments; pinning, by the system level message passing module, the memory segments against paging; and asynchronously with respect to pinning the memory segments, effecting, by the system level message passing module, DMA transfers of the pinned memory segments from the host computer to the accelerator.

REFERENCES:
patent: 4989131 (1991-01-01), Stone
patent: 5363484 (1994-11-01), Desnoyers et al.
patent: 5467459 (1995-11-01), Alexander et al.
patent: 5590345 (1996-12-01), Barker et al.
patent: 5613146 (1997-03-01), Gove et al.
patent: 6010194 (2000-05-01), Yu et al.
patent: 6266745 (2001-07-01), De Backer et al.
patent: 6377979 (2002-04-01), Yamashita et al.
patent: 6473849 (2002-10-01), Keller et al.
patent: 6598130 (2003-07-01), Harris et al.
patent: 7383330 (2008-06-01), Moran et al.
patent: 7418574 (2008-08-01), Mathur et al.
patent: 7469273 (2008-12-01), Anderson et al.
patent: 7631023 (2009-12-01), Kaiser et al.
patent: 7668924 (2010-02-01), Young et al.
patent: 7814295 (2010-10-01), Inglett et al.
patent: 2002/0056033 (2002-05-01), Huppenthal
patent: 2002/0108059 (2002-08-01), Canion et al.
patent: 2003/0061432 (2003-03-01), Huppenthal et al.
patent: 2003/0226018 (2003-12-01), Tardo et al.
patent: 2006/0018341 (2006-01-01), Pettey et al.
patent: 2006/0168435 (2006-07-01), Svensson et al.
patent: 2007/0255802 (2007-11-01), Aloni et al.
patent: 2008/0183882 (2008-07-01), Flynn et al.
patent: 2008/0256330 (2008-10-01), Wang et al.
patent: 2008/0259086 (2008-10-01), Doi et al.
patent: 2009/0024734 (2009-01-01), Merbach et al.
patent: 2009/0080428 (2009-03-01), Witkowski et al.
patent: 2009/0110326 (2009-04-01), Kim et al.
patent: 2010/0153541 (2010-06-01), Arimilli et al.
Rabenseifner, Rolf, Some Aspects of Message-Passing on Future Hybrid Systems, www.springerlink.com [online], 2008 [accessed online on Nov. 12, 2010], URL: http://www.springerlink.com/content/m12170217065w185/.
Ball, Stuard, Introduction to direct memory access, www.eetimes.com [online], Oct. 14, 2003 [accessed online on Nov. 12, 2010], URL: http://www.eetimes.com/discussion/other/4024879/Introduction-to-direct-memory-access.
U.S. Appl. No. 12/204,842, filed Sep. 2008, Aho et al.
U.S. Appl. No. 12/204,352, filed Sep. 2008, Aho et al.
U.S. Appl. No. 12/204,391, filed Sep. 2008, Aho et al.
U.S. Appl. No. 12/189,342, filed Aug. 2008, Carey et al.
U.S. Appl. No. 12/358,663, filed Jan. 2009, Archer et al.
U.S. Appl. No. 12/699,162, filed Feb. 2010, Archer et al.
U.S. Appl. No. 12/362,137, filed Jan. 2009, Archer et al.
U.S. Appl. No. 12/359,383, filed Jan. 2009, Archer et al.
U.S. Appl. No. 12/361,943, filed Jan. 2009, Archer et al.
U.S. Appl. No. 12/360,930, filed Jan. 2009, Carey et al.
U.S. Appl. No. 12/364,590, filed Feb. 2009, Archer et al.
U.S. Appl. No. 12/360,158, filed Jan. 2009, Carey et al.
U.S. Appl. No. 12/537,377, filed Aug. 2009, Aho et al.
U.S. Appl. No. 12/361,910, filed Jan. 2009, Archer et al.
U.S. Appl. No. 12/428,646, filed Apr. 2009, Arroyo et al.
U.S. Appl. No. 12/771,627, filed Apr. 2010, Aho et al.
Buonadonna, Phillip, Culler, David, “Queue Pair IP: A Hybrid Architecture for System Area Networks”, Aug. 7, 2002. Computer Architecture. 2002. Proceedinas. 29th Annual Symposium. pp. 247-256.
Brightwell, Rin, Doerfler, Doug, Underwood D., Keith, “A Preliminary Analysis of the Infiniband and XD1 Network Interfaces”, Jun. 26, 2006, Parallel and Distribution Processing Symposium, 2006. IPDPS 2006. 20th International, p. 8.
Office Action, U.S. Appl. No. 12/189,342, filed Aug. 11, 2008.
Rexford, Jennifer, Bonomi Flavio; Greenberg Albert, Wong Albert, “Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches”, Jun. 5, 1997, IEEE Journal on Selected Areas in Communications, vol. 15 No. 5, pp. 938-950.
Rabenseifner, Rolf, Some Aspects of Message-Passing on Future Hybrid Systems, www.springerlink.com [online], 2008 [accessed online on Nov. 12, 2010], URL: http://www.springerlink.com/content/m12170217065w185/.
Ball, Stuard, Introduction to direct memory access, www.eetimes.com [online], Oct. 14, 2003 [accessed online on Nov. 12, 2010], URL: http;//www.eetimes.com/discussion/other/4024879/introduction-to-direct-memory-access.
Office Action, U.S. Appl. No. 12/204,352, filed Dec. 16, 2010.
Final Office Action, U.S. Appl. No. 12/189,342, filed Dec. 23, 2010.
Office Action, U.S. Appl. No. 12/362,137, filed Nov. 22, 2010.
Office Action, U.S. Appl. No. 12/364,590, filed Nov. 26, 2010.
Office Action, U.S. Appl. No. 12/361,910, filed Nov. 19, 2010.

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

Direct memory access in a hybrid computing environment does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Direct memory access in a hybrid computing environment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Direct memory access in a hybrid computing environment will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2769438

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