找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Distributed Algorithms; 4th International Wo Jan Leeuwen,Nicola Santoro Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991

[复制链接]
楼主: clot-buster
发表于 2025-3-28 17:20:10 | 显示全部楼层
发表于 2025-3-28 20:49:12 | 显示全部楼层
Localized-access protocols for replicated databases,us avoiding communication overhead and distributed commitment, which are required by most other replica control protocols. In the first protocol, data accessibility at a site can be dynamically reconfigured using special transactions, which are executed on demand. In the second protocol, data access
发表于 2025-3-29 02:25:14 | 显示全部楼层
发表于 2025-3-29 04:45:46 | 显示全部楼层
发表于 2025-3-29 07:27:07 | 显示全部楼层
0302-9743 90. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering cu
发表于 2025-3-29 14:14:55 | 显示全部楼层
P. Poitras,J. Bissonnette,Alan Barkun a complete traversal of the network. The complexities in time and in number of messages of this algorithm are linear with respect to the size of the network (number of communication lines), which improves the exponential solution already known in the Byzantine case with some special assumptions.
发表于 2025-3-29 19:25:45 | 显示全部楼层
Charles Travis,Alexander von LünenFirst an abstract algorithm is presented and its safety and liveness properties are proved. Then a concrete, distributed algorithm is shown to correctly implement the abstract one. Experimental results of the transputer implementation are also reported.
发表于 2025-3-29 20:06:44 | 显示全部楼层
Steven Van Uytsel,Yoshiteru Uemurar the cases of one or two operations. We introduce a technique for reducing the number of operations considered in the analysis. Using this technique we extend the above results to all cases of three operations.
发表于 2025-3-30 02:39:29 | 显示全部楼层
P. Poitras,L. Tremblay,K. Orlicka properties; (ii) a single-source algorithm for outerplane graphs; and (iii) identifying any edge in an outerplane graph whose cost exceeds the distance between its endpoints. As an application, an efficient message routing scheme is presented which adapts to changing link conditions and routes along near-shortest paths.
发表于 2025-3-30 05:52:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-7 19:33
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表