Abstract: Methods, systems, and articles of manufacture for caching are disclosed. These include incrementally reading a cache by, receiving a request from a client to retrieve an object from a cache; comparing a size of the requested object to a threshold retrieval size; transmitting a response including an incremental lookup indicator to the client when the size is greater than the threshold retrieval size; receiving one or more follow-on requests including the incremental lookup indicator from the client; responsive to each of the follow-on requests, retrieving a portion of the requested object from the cache; and transmitting the retrieved portion to the client. Corresponding incremental insertion of data items into the cache are also disclosed.

Abstract: Methods, systems, and articles of manufacture for caching are disclosed. These include incrementally reading a cache by, receiving a request from a client to retrieve an object from a cache; comparing a size of the requested object to a threshold retrieval size; transmitting a response including an incremental lookup indicator to the client when the size is greater than the threshold retrieval size; receiving one or more follow-on requests including the incremental lookup indicator from the client; responsive to each of the follow-on requests, retrieving a portion of the requested object from the cache; and transmitting the retrieved portion to the client. Corresponding incremental insertion of data items into the cache are also disclosed.

Abstract: A computer-implemented method, a system and a computer-readable medium provide for improved caching. A request key for information is received from a requestor and used to retrieve corresponding metadata from a metadata cache. The metadata is analyzed to determine if information related to the request key should be looked up in a primary cache. If so, the information is retrieved from the primary cache. If the metadata indicates against looking up the information in the primary cache, or if the information was not found in the primary cache, the information is loaded, the metadata is updated, and the information is added to the primary cache if analysis of the updated metadata indicates that adding the information is appropriate.

Abstract: A computer-implemented method, system and computer program product for updating a resource in a cached memory storage are provided. Mutable and immutable components of a resource are generated. The mutable component includes metadata that includes the amount of time the resource persists in the cached memory storage. The immutable component of the resource includes content provided by the source of the resource. A key associated with the resource is generated, where the key is used to access the mutable component and the immutable component in the cached memory storage. The key, the mutable component and the immutable component of the resource are transmitted to the cached memory storage from which the resource is retrieved for display on a client device.

Abstract: A method and apparatus for distributing multiple interrupts among multiple processors is disclosed. According to one embodiment, an interrupt daemon monitors the interrupt load among the processors that results from an initial mapping of the interrupts to the processors. The interrupt daemon determines whether there is a sufficient imbalance of the interrupts among the processors. If so, the interrupt daemon triggers a reassignment routine that generates a new mapping of the interrupts among the processors, and if not, the interrupt daemon goes to sleep for a specified time period. If the new mapping produces a sufficient improvement in the distribution of interrupts among the processors, based on the same criteria used to detect the imbalance, the new mapping is used by the central hub for subsequent distribution of interrupts to the processors. However, if the new mapping does not provide a sufficient improvement, the original mapping continues to be used.

Abstract: A method and apparatus for distributing multiple interrupts among multiple processors is disclosed. According to one embodiment, an interrupt daemon monitors the interrupt load among the processors that results from an initial mapping of the interrupts to the processors. The interrupt daemon determines whether there is a sufficient imbalance of the interrupts among the processors. If so, the interrupt daemon triggers a reassignment routine that generates a new mapping of the interrupts among the processors, and if not, the interrupt daemon goes to sleep for a specified time period. If the new mapping produces a sufficient improvement in the distribution of interrupts among the processors, based on the same criteria used to detect the imbalance, the new mapping is used by the central hub for subsequent distribution of interrupts to the processors. However, if the new mapping does not provide a sufficient improvement, the original mapping continues to be used.

Abstract: A method and apparatus for distributing multiple interrupts among multiple processors is disclosed. According to one embodiment, an interrupt daemon monitors the interrupt load among the processors that results from an initial mapping of the interrupts to the processors. The interrupt daemon determines whether there is a sufficient imbalance of the interrupts among the processors. If so, the interrupt daemon triggers a reassignment routine that generates a new mapping of the interrupts among the processors, and if not, the interrupt daemon goes to sleep for a specified time period. If the new mapping produces a sufficient improvement in the distribution of interrupts among the processors, based on the same criteria used to detect the imbalance, the new mapping is used by the central hub for subsequent distribution of interrupts to the processors. However, if the new mapping does not provide a sufficient improvement, the original mapping continues to be used.

Abstract: A method and apparatus for distributing multiple interrupts among multiple processors is disclosed. According to one embodiment, an interrupt daemon monitors the interrupt load among the processors that results from an initial mapping of the interrupts to the processors. The interrupt daemon determines whether there is a sufficient imbalance of the interrupts among the processors. If so, the interrupt daemon triggers a reassignment routine that generates a new mapping of the interrupts among the processors, and if not, the interrupt daemon goes to sleep for a specified time period. If the new mapping produces a sufficient improvement in the distribution of interrupts among the processors, based on the same criteria used to detect the imbalance, the new mapping is used by the central hub for subsequent distribution of interrupts to the processors. However, if the new mapping does not provide a sufficient improvement, the original mapping continues to be used.

Abstract: A method and apparatus for distributing multiple interrupts among multiple processors is disclosed. According to one embodiment, an interrupt daemon monitors the interrupt load among the processors that results from an initial mapping of the interrupts to the processors. The interrupt daemon determines whether there is a sufficient imbalance of the interrupts among the processors. If so, the interrupt daemon triggers a reassignment routine that generates a new mapping of the interrupts among the processors, and if not, the interrupt daemon goes to sleep for a specified time period. If the new mapping produces a sufficient improvement in the distribution of interrupts among the processors, based on the same criteria used to detect the imbalance, the new mapping is used by the central hub for subsequent distribution of interrupts to the processors. However, if the new mapping does not provide a sufficient improvement, the original mapping continues to be used.