An Approach for Real-Time Nested Lock
Prakash S. Prasad, Kiran Bobade, Khyati Raikar, Mansi Pande · 2018
In last few decades, there has it is seen that developers take keenness in using Linux operating system in real time environment. A simple and classic designs of Linux guarantee reliability and excellent performance, while the open-source license gives permission to modify as well as changes the sources code with respect to the user needs. For this, Linux operating system has been designed to be a GPL operating system. Therefore, it delivers few issues like unpredictable inertness and constraint for real-time scheduling. On Linux, the read-write semaphores provide concurrent readers and exclusive writers for a given critical section. For example, since the memory mapping information of a process is read very often but rarely changes during its execution, it is protected by a read-write semaphore. In Linux state-of-the-art protocols for (mainly heterogeneous) nested locks and developing novel analysis techniques for implementation. Few solutions are there on shared-memory multiprocessor synchronization targeted nested critical sections.