Access Restriction

Author Nelakonda, M. ♦ Mizuno, M. ♦ Neilsen, M.L.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Distributed algorithms ♦ Tellurium ♦ Distributed computing ♦ Counting circuits ♦ Resource management ♦ Power system management ♦ Process control ♦ Interactive systems ♦ IEL ♦ Testing
Abstract In distributed environments, many mutual exclusion algorithms have been proposed. These algorithms only control mutually exclusive access to a single resource. Several extensions to these basic mutual exclusion algorithms have been proposed, including (1) multiple mutual exclusion algorithms; (2) counting semaphores and (3) k-out-of-M resource synchronization primitives. However, none of these algorithms are as powerful as parameterized semaphore operations. This paper presents a distributed implementation of parameterized semaphore operations. The operations are as powerful as the centralized implementation. The authors assume that the system consists of N nodes, which are connected by a fully connected reliable, FIFO network.<<ETX>>
Description Author affiliation: Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA (Nelakonda, M.; Mizuno, M.; Neilsen, M.L.)
ISBN 081862812X
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-05-28
Publisher Place Canada
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 263.15 kB
Page Count 4
Starting Page 466
Ending Page 469

Source: IEEE Xplore Digital Library