Optimizing batch size for prefetching data over wide area...

Electrical computers and digital processing systems: multicomput – Remote data accessing – Using interconnected networks

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S233000, C710S036000

Reexamination Certificate

active

07984112

ABSTRACT:
A data prefetching technique optimizes the batch size of prefetch requests. The optimized batch size may be determined based on a prefetch transfer time of a previous prefetch operation, where the prefetch transfer time is measured as an elapsed time interval from when data from the previous prefetch operation is first received to when the data from the previous prefetch operation is finished being received.

REFERENCES:
patent: 5541919 (1996-07-01), Yong et al.
patent: 6557055 (2003-04-01), Wiese
patent: 6963954 (2005-11-01), Trehus et al.
patent: 7359890 (2008-04-01), Ku et al.
patent: 2001/0048728 (2001-12-01), Peng
patent: 2002/0091722 (2002-07-01), Gupta et al.
Co-pending U.S. Appl. No. 11/495,599, filed Jul. 31, 2006, An-Cheng Huang, entitled “Optimizing Batch Size for Prefetching Data Over Wide Area Networks.”
“Using Predictive Prefetching to Improve World Wide Web Latency,” Venkata N. Padmanabhan and Jeffrey C. Mogul, ACM SIGCOMM Computer Communication Review, vol. 26, Issue 3, Jul. 1996.
“The Network Effects of Prefetching,” Mark Crovella and Paul Barford, Proceedings of IEEE INFOCOMM '98, Mar. 1998.
“A Fast File System for UNIX,” Marshall K. McKusick, William N. Joy, Samuel J. Leffler, and Robert S. Fabry, ACM Transactions on Computer Systems, vol. 2, Issue 3, Aug. 1984.
“An Adaptive Network Prefetch Scheme,” Zhimei Jiang and Leonard Kleinrock, IEEE Journal on Selected Areas of Communications, vol. 16, Issue 3, Apr. 1998.
“NPS: A Non-interfering Deployable Web Prefetching System,” Ravi Kokku, Praveen Yalagandula, Arun Venkataramani and Mike Dahlin, Proceedings of the 4thUSENIX Symposium on Internet Technologies and Systems, Mar. 2003.
“The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms,” Ali R. Butt, Chris Gniady and Y. Charlie Hu, Proceedings of ACM SIGMETRICS '05, Jun. 2005.
“Informed Prefetching and Caching,” Patterson, R.H., Gibson, G.A., Ginting, E., Stodolsky, D. and Zelenka, J., Proceedings of the 15thACM Symposium of Operating Systems Principles, Dec. 1995.
“A Cost-Benefit Scheme for High Performance Predictive Prefetching,” Vivekanand Vellanki and Ann Chervenak, Proceedings of ACM/IEEE Supercomputing '99, 1999.
“Performance Measurements of Automatic Prefetching,” J. Griffioen and R. Appleton, Proceedings of the ISCA, International Conference on Parallel and Distributed Computing Systems, Sep. 1995.
“Implementation and Performance of Integrated Application-Controlled File Caching, Prefetching and Disk Scheduling,” Pei Cao, Edward W. Felten, Anna R. Karlin and Kai Li, ACM Transactions on Computer Systems, vol. 14, No. 4, Nov. 1996.
“Prefetching over a Network: Early Experience with CTIP,” David Rochberg and Garth Gibson, ACM SIGMETRICS Performance Evaluation Review, vol. 25, Issue 3, Dec. 1997.
“NFS over RDMA,” Brent Callaghan, Theresa Lingutla-Raj, Alex Chiu, Peter Staubach and Omer Asad, Proceedings of ACM SIGCOMM 2003 Workshop on Network-I/O Convergence: Experience, Lessons, Implications, Aug. 2003.

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

Optimizing batch size for prefetching data over wide area... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing batch size for prefetching data over wide area..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing batch size for prefetching data over wide area... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2725948

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