Method and system for optimizing reader-writer lock based on Linux

Abstract

The invention discloses a method and a system for optimizing reader-writer locks based on the Linux. The method comprises: receiving a reader lock adding application or a writer lock adding application, and determining whether reader-writer locks are in an applied state before; if the reader-writer locks are not in the applied state, directly processing the reader lock adding application or the writer lock adding application; if the reader-writer locks are in the applied state and are occupied, adding the reader lock adding application in a preset read-write waiting queue, and upgrading read highest priority-first or write highest priority-first recorded in a rwlock structural body; when the occupied reader-writer lock is released, determining whether reader-writer lock adding applications wait in the read-write waiting queue; according to a determination result, and the read highest priority-first and the write highest priority-first, processing the reader lock adding application in the read waiting queue and the writer lock adding application in the write waiting queue. Through the scheme, situation that a reader or a writer starves can be reduced or prevented, so as to improve resource utilization rate of the system and system parallel processing performance.

Description

technical field [0001] The invention relates to the field of operating system design, in particular to a Linux-based read-write lock optimization method and system. Background technique [0002] There are two basic mechanisms for data mutual exclusion under linux, including semaphores (Semaphore) and spin locks (Spinlock). Due to the nature of mutual exclusion, the code using spin locks has no thread concurrency at all, and the performance of multiprocessor systems is limited. Reader-Writer spinlock (Reader-WriterSpinlock) divides threads into readers and writers. Multiple readers can be allowed to access shared resources at the same time. Shared resources can only be accessed by one writer in a period of time. The application thread is in the waiting period. The busy waiting method is still used. [0003] Currently, Linux can configure the read-write lock to be read-first or write-first. The default read-write lock is read-first. If a writer is waiting for the lock, the r...

AI Technical Summary

Problems solved by technology

However, both of these two configuration methods will cause readers or writers to starve to death. When the configuration is reader-first, the writer will starve to death, and when the configuration is writer-first, the reader will starve to death.

Images