Resource locking algorithm for memory read-write process

Abstract

The invention provides a resource locking algorithm for a memory read-write process, which is used for read-write operation of a memory resource D with an addressing mark, and the addressing mark comprises an address interval, an authority identifier and a timestamp; wherein the authority identifiers are in three mutually exclusive states of distributable, read-only and write-only; the locking algorithm directs the read operation request to the memory resource of which the permission identifier is read-only; the locking algorithm directs the write operation request to memory resources only written by permission; when the locking algorithm is in write operation, if the write operation aims at the memory space S of the existing content X, the locking algorithm copies the content X in the memory to form a mirror image space L with only write permission, and the mirror image space L is used for replacing the memory space S to respond to the write operation aiming at the content X and replacing the memory space S after the write operation is finished; according to the method, the memory switching algorithm can be used for replacing a mutual exclusion lock to solve the synchronization problem of shared resource mutual exclusion access in the scenes of memory data block single-process (thread) writing and multi-process (thread) reading.

Description

technical field [0001] The invention relates to the technical field of computing equipment, in particular to a resource locking algorithm for memory reading and writing processes. Background technique [0002] Mutex locks are generally implemented using semaphores, which are used to synchronize or mutually exclude access to shared resources. A large number of operations and uses of semaphores will occupy a large amount of CPU resources in the system, and seriously affect the resource advantages of multiple CPUs or multiple cores in the system. The demand for concurrency is relatively high, and the system with multiple processes (threads) sharing resources is a relatively large bottleneck. Since the resource protection of the semaphore can only allow one process or thread to access at a time, multiple processes or threads accessing a common resource will cause processes or threads to wait in line, which cannot meet the efficient operation of the system. [0003] Currently, r...

AI Technical Summary

Problems solved by technology

[0004] 1. Every time a process (thread) accesses a shared resource, it must apply for a semaphore. A large number of semaphores will occupy a large amount of CPU resources of the operating system and affect the number of concurrency;

[0005] 2. The shared resource operation is protected by the semaphore, which will cause the process (thread) accessing the shared resource to wait, which affects the single process (thread) processing capability of the system;

[0006] 3. Since the process (thread) of writing or modification accesses the shared resource locally, and the frequency is much lower than that of the read access, but the shared resource needs to be protected by a semaphore, resulting in a large number of queuing of the read process (thread)

[0007] Mutually exclusive access to shared resources by multiple processes (threads) can easily cause deadlock in the system

Images