Isolated ordered regions (IOR) prefetching and page replacement

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S159000, C707S793000

Reexamination Certificate

active

10604453

ABSTRACT:
The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order. Access patterns and usage are used to recognize and prefetch pages. The probability of revisiting traversed nodes are identified and pages in a bufferpool are replaced based upon the identified probabilities (e.g., replacing pages with the least probability of a revisit).

REFERENCES:
patent: 5485609 (1996-01-01), Vitter et al.
patent: 5809563 (1998-09-01), Yamada et al.
patent: 5897660 (1999-04-01), Reinders et al.
patent: 6026474 (2000-02-01), Carter et al.
patent: 6067565 (2000-05-01), Horvitz
patent: 6081799 (2000-06-01), Beavin et al.
patent: 6085193 (2000-07-01), Malkin et al.
patent: 6154813 (2000-11-01), Martin et al.
patent: 6307548 (2001-10-01), Flinchem et al.
patent: 6347364 (2002-02-01), Liedtke
patent: 6385641 (2002-05-01), Jiang et al.
patent: 6408364 (2002-06-01), Tan et al.
patent: 6408368 (2002-06-01), Parady
patent: 6473840 (2002-10-01), Matthews et al.
patent: 6496912 (2002-12-01), Fields, Jr. et al.
patent: 2002/0078165 (2002-06-01), Genty et al.
patent: 2002/0103778 (2002-08-01), Saxena
patent: 2003/0018661 (2003-01-01), Darugar
patent: 2003/0018876 (2003-01-01), Zahir et al.
patent: 2003/0079087 (2003-04-01), Kuwata
Bliujūté et al., “R-Tree Based Indexing of Now-Relative Bitemporal Data,”Proceedings of the 24thVLDB Conference, 1998, pp. 345-356.
Dan et al., “Detection of a Stable Hot Data Set,”IBM Technical Disclosure Bulletin, vol. 38, No. 11, Nov. 1995, pp. 117-119.
Gatti et al., “A Comparison Among Different Synchronized Tree Traversal Algorithms for Spatial Joins,” Institute of Computing, University of Campinas.
Khuri et al., “Visualizing the CPU Scheduler and Page Replacement Algorithms,”SIGCSE '99, Mar. 1999, pp. 227-231.
Malkawi et al., “Page Replacement in Distributed Virtual Memory Systems,”Proceedings of the 4thIEEE Symposium on Parallel and Distributed Processing, 1992, pp. 394-401.
Vuskovic, “Chapter 5: Virtual Memory,”Operating Systems, 1998-2002, pp. 5-1-5-17.

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

Isolated ordered regions (IOR) prefetching and page replacement does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Isolated ordered regions (IOR) prefetching and page replacement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isolated ordered regions (IOR) prefetching and page replacement will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3803317

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