找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 25677|回復(fù): 61
樓主
發(fā)表于 2025-3-21 17:06:48 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Distributed Computing
副標(biāo)題14th International C
編輯Maurice Herlihy
視頻videohttp://file.papertrans.cn/282/281789/281789.mp4
概述Includes supplementary material:
叢書(shū)名稱Lecture Notes in Computer Science
圖書(shū)封面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
關(guān)鍵詞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

書(shū)目名稱Distributed Computing影響因子(影響力)




書(shū)目名稱Distributed Computing影響因子(影響力)學(xué)科排名




書(shū)目名稱Distributed Computing網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Distributed Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Distributed Computing被引頻次




書(shū)目名稱Distributed Computing被引頻次學(xué)科排名




書(shū)目名稱Distributed Computing年度引用




書(shū)目名稱Distributed Computing年度引用學(xué)科排名




書(shū)目名稱Distributed Computing讀者反饋




書(shū)目名稱Distributed Computing讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:24:49 | 只看該作者
板凳
發(fā)表于 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
地板
發(fā)表于 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
5#
發(fā)表于 2025-3-22 09:32:26 | 只看該作者
6#
發(fā)表于 2025-3-22 13:13:16 | 只看該作者
7#
發(fā)表于 2025-3-22 19:38:14 | 只看該作者
8#
發(fā)表于 2025-3-22 22:51:51 | 只看該作者
9#
發(fā)表于 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
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 23:38
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
龙南县| 巴林左旗| 前郭尔| 白山市| 永靖县| 宿迁市| 郴州市| 玉山县| 蓝田县| 上杭县| 敦煌市| 灯塔市| 华蓥市| 安平县| 咸宁市| 张掖市| 汾阳市| 黑河市| 临湘市| 宣化县| 衡东县| 巫山县| 塔城市| 中西区| 八宿县| 河西区| 平阳县| 即墨市| 社旗县| 博白县| 开江县| 宜城市| 井研县| 清丰县| 佳木斯市| 阳高县| 敦煌市| 盐亭县| 金川县| 六安市| 泗洪县|