Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in the cache list is received. A determination is made as to whether an access increment number for the accessed track, wherein the access increment number is greater than one. The access value for the accessed track is incremented by the determined access increment number in response to the track being accessed in the cache. The access value for one of the tracks is used to determine whether to initiate to demote the track from the cache.

Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in the cache list is received. A determination is made as to whether an access increment number for the accessed track, wherein the access increment number is greater than one. The access value for the accessed track is incremented by the determined access increment number in response to the track being accessed in the cache. The access value for one of the tracks is used to determine whether to initiate to demote the track from the cache.

Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.

Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.

A cache memory system includes a cache memory, which stores cache data corresponding to portions of main data stored in a main memory and priority data respectively corresponding to the cache data; a table storage unit, which stores a priority table including information regarding access frequencies with respect to the main data; and a controller, which, when at least one from among the main data is requested, determines whether cache data corresponding to the request is stored in the cache memory, deletes one from among the cache data based on the priority data, and updates the cache data set with new data, wherein the priority data is determined based on the information regarding access frequencies.

A cache memory system includes a cache memory, which stores cache data corresponding to portions of main data stored in a main memory and priority data respectively corresponding to the cache data; a table storage unit, which stores a priority table including information regarding access frequencies with respect to the main data; and a controller, which, when at least one from among the main data is requested, determines whether cache data corresponding to the request is stored in the cache memory, deletes one from among the cache data based on the priority data, and updates the cache data set with new data, wherein the priority data is determined based on the information regarding access frequencies.

A method of sharing address information using quantum states includes storing a number, M, of first qubits in a quantum store at a source node and storing classical information tagged to the M first qubits in a classical store at the source node, where the classical information describes a destination node where the M first qubits share entangled qubits. The M first qubits are measured at the source node and a random number is generated that represents an address of the destination node using the measured M first qubits and the classical information describing the destination node. A packet is sent from the source node that includes the generated random number in a quantum address field and further includes data intended for the destination node in a data field. A number, M, of second qubits is stored in a quantum store at the destination node, wherein each of the M first qubits is entangled with a respective one of the M second qubits. The M second qubits is measured at the destination node and a random number is generated using the measured M second qubits. The sent packet is received at the destination node. The generated random number in the quantum address field is compared at the destination node with the generated random number using the measured M second qubits. A match is determined at the destination node between the compared generated random number in the quantum address field and the generated random number using the measured M second qubits.

A method of sharing address information using quantum states includes storing a number, M, of first qubits in a quantum store at a source node and storing classical information tagged to the M first qubits in a classical store at the source node, where the classical information describes a destination node where the M first qubits share entangled qubits. The M first qubits are measured at the source node and a random number is generated that represents an address of the destination node using the measured M first qubits and the classical information describing the destination node. A packet is sent from the source node that includes the generated random number in a quantum address field and further includes data intended for the destination node in a data field. A number, M, of second qubits is stored in a quantum store at the destination node, wherein each of the M first qubits is entangled with a respective one of the M second qubits. The M second qubits is measured at the destination node and a random number is generated using the measured M second qubits. The sent packet is received at the destination node. The generated random number in the quantum address field is compared at the destination node with the generated random number using the measured M second qubits. A match is determined at the destination node between the compared generated random number in the quantum address field and the generated random number using the measured M second qubits.

The present disclosure is directed to a system and method for a content display located in the chat messaging system. It facilitates communication between at least a first and a second user and further enables content sending in a more efficient and faster way. This disclosure enables users to work with complimentary and different real-time communication systems and enables the display of interactive elements presenting objects in an application. Such display may be personalized and lead to external sources like a web page or other catalog of data with further explanation necessary to purchase or order. Furthermore, the disclosure improves the storage of content that will be displayed upon a frequency of usage and distribute such storage upon two types of memory that communicate over the network.

A page swap method, a storage system, and an electronic device as applied to the field of memory management technologies are provided. The method includes determining, from a least recently used LRU linked list, a to-be-swapped-out first swap-out page of a memory device, determining a second swap-out page from the LRU linked list based on the first swap-out page, and when the first swap-out page is swapped out of the memory device, swapping out the first swap-out page and the second swap-out page to a swap device.