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...

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 ...

In most C++-based OODBMSs, the concurrency control has been implemented by using the locking mechanism. However, application programmers for those databases should be involved in locking the objects that would be accessed from their applications. So they had to spend a lot of time on issuing locks, and thus the productivity of application development has become poor. This paper presents a mecha...

In parallel database systems, conflicts for accesses to objects are solved through object locking. In order to acquire and release locks, in the standard implementation of a lock manager small sections of the code may be executed only by a single thread. On massively parallel shared memory machines (SMM) the serialization of these critical sections leads to serious performance degradation. We e...

The concept of Grid computing has been in the making since the 1960’s, but it took quite some time up to the late 1990’s, with the advent of faster networks and better understanding of distributed computing, that some of those concepts were realized. Even now, the world’s computer networks are very primitive as compared to other networks, such as the electrical power grid, the telephone network...