ORPP logo
Image from Google Jackets

Distributed Algorithms on Graphs.

By: Contributor(s): Material type: TextTextPublisher: Montreal : McGill-Queen's University Press, 1986Copyright date: ©1986Edition: 1st edDescription: 1 online resource (203 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780773573475
Subject(s): Genre/Form: Additional physical formats: Print version:: Distributed Algorithms on GraphsDDC classification:
  • 004/.36
LOC classification:
  • QA76.9.D5 I67 1986
Online resources:
Contents:
Cover -- Title -- Copyright -- Preface -- Table of Contents -- Contributors -- 1. The bit complexity of probabilistic leader election on a unidirectional ring -- 2. Minimizing a virtual control token ring -- 3. New upperbounds for decentralized extrema-finding in a ring of processors -- 4. Efficient algorithms for routing information in a multicomputer system -- 5. Lower bounds on common knowledge in distributed algorithms -- 6. Scheme for efficiency-performance measures of distributed and parallel algorithms -- 7. Duplicate routing in distributed networks -- 8. Notes on distributed algorithms in unidirectional rings -- 9. Sense of direction and communication complexity in distributed networks -- 10. The communication complexity hierarchy in distributed computing -- 11. Simulation of chaotic algorithms by token algorithms -- 12. A general distributed graph algorithm for fair access to critical sections -- ADDENDA -- a. Open Problems -- b. A bibliography of distributed algorithms (1985) -- c. Author Index.
Summary: No detailed description available for "Distributed Algorithms on Graphs".
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Cover -- Title -- Copyright -- Preface -- Table of Contents -- Contributors -- 1. The bit complexity of probabilistic leader election on a unidirectional ring -- 2. Minimizing a virtual control token ring -- 3. New upperbounds for decentralized extrema-finding in a ring of processors -- 4. Efficient algorithms for routing information in a multicomputer system -- 5. Lower bounds on common knowledge in distributed algorithms -- 6. Scheme for efficiency-performance measures of distributed and parallel algorithms -- 7. Duplicate routing in distributed networks -- 8. Notes on distributed algorithms in unidirectional rings -- 9. Sense of direction and communication complexity in distributed networks -- 10. The communication complexity hierarchy in distributed computing -- 11. Simulation of chaotic algorithms by token algorithms -- 12. A general distributed graph algorithm for fair access to critical sections -- ADDENDA -- a. Open Problems -- b. A bibliography of distributed algorithms (1985) -- c. Author Index.

No detailed description available for "Distributed Algorithms on Graphs".

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.

© 2024 Resource Centre. All rights reserved.