METHOD AND SYSTEM FOR SELF-TUNING CACHE MANAGEMENT

• US 20150356021A1
• Filed: 08/17/2015
• Published: 12/10/2015
• Est. Priority Date: 08/28/2012
• Status: Active Grant

• Current Assignee: Masimo Corporation
• Original Assignee: Vantrix Corporation
• Inventors: BENOIT, Louis, Cote, Sebastien, Buchnajzer, Robert
• Granted Patent: US 9,811,470 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 12/0871 Allocation or management of cache space
• CPC Class Codes: G06F 12/0888 using selective caching, e.g. bypass
• CPC Class Codes: G06F 12/123 with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
• CPC Class Codes: G06F 2212/1044 Space efficiency improvement
• CPC Class Codes: G06F 2212/464 Multimedia object, e.g. image, video
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data

Abstract

Web objects, such as media files are sent through an adaptation server which includes a transcoder for adapting forwarded objects according to profiles of the receiving destinations, and a cache memory for caching frequently requested objects, including their adapted versions. The probability of additional requests for the same object before the object expires, is assessed by tracking hits. Only objects having experienced hits in excess of a hit threshold are cached, the hit threshold being adaptively adjusted based on the capacity of the cache, and the space required to store cached media files. Expired objects are collected in a list, and may be periodically ejected from the cache, or when the cache is nearly full.

Claims

1. A method for caching objects in a cache of predetermined capacity having a cache size threshold less than the predetermined capacity, the method comprising:

(a) receiving a request, a hit, for an object;

(b) creating a plurality of hit buckets forming a hits distribution list, comprising;

(i) associating a corresponding number of hits with each bucket;

(ii) in said each bucket, storing accumulated sizes of objects having a number of hits corresponding to said each bucket;

(c) computing a hit threshold, comprising;

accumulating contents of the hit buckets having the highest hit numbers, without exceeding the cache size threshold;

selecting a lower hit number as the hit threshold;

(d) caching the object only if a hit number for the object exceeds the hit threshold; and

(e) repeating steps (a) to (d).