Abstract: A cache region can be created in a cache in response to receiving a cache region creation request from an application. A storage request from the application can identify the cache region and one or more objects to be stored in the cache region. Those objects can be stored in the cache region in response to receiving the storage request.

Abstract: A first portion of an identifier can be used to assign the identifier to a slot in a first directory. The identifier can identify a cache unit in a cache. It can be determined whether assignment of the identifier to the slot in the first directory will result in the identifier and one or more other identifiers being assigned to the same slot in the first directory. If so, then the technique can include (1) using a second portion of the identifier to assign the identifier to a slot in a second directory; and (2) assigning the one or more other identifiers to one or more slots in the second directory. In addition, it can be determined whether a directory in a cache lookup data structure includes more than one pointer. If not, then a parent pointer that points to the subject directory can be removed.

Abstract: A first portion of an identifier can be used to assign the identifier to a slot in a first directory. The identifier can identify a cache unit in a cache. It can be determined whether assignment of the identifier to the slot in the first directory will result in the identifier and one or more other identifiers being assigned to the same slot in the first directory. If so, then the technique can include (1) using a second portion of the identifier to assign the identifier to a slot in a second directory; and (2) assigning the one or more other identifiers to one or more slots in the second directory. In addition, it can be determined whether a directory in a cache lookup data structure includes more than one pointer. If not, then a parent pointer that points to the subject directory can be removed.

Abstract: A low priority queue can be configured to list low priority removal candidates to be removed from a cache, with the low priority removal candidates being sorted in an order of priority for removal. A high priority queue can be configured to list high priority removal candidates to be removed from the cache. In response to receiving a request for one or more candidates for removal from the cache, one or more high priority removal candidates from the high priority queue can be returned if the high priority queue lists any high priority removal candidates. If no more high priority removal candidates remain in the high priority queue, then one or more low priority removal candidates from the low priority queue can be returned in the order of priority for removal. Write-only latches can also be used during write operations in a cache lookup data structure.

Abstract: In response to a request including a state object, which can indicate a state of an enumeration of a cache, the enumeration can be continued by using the state object to identify and send cache data. Also, an enumeration of cache units can be performed by traversing a data structure that includes object nodes, which correspond to cache units, and internal nodes. An enumeration state stack can indicate a current state of the enumeration, and can include state nodes that correspond to internal nodes in the data structure. Additionally, a cache index data structure can include a higher level table and a lower level table. The higher level table can have a leaf node pointing to the lower level table, and the lower level table can have a leaf node pointing to one of the cache units. Moreover, the lower level table can be associated with a tag.

Abstract: A cache region can be created in a cache in response to receiving a cache region creation request from an application. A storage request from the application can identify the cache region and one or more objects to be stored in the cache region. Those objects can be stored in the cache region in response to receiving the storage request.

Abstract: In an embodiment, a method comprises receiving a hit rate and a change rate for a data object stored in a cache. The method also includes updating a time-to-live period for the data object stored in the cache based on the hit rate and the change rate for the data object.

Abstract: A method and apparatus for providing a dynamic caching system is described. The apparatus for dynamic caching comprises a UCI creator to create a unique content identifier for a request for a requested data set, proxy receiving logic to receive the requested data set from the origin server, and a compilation engine to create a compile object from the requested data set. The apparatus further comprises an assembly engine to, on a subsequent request for the data set, interpret the compile object to create the requested data set. The apparatus further comprises a response logic to serve the requested data set to a requester, without impacting the origin server.

Abstract: A method and apparatus of accessing data through an independent intermediary mechanism (IIM) is described. The method includes displaying a frame including a user interface of the IIM, the frame framing a destination server display area (DSDA). The method further includes having one or more of the following functions provided by the IIM: a home page, a history list, bookmarks, a one-click account log-in function, a transaction record accessible to the user, a forms database permitting new forms to be added to the forms database, a user profile, and automatic form-fill function based on the forms database and the user profile.

Abstract: A method and apparatus for a client-server independent intermediary mechanism is provided. The method comprises displaying a frame including a user interface of the IIM, the frame framing a destination server display area (DSDA). The method further comprises retrieving data for display from a destination server, and instrumenting the data prior to display such that future data retrieved from the destination server is displayed in the DSDA, without writing over the frame.

Abstract: A method and apparatus for a client-server independent intermediary mechanism is provided. The method comprises displaying a frame including a user interface of the IIM, the frame framing a destination server display area (DSDA). The method further comprises retrieving data for display from a destination server, and instrumenting the data prior to display such that future data retrieved from the destination server is displayed in the DSDA, without writing over the frame.

Abstract: A system and method for processing images employs virtual lens objects as image processing elements in a computer-implemented scheme. Each lens object represents one or more image processing operations defined by user-specified lens attributes. The operations may simulate actual physical lens behavior, or they may be abstract operations with no real-world analogs. The user may specify various types of operations for each lens object, and may add, delete, and modify lens objects and lens attributes to experiment with various configurations. The system and method apply the lens objects to a source image to produce a transformed image for output on a screen or printing device.