Proceedings 22nd International Conference on Distributed Computing Systems最新文献_第6页

Query optimization to meet performance targets for wide area applications 查询优化，以满足广域应用的性能目标

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022264

V. Zadorozhny, L. Raschid

引用次数: 8

Group-based management of distributed file caches 基于组的分布式文件缓存管理

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022302

A. Amer, D. Long, R. Burns

引用次数: 55

Partial database replication using epidemic communication 使用流行通信的部分数据库复制

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022298

J. Holliday, D. Agrawal, A. E. Abbadi

引用次数: 49

Extending RMI to support dynamic reconfiguration of distributed systems 扩展RMI以支持分布式系统的动态重新配置

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022278

Xuejun Chen

引用次数: 35

Dynamic replica control based on fairly assigned variation of data with weak consistency for loosely coupled distributed systems 松散耦合分布式系统中基于弱一致性数据公平分配的动态副本控制

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022265

T. Yamashita

引用次数: 7

Dynamic QoS-aware multimedia service configuration in ubiquitous computing environments 泛在计算环境下的动态qos感知多媒体业务配置

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022268

Xiaohui Gu, K. Nahrstedt

{"title":"Dynamic QoS-aware multimedia service configuration in ubiquitous computing environments","authors":"Xiaohui Gu, K. Nahrstedt","doi":"10.1109/ICDCS.2002.1022268","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022268","url":null,"abstract":"Ubiquitous computing promotes the proliferation of various stationary, embedded and mobile devices interconnected by heterogeneous networks. It leads to a highly dynamic distributed system with many devices and services coming and going frequently. Many emerging distributed multimedia applications are being deployed in such a computing environment. In order to make the experience for a user truly seamless and to provide soft performance guarantees, we must meet the following challenges: (1) users should be able to perform tasks continuously, despite changes of resources, devices and locations; (2) users should be able to efficiently utilize all accessible resources within runtime environments to receive the best possible Quality-of-Service (QoS). In this paper, we propose an integrated QoS-aware service configuration model to address the above problems. The configuration model includes two tiers: (1) service composition tier, which is responsible for choosing and composing current available service components appropriately and coordinating arbitrary interactions between them to achieve the user's objectives; and (2) service distribution tier which is responsible for dividing an application into several partitions and distributing them to different available devices appropriately. Our initial experimental results based on both prototype and simulations show the soundness of our model and algorithms.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121930630","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}

引用次数: 47

A fully distributed framework for cost-sensitive data mining 用于成本敏感数据挖掘的完全分布式框架

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022284

Wei Fan, Haixun Wang, Philip S. Yu, S. Stolfo

引用次数: 12

Formally verified Byzantine agreement in presence of link faults 在链路故障的情况下正式验证拜占庭协议

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022311

U. Schmid, Bettina Weiss, J. Rushby

{"title":"Formally verified Byzantine agreement in presence of link faults","authors":"U. Schmid, Bettina Weiss, J. Rushby","doi":"10.1109/ICDCS.2002.1022311","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022311","url":null,"abstract":"This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of Gray (1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for both nodes and links, we provide a formally verified proof that the m+1-round Byzantine agreement algorithm OMH (Lincoln and Rushby (1993)) requires n > 2f/sub l//sup s/ + f/sub l//sup r/ + f/sub l//sup ra/ + 2(f/sub a/ + f/sub s/) + f/sub o/ + f/sub m/ + m nodes for transparently masking at most f/sub l//sup s/ broadcast and f/sub l//sup r/ receive link faults (including at most f/sub l//sup ra/ arbitrary ones) per node in each round, in addition to at most f/sub a/, f/sub s/, f/sub o/, f/sub m/ arbitrary, symmetric, omission, and manifest node faults, provided that m /spl ges/ f/sub a/ + f/sub o/ + 1. Our approach to modeling link faults is justified by a number of theoretical results, which include tight lower bounds for the required number of nodes and an analysis of the assumption coverage in systems where links fail independently with some probability p.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"124 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126272225","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}

引用次数: 49

Adaptive and virtual reconfigurations for effective dynamic job scheduling in cluster systems 集群系统中有效动态作业调度的自适应和虚拟重构

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022240

Songqing Chen, Li Xiao, Xiaodong Zhang

{"title":"Adaptive and virtual reconfigurations for effective dynamic job scheduling in cluster systems","authors":"Songqing Chen, Li Xiao, Xiaodong Zhang","doi":"10.1109/ICDCS.2002.1022240","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022240","url":null,"abstract":"In a cluster system with dynamic load sharing support, a job submission or migration to a workstation is determined by the availability of CPU and memory resources of the workstation at the time. In such a system, a small number of running jobs with unexpectedly large memory allocation requirements may significantly increase the queuing delay times of the rest of jobs with normal memory requirements, slowing down executions of individual jobs and decreasing the system throughput. We call this phenomenon as the job blocking problem because the big jobs block the execution pace of majority jobs in the cluster. We propose a software method incorporating with dynamic load sharing, which adaptively reserves a small set of workstations through virtual cluster reconfiguration to provide special services to the jobs demanding large memory allocations. This policy implies the principle of shortest-remaining-processing-time policy. As soon as the blocking problem is resolved by the reconfiguration, the system will adaptively switch back to the normal load sharing state. We present three contributions in this study. (1) the conditions to cause the job blocking problem; (2) the adaptive software method in a dynamic load sharing system; and (3) trace-driven simulations. We show that our method can effectively improve the cluster computing performance by quickly resolving the job blocking problem. The effectiveness and performance insights are also analytically verified.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220319","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}

引用次数: 17

Using predeclaration for efficient read-only transaction processing in wireless data broadcast 利用预声明实现无线数据广播中高效的只读事务处理

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022282

SangKeun Lee, C. Hwang, M. Kitsuregawa

引用次数: 16