找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Distributed Algorithms; 3rd International Wo Jean-Claude Bermond,Michel Raynal Conference proceedings 1989 Springer-Verlag Berlin Heidelber

[复制链接]
查看: 35730|回复: 59
发表于 2025-3-21 19:27:48 | 显示全部楼层 |阅读模式
书目名称Distributed Algorithms
副标题3rd International Wo
编辑Jean-Claude Bermond,Michel Raynal
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Distributed Algorithms; 3rd International Wo Jean-Claude Bermond,Michel Raynal Conference proceedings 1989 Springer-Verlag Berlin Heidelber
描述This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.
出版日期Conference proceedings 1989
关键词Dezentralisierte Ablaufsteuerung; Netze; Netzprotokolle; Resolution; Routing; Variable; Verteilte Algorith
版次1
doihttps://doi.org/10.1007/3-540-51687-5
isbn_softcover978-3-540-51687-3
isbn_ebook978-3-540-46750-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1989
The information of publication is updating

书目名称Distributed Algorithms影响因子(影响力)




书目名称Distributed Algorithms影响因子(影响力)学科排名




书目名称Distributed Algorithms网络公开度




书目名称Distributed Algorithms网络公开度学科排名




书目名称Distributed Algorithms被引频次




书目名称Distributed Algorithms被引频次学科排名




书目名称Distributed Algorithms年度引用




书目名称Distributed Algorithms年度引用学科排名




书目名称Distributed Algorithms读者反馈




书目名称Distributed Algorithms读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:49:35 | 显示全部楼层
https://doi.org/10.1007/978-1-4613-8443-4he whole ring as a single resource, while the local fairness algorithm views the ring as multiple disjoint resources. The local fairness mechanism is triggered only if potential starvation exists and is usually restricted only to segments of interfering nodes. If the segment of the interfering nodes
发表于 2025-3-22 04:00:32 | 显示全部楼层
https://doi.org/10.1007/978-1-4613-8443-4ogically synchronous multicast problem is impossible..The author is currently developing a simulation system for algorithms expressed as I/O automata. We conclude the paper by describing how the logically synchronous multicast protocol can be used to distribute this simulation system.
发表于 2025-3-22 04:39:27 | 显示全部楼层
0302-9743 gorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.978-3-540-51687-3978-3-540-46750-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 10:17:00 | 显示全部楼层
Conference proceedings 1989d algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.
发表于 2025-3-22 15:18:25 | 显示全部楼层
发表于 2025-3-22 18:35:30 | 显示全部楼层
发表于 2025-3-22 23:22:17 | 显示全部楼层
发表于 2025-3-23 03:43:30 | 显示全部楼层
发表于 2025-3-23 05:57:14 | 显示全部楼层
Random leaders and random spanning trees,eader, and then centralized algorithms are run in the distributed system. If, however, we have fault tolerance in mind, selecting a random spanning tree and a random leader are more desirable. If we manage to select a random tree, the probability that a bad channel will disconnect some nodes from th
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-12 08:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表