Coverart for item
The Resource Concurrency Control in Distributed System Using Mutual Exclusion

Concurrency Control in Distributed System Using Mutual Exclusion

Label
Concurrency Control in Distributed System Using Mutual Exclusion
Title
Concurrency Control in Distributed System Using Mutual Exclusion
Creator
Contributor
Subject
Language
eng
Member of
Cataloging source
MiAaPQ
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Studies in Systems, Decision and Control Ser.
Series volume
v.116
Concurrency Control in Distributed System Using Mutual Exclusion
Label
Concurrency Control in Distributed System Using Mutual Exclusion
Link
http://libproxy.rpi.edu/login?url=https://ebookcentral.proquest.com/lib/rpi/detail.action?docID=4939361
Publication
Copyright
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Related Items
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Preface -- Contents -- About the Authors -- 1 Introduction -- 1.1 Organization of Book -- References -- 2 State-of-the-Art Review -- 2.1 Definitions of Terminologies -- 2.2 Token-Based ME Algorithms -- 2.3 Hierarchical Topology Based ME Algorithms -- 2.4 Graph Topology Based ME Algorithms -- 2.5 Permission-Based ME Algorithms -- 2.6 Voting-Based ME Algorithms -- 2.7 Conclusions -- References -- 3 Tree-Based Mutual Exclusions -- 3.1 Modified Raymond's Algorithm (MRA) -- 3.1.1 Data Structure and Algorithm for MRA Algorithm -- 3.1.2 Limitation of Algorithm MRA -- 3.2 Modified Raymond's Algorithm for Priority (MRA-P) -- 3.2.1 Data Structure and Algorithm for MRA-P -- 3.2.2 Performance Analysis for MRA and MRA-P -- 3.3 Fairness Algorithm for Priority Processes (FAPP) -- 3.3.1 Data Structure and Algorithm for FAPP -- 3.3.2 Performance Analysis for FAPP -- 3.4 Concluding Remarks on Tree-Based ME Algorithms -- References -- 4 A Graph-Based Mutual Exclusion Algorithm Using Tokens -- 4.1 Link Failure Resilient Token-Based ME Algorithm for Directed Graph (LFRT) -- 4.1.1 Data Structure and Algorithm for LFRT -- 4.1.2 Limitations of LFRT -- 4.2 Link Failure Resilient Priority Based Fair ME Algorithm for Distributed Systems (LFRT-P) -- 4.2.1 Data Structure and Algorithm for LFRT-P -- 4.2.2 Performance Analysis for LFRT and LFRT-P -- 4.3 Concluding Remarks on Graph-Based ME Algorithms -- References -- 5 Voting-Based Mutual Exclusion Algorithms -- 5.1 Below-Majority Voting for ME in Distributed Systems (BMaV) -- 5.1.1 Description for BMaV -- 5.1.2 Comments on the BMaV Algorithm -- 5.2 A New Hybrid Mutual Exclusion Algorithm in Absence of Majority Consensus (NHME-AMC) -- 5.2.1 A Description for NHME-AMC -- 5.3 Performance Analysis for BMaV and NHME-AMC -- 5.4 Concluding Remarks on Voting-Based ME Algorithms -- References -- 6 Conclusions
  • 6.1 Summary of the Works Described in the Book -- 6.2 Impact of New Algorithms on Future Research for Process Synchronization in Distributed Systems -- References
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9789811055591&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4388751'}
Extent
1 online resource (104 pages)
Form of item
online
Isbn
9789811055591
Media category
computer
Media MARC source
rdamedia
Media type code
c
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...