Self-stabilizing K-out-of-L exclusion on tree network

Details Self-stabilizing K-out-of-L exclusion on tree network Self-stabilizing K-out-of-L exclusion on tree network

2008-12-05

arxiv.org/abs/0812.1093v4

Computer Science

Networking and Internet Architecture

15 pages

Scientific paper

In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are $\ell$ units of a shared resource, and any process can request up to $\mathtt k$ units ($1\leq\mathtt k\leq\ell$). We propose the first deterministic self-stabilizing distributed K-out-of-L exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.

Affiliated with

Also associated with

No associations

Rating

Self-stabilizing K-out-of-L exclusion on tree network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-stabilizing K-out-of-L exclusion on tree network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-stabilizing K-out-of-L exclusion on tree network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365149