An Elegant l-exclusion Algorithm for Shared Memory Systems

in Computing Letters
Restricted Access
Get Access to Full Text

Have an Access Token?



Enter your access token to activate and access content online.

Please login and go to your personal user account to enter your access token.



Help

Have Institutional Access?



Access content through your institution. Any other coaching guidance?



Connect

Recent advancement of embedded systems and growing popularity of Java renew the interest to some classic process coordination problems, such as mutual exclusion problem and its generalization called l-exclusion problem. These are fundamental problems in parallel and distributed processing systems. The l-exclusion problem was introduced by Fischer et al.[9] for shared memory systems and subsequently studied in [6, 10, 2, 3, 4, 12, 1, 11]. In this paper, we present a simple solution to l-exclusion problem and prove its correctness. Our solution is efficient both in time and space.

An Elegant l-exclusion Algorithm for Shared Memory Systems

in Computing Letters

Index Card

Content Metrics

Content Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 1 1 0
PDF Downloads 1 1 0
EPUB Downloads 0 0 0