找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Distributed Computing; 14th International C Maurice Herlihy Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithms.B

[复制链接]
查看: 25571|回复: 61
发表于 2025-3-21 17:06:48 | 显示全部楼层 |阅读模式
书目名称Distributed Computing
副标题14th International C
编辑Maurice Herlihy
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Distributed Computing; 14th International C Maurice Herlihy Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithms.B
描述DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last year’s DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The extended abstracts of this year’s invited lectures, by Jean-Claude Bermond and Sam Toueg, will appear in next year’s proceedings. We received over 100 regular submissions, a record for DISC. These s- missions were read and evaluated by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to accept many deserving papers. This year’s Best Student Paper award goes to “Polynomial and Adaptive Long-Lived (2k?1)-Renaming” by Hagit Attiya and Arie Fouren. Arie Fouren is the student author.
出版日期Conference proceedings 2000
关键词Algorithms; Broadcast; CORBA; Internet; Roadcasting; algorithm; distributed computing; algorithm analysis a
版次1
doihttps://doi.org/10.1007/3-540-40026-5
isbn_softcover978-3-540-41143-7
isbn_ebook978-3-540-40026-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

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




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




书目名称Distributed Computing网络公开度




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




书目名称Distributed Computing被引频次




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




书目名称Distributed Computing年度引用




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




书目名称Distributed Computing读者反馈




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




单选投票, 共有 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 23:24:49 | 显示全部楼层
发表于 2025-3-22 03:50:31 | 显示全部楼层
Bounds for Mutual Exclusion with only Processor Consistency,s. Processor Consistency-Goodman’s version (PC-G) is an exception. Ahamad et al.[l] showed that Peterson’s mutual exclusion algorithm is correct for PC-G, but Lamport’s bakery algorithm is not. In this paper, we derive a lower bound on the number and type (single- or multi-writer) of variables that
发表于 2025-3-22 05:15:48 | 显示全部楼层
Even Better DCAS-Based Concurrent Deques,blocking synchronization on tomorrow’s mul- tiprocessor machines. However, before such a primitive will be incorpo- rated into hardware design, its utility needs to be proven by developing a body of effective non-blocking data structures using DCAS..In a previous paper, we presented two linearizable
发表于 2025-3-22 09:32:26 | 显示全部楼层
发表于 2025-3-22 13:13:16 | 显示全部楼层
发表于 2025-3-22 19:38:14 | 显示全部楼层
发表于 2025-3-22 22:51:51 | 显示全部楼层
发表于 2025-3-23 05:12:13 | 显示全部楼层
Polynomial and Adaptive Long-lived (2,- 1)-Renaming,olynomial algorithm for long-lived (2ft - 1)- renaming. The algorithm is adaptive as its step complexity is O(k4); here k is the point contention-the maximal number of simultaneously active processes in some point of the execution. Polynomial step complexity is achieved by having processes help each
发表于 2025-3-23 09:22:36 | 显示全部楼层
Computing with Infinitely Many Processes,rticipate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, an
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 00:37
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表