A method and device for implementing concurrent containers

Abstract

The present invention provides a method and device for implementing concurrent containers, which help to physically isolate data in memory by adding sub-containers, thereby reducing CPU consumption caused by polling container locks. The method is characterized in that the concurrent container is a parent container composed of multiple sub-containers, and the parent container is created according to the following steps: add data to a sub-container in the parent container, and record the added data in the parent container The sequence number in the container, when the amount of added data reaches the first threshold, create a new sub-container in memory; and continue to add data to the created new sub-container, and record the added data in the parent The serial number in the container, when the amount of added data reaches the first threshold, create another new sub-container in memory; and so on, until all data is added to the parent container, where the sub-containers are in memory with each other physical isolation.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a method and device for realizing concurrent containers. Background technique [0002] When writing a program, it is often necessary to manage a large number of object references. In order to achieve effective classification management, references of the same type are placed in the same data container. For example, a JAVA container is an instance of a series of classes provided by a JAVA API (Application Programming Interface, application programming interface), used to store objects in a program, and can be understood as a collection of stored data. Since object references that may be used at any time are stored in the data container, general data containers provide basic interface functions such as query, traversal, and modification. [0003] JAVA containers are divided into synchronous containers and concurrent containers. Synchronous containers include Vector, Ha...

AI Technical Summary

Problems solved by technology

[0004] In the process of realizing the present invention, the inventor has found that there are at least the following problems in the prior art: in the current programming process, in order to avoid the difference in data consistency caused by concurrent operation of a certain set (for example: one piece of data in the set is simultaneously used by multiple thread modification, it is impossible to determine which thread modified the piece of data last), usually a collection that supports concurrent operations (for example: CopyOnWriteArrayList, etc.)

In addition, ABA problems may arise for concurrent containers, that is, when a thread performs a CAS (Compare and Swap) operation on a certain parameter V, assuming that V was originally A, if another thread modifies V to B, Then modify it back to A, the CAS operation of the current thread cannot tell whether the current V value has changed

Therefore, concurrent containers in the prior art are not applicable in some scenarios

Images