Self-Stabilizing k-out-of-ℓ exclusion on tree networks

Self-Stabilizing k-out-of-ℓ exclusion on tree networks

In this paper, we address the problem of k-out-of-lscr exclusion, a generalization of the mutual exclusion problem, in which there are lscr units of a shared resource, and any process can request up to k units (1 les k les lscr). We propose the first deterministic self-stabilizing distributed k-out-...

Full description

Saved in:
Bibliographic Details
Published in:2009 IEEE International Symposium on Parallel & Distributed Processing pp. 1 - 8
Main Authors: Datta, A.K., Devismes, S., Horn, F., Larmore, L.L.
Format: Conference Proceeding
Language:English
Published: IEEE 01-05-2009
Subjects:
Access protocols
Availability
Bandwidth
Computer science
Fault tolerance
Humans
Message passing
Printers
Resource management
Streaming media
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we address the problem of k-out-of-lscr exclusion, a generalization of the mutual exclusion problem, in which there are lscr units of a shared resource, and any process can request up to k units (1 les k les lscr). We propose the first deterministic self-stabilizing distributed k-out-of-lscr exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.
ISBN:9781424437511
1424437512
ISSN:1530-2075
DOI:10.1109/IPDPS.2009.5160875