Proceedings 20th IEEE International Conference on Distributed Computing Systems最新文献_第6页

A multi-version approach to conflict resolution in distributed groupware systems 分布式群件系统中冲突解决的多版本方法

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840944

Chengzheng Sun, David Chen

{"title":"A multi-version approach to conflict resolution in distributed groupware systems","authors":"Chengzheng Sun, David Chen","doi":"10.1109/ICDCS.2000.840944","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840944","url":null,"abstract":"Groupware systems are a special class of distributed computing systems which support human-computer-human interaction. Real-time collaborative graphics editors allow a group of users to view and edit the same graphics document at the same time from geographically dispersed sites connected by communication networks. Resolving conflict access to shared objects is one of the core issues in the design of this type of system. This paper proposes a novel distributed multi-version approach to conflict resolution. This approach aims to preserve the work concurrently produced by multiple users in the face of conflicts, and to minimize the number of object versions for accommodating combined effects of conflicting and compatible operations. Major technical contributions of this work include a formal specification of a unique combined effect for any group of conflicting and compatible operations, a distributed algorithm for incremental creation of multiple object versions, and a consistent object identification scheme for multi-version and multireplica graphics editing systems. All algorithms and schemes preserved in this paper have been used in the GRACE (Graphics Collaborative Editing) system implemented in Java.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125222375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48

A dynamic distributed video on demand service 动态分布式视频点播服务

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840962

C. Bouras, V. Kapoulas, Agisilaos Konidaris, A. Sevasti

引用次数: 6

Coherence-based coordinated checkpointing for software distributed shared memory systems 基于一致性的软件分布式共享内存系统协调检查点

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840970

A. Kongmunvattana, Santipong Tanchatchawal, N. Tzeng

{"title":"Coherence-based coordinated checkpointing for software distributed shared memory systems","authors":"A. Kongmunvattana, Santipong Tanchatchawal, N. Tzeng","doi":"10.1109/ICDCS.2000.840970","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840970","url":null,"abstract":"Fault-tolerant techniques that can cope with system failures in software distributed shared memory (SDSM) are essential for creating productive and highly available parallel computing environments on clusters of workstations. We propose a new, efficient coordinated checkpointing technique, called coherence-based coordinated checkpointing (CCC), for SDSM. Our CCC minimizes both the checkpointing overhead during failure-free execution and the cost of recovery from failures by leveraging existing coherence information maintained by SDSM. In the presence of system failures, it allows SDSM to recover from the most recent checkpoint, saving the re-computation time. We have performed experiments on a cluster of eight Sun Ultra-5 workstations, comparing our CCC technique against both simple coordinated checkpointing (SCC) and incremental coordinated checkpointing (ICC) techniques by actually implementing these techniques in TreadMarks, a stare-of-the-art SDSM system. The experimental results demonstrate that our CCC technique consistently outperforms both SCC and ICC techniques. In particular our technique increases the execution time slightly by 0.5% to 4% for a 2-minute checkpointing interval during failure-free execution, while SCC and ICC techniques result in the execution time overhead of 4% to 100% and 3% to 64%, respectively for the same checkpointing interval.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 22

Understanding replication in databases and distributed systems 了解数据库和分布式系统中的复制

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840959

F. Pedone, M. Wiesmann, A. Schiper, Bettina Kemme, G. Alonso

引用次数: 422

An application-transparent, platform-independent approach to rollback-recovery for mobile agent systems 一种应用程序透明、平台独立的移动代理系统回滚恢复方法

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840971

E. Gendelman, L. Bic, M. Dillencourt

引用次数: 42

Precluding useless events for on-line global predicate detections 排除在线全局谓词检测的无用事件

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840984

Li-Hsing Yen

引用次数: 3

Neural nets based predictive prefetching to tolerate WWW latency 基于神经网络的预测预取容忍WWW延迟

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840980

Tamer I. Ibrahim, Chengzhong Xu

{"title":"Neural nets based predictive prefetching to tolerate WWW latency","authors":"Tamer I. Ibrahim, Chengzhong Xu","doi":"10.1109/ICDCS.2000.840980","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840980","url":null,"abstract":"With the explosive growth of WWW applications on the Internet, users are experiencing access delays more often than ever. Recent studies showed that prefetching could alleviate the WWW latency to a larger extent than caching. Existing prefetching methods are mostly based on URL graphs. They use the graphical nature of hypertext links to determine the possible paths through a hypertext system. While they have been demonstrated effective in prefetching of documents that are often accessed, they are incapable of pre-retrieving documents whose URLs had never been accessed. We propose a context-specific prefetching technique to overcome the limitation. It relies on keywords in anchor texts of URLs to characterize user access patterns and on neural networks over the keyword set to predict future requests. It features a self-learning capability and good adaptivity to the change of user surfing interest. The technique was implemented in a SmartNewsReader system and cross-examined in a daily browsing of MSNBC and CNN news sites. The experimental results showed an achievement of approximately 60% hit ratio due to prefetching. Of the prefetched documents, less than 30% was undesired.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122013589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 57

On supporting weakly-connected browsing in a mobile Web environment 关于在移动Web环境中支持弱连接浏览

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840968

A. Si, H. Leong, D. McLeod, Stanley M. T. Yau

{"title":"On supporting weakly-connected browsing in a mobile Web environment","authors":"A. Si, H. Leong, D. McLeod, Stanley M. T. Yau","doi":"10.1109/ICDCS.2000.840968","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840968","url":null,"abstract":"A mobile environment is weakly-connected, characterized by low communication bandwidth and poor connectivity. The conventional paradigm for surfing mobile Web documents is ineffective since portions of a document could be corrupted during transmission and it is expensive to re-transmit the whole document. It is important that the high content-bearing portions should be transmitted successfully so that a mobile client could at least obtain a high level content and determine if the corrupted portions need to be retransmitted. We have proposed a multi-resolution transmission paradigm which allows higher content-bearing portions of a Web document to be transmitted, by partitioning it into multiple organizational units and associating an information content with each unit. The client can explore the higher content-bearing portion earlier and terminate browsing an irrelevant document sooner. We extend our previous work and propose a fault-tolerant multi-resolution transmission scheme which allows units of higher information content to be recovered from transmission error. The client can obtain an overall content of a Web document and either terminate the transmission of the remaining portions or decide if the corrupted portions need to be retransmitted. We demonstrate its feasibility with a prototype and with simulation results.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129115767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Deterministic optimal routing for two heterogeneous parallel servers 两个异构并行服务器的确定性最优路由

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840906

K. Oida, K. Shinjo

引用次数: 4

Secure group communication in asynchronous networks with failures: integration and experiments 故障异步网络中的安全组通信:集成和实验

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840945

J. Stanton, Y. Amir, D. Hasse, G. Ateniese, Yongdae Kim, C. Nita-Rotaru, Theo Schlossnagle, John L. Schultz, G. Tsudik

{"title":"Secure group communication in asynchronous networks with failures: integration and experiments","authors":"J. Stanton, Y. Amir, D. Hasse, G. Ateniese, Yongdae Kim, C. Nita-Rotaru, Theo Schlossnagle, John L. Schultz, G. Tsudik","doi":"10.1109/ICDCS.2000.840945","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840945","url":null,"abstract":"The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge, This paper discusses some important integration issues, reports on our implementation experience and provides experimental results. Our approach utilizes distributed group key management developed by the Cliques project. We enhance it to handle processor and network faults (under a fail-stop or crash-and-recover model) and asynchronous membership events (such as joins, leaves, merges and network partitions). Our approach leverages the strong properties provided by the Spread group communication system, such as message ordering, clean failure semantics and a membership service. The result of this work is a secure group communications layer and an API that provide the application programmer with both standard group communication services and flexible security services.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122107643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 67