Previous studies have paid little attention to the employees' ability to exit a job-lock situation and factors that determine this ability. It remains unclear why some employees who experience job lock are able to exit this state while others remain in job lock. We use longitudinal data to identify employees who have fallen in the state of job lock and their subsequent behavior-exiting or remai...

Atomic operations are a key primitive in parallel computing systems. The standard implementation mechanism for atomic operations uses mutual exclusion locks. In an object-based programming system the natural granularity is to give each object its own lock. Each operation can then make its execution atomic by acquiring and releasing the lock for the object that it accesses. But this ne lock gran...

Traditionally digital lock-in amplifiers sample the input signal at a rate much higher than the lock-in reference frequency and perform the lock-in algorithm with high-speed processors. We present a small and simple digital lock-in amplifier that uses a 20 bit current integrating analogue-to-digital converter interfaced to a microcontroller. The sample rate is set to twice the reference frequen...

Storing, querying, and updating XML documents in multi-user environments requires data processing guarded by a transactional context to assure the well-known ACID properties, particularly with regard to isolate concurrent transactions. In this paper, we introduce the taDOM tree, an extended data model which considers organization of both attribute nodes and node values in a new way and allows f...

vintage, technology lock-in, institutional lock-in, clean development mechanisms.

Lock preemption is a common problem with twophase locking. While a transaction is still active, its locks may be preempted to avoid a deadlock or to satisfy the lock request of a higher-priority transaction. In general, the victim of preemption is aborted. This paper suggests that the victim could be continued and its work up to preemption could be saved if the preempted lock is restored on its...

Mutual exclusion primitives based on user-level atomic instructions (often called spin locks) have proven to be much more eecient than operating-system semaphores in situations where the contention on the semaphore is low. However, many of these spin lock schemes do not permit registration of ownership to be carried out atomically with acquisition, potentially leaving the ownership undetermined...

NUMA multicore machines are pervasive and many multithreaded applications are suffering from lock contention. To mitigate this issue, application and library developers can choose from the plethora of optimized mutex lock algorithms that have been designed over the past 25 years. Unfortunately, there is currently no broad study of the behavior of these optimized lock algorithms on realistic app...

Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include increasing fault tolerance of a (possibly heterogeneous) system and alleviating the problems associated with critical sections such as priority inversion and deadlock. For parallel computers with tightly-coupled processors and ...

Synchronization overhead may limit the number of applications that can take advantage of a shared-memory abstraction on top of emerging network of workstation organizations. While the programmer could spend additional efforts into getting rid of such overhead by restructuring the computation, this paper focuses on a simpler approach where the overhead of lock operations is hidden through lock p...