In this paper, we present the PR-lock, a prioritized spin-lock mutual exclusion algorithm for real time systems. The PR-lock is a contention-free spin lock, in which blocked processes spin on locally stored or cached variables. In contrast to previous work on prioritized spin locks, our algorithm maintains a pointer to the lock holder. As a result, our spin lock can support priority inheritance...

introduction: direction and latency of electrical connectivity between different sites of brain explains brain neural functionality. we compared efficiency of cross correlation and phase locking methods in time lag estimation which are based on local field potential (lfp) and lfpspike signals, respectively. methods: signals recorded from mt area of a macaque’s brain was used in a simulation app...

Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared data objects are highly concurrent and guarantee that at least one operation, from a set of concurrently executed operations, finishes after a finite number of steps regardless of the state of the other operations. Lock-free data objects provide progress guarantees on the object level. In this paper...

The paper studies the impact of several lock manager designs on the overhead imposed to a persistent programming language by automated object locking. Our study reveals that a lock management method based on lock state sharing outperforms more traditional lock management designs. Lock state sharing is a novel lock management method that represents all lock data structures with equal values with...

From a project on upgrading an existing commercially used operating system for support of a distributed system architecture, we present results and experience from a comprehensive analytical performance evaluation of a large number of different implementation strategies for distributed lock management. The various lock management policies we consider differ in the management of the lock databas...