Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms, Ottawa, Canada, August 1985 / / edited by Eli Gafni and Nicola Santoro

• Pubblicazione: Ottawa, : Carleton University Press, 1986
• Edizione: 1st ed.
• Descrizione fisica: 1 online resource (200 p.)
• Disciplina: 004/.36
• Soggetto topico: Electronic data processing - Distributed processing; Algorithms
• Altri autori: GafniEli SantoroN <1951-> (Nicola)
• Note generali: Includes index.
• Nota di bibliografia: Includes bibliography and index.
• Nota di contenuto: Front Matter -- Contents -- The Bit Complexity of Probabilistic Leader Election on a Unidirectional Ring -- Minimizing a Virtual Control Token Ring -- New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors -- Efficient Algorithmsfor Routing Information in a Multicomputer System -- Lower Bounds on Common Knowledge in Distributed Algorithms -- Scheme for Efficiency-Performance Measures of Distributed and Parallel Algorithms -- Duplicate Routing in Distributed Networks -- Notes on Distributed Algorithms in Unidirectional Rings -- Sense of Direction and Communication Complexity in Distributed Networks -- The Communication Complexity Hierarchy in Distributed Computing -- Simulation of Chaotic Algorithms by Token Algorithms -- A General Distributed Graph Algorithm for Fair Access to Critical Sections -- Addenda -- Open Problems -- A Bibliography of Distributed Algorithms -- Author Index
• Sommario/riassunto: This volume contains papers presented at the First International Workshop on Distributed Algorithms. The papers present solutions to a wide spectrum of problems (leader election, resource allocation, routing, etc.) and focus on a variety of issues that influence communications complexity.
• Titolo autorizzato: Distributed algorithms on graphs
• ISBN: 0-7735-7347-X
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910967286103321
• Lo trovi qui: Univ. Federico II