A Simple Shared Memory K-exclusion Algorithm for Distributed Processing

A.A. Aravind (Canada)


Mutual exclusion, -exclusion, synchronization, parallel processing, concurrent systems.


Mutual exclusion is a fundamental problem in distributed processing systems. A generalization of mutual exclusion called -exclusion for shared memory systems was intro duced by Fischer et al. in [8] and subsequently studied in [1, 2, 3, 5]. In this paper, we present a simple solution to this problem and prove its correctness. Our solution is effi cient both in time and space.

Important Links:

Go Back