We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory t...

The design of concurrent data structures is greatly facilitated by the availability of synchronization operations that atomically modify k arbitrary items, such as kread–modify–write (krmw). Aiming to increase concurrency in order to exploit the parallelism offered by today’s multi-core andmulti-processing architectures, we propose a highly concurrent software implementation of krmw, with only ...

The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Attiya et al.. In k-local mutual exclusion, it is assumed that the k identical copies of a resource are shared among the geographically close nodes. The paper proposes a solution to the k-local mutual exclusion problem in MANETs. The algorithm uses a leader-based approach and the leader is equipped ...

The study of the q-analogue classical results geometric function theory is currently great interest to scholars. In this article, we define generalized classes close-to-convex functions and quasi-convex with help q-difference operator. Moreover, by using q-analogues a certain family linear operators, Kq,bsh, K˜q,sbh, Qq,bsh, Q˜q,sbh are introduced. Several interesting inclusion relationships be...