Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)最新文献

筛选
英文 中文
LBF: a performance metric for program reorganization LBF:程序重组的性能度量
Hyeonsang Eom, J. Hollingsworth
{"title":"LBF: a performance metric for program reorganization","authors":"Hyeonsang Eom, J. Hollingsworth","doi":"10.1109/ICDCS.1998.679505","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679505","url":null,"abstract":"We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133164561","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}
引用次数: 6
Distributed predicate detection in a faulty environment 故障环境下的分布式谓词检测
V. Garg, J. Mitchell
{"title":"Distributed predicate detection in a faulty environment","authors":"V. Garg, J. Mitchell","doi":"10.1109/ICDCS.1998.679770","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679770","url":null,"abstract":"There has been very little research in distributed predicate detection for faulty, asynchronous environments. We define a class of predicates called set decreasing predicates which can be detected in such an environment. We introduce a set of failure detectors called infinitely often accurate detectors which are implementable in asynchronous systems. Based on these failure detectors we present an algorithm to detect conjunction of local predicates and send-monotonic channel predicates. Since perfect failure detection is impossible in an asynchronous system, we cannot guarantee that our detection algorithm will not have false detections. However, if the predicate ever holds then it is guaranteed to be detected.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130249076","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
Using leases to support server-driven consistency in large-scale systems 利用租约支持大规模系统中服务器驱动的一致性
Jian Yin, L. Alvisi, M. Dahlin, Calvin Lin
{"title":"Using leases to support server-driven consistency in large-scale systems","authors":"Jian Yin, L. Alvisi, M. Dahlin, Calvin Lin","doi":"10.1109/ICDCS.1998.679726","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679726","url":null,"abstract":"The paper introduces volume leases as a mechanism for providing cache consistency for large scale, geographically distributed networks. Volume leases are a variation of leases, which were originally designed for distributed file systems. Using trace driven simulation, we compare two new algorithms against four existing cache consistency algorithms and show that our new algorithms provide strong consistency while maintaining scalability and fault tolerance. For a trace based workload of Web accesses, we find that volumes can reduce message traffic at servers by 40% compared to a standard lease algorithm, and that volumes can considerably reduce the peak load at servers when popular objects are modified.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355018","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}
引用次数: 64
A suite of database replication protocols based on group communication primitives 一套基于组通信原语的数据库复制协议
Bettina Kemme, G. Alonso
{"title":"A suite of database replication protocols based on group communication primitives","authors":"Bettina Kemme, G. Alonso","doi":"10.1109/ICDCS.1998.679498","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679498","url":null,"abstract":"This paper proposes a family of replication protocols based on group communication in order to address some of the concerns expressed by database designers regarding existing replication solutions. Due to these concerns, current database systems allow inconsistencies and often resort to centralized approaches, thereby reducing some of the key advantages provided by replication. The protocols presented in this paper take advantage of the semantics of group communication and use related isolation guarantees to eliminate the possibility of deadlocks, reduce the message overhead, and increase performance. A simulation study shows the feasibility of the approach and the flexibility with which different types of bottlenecks can be circumvented.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126800597","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}
引用次数: 167
Detectors and correctors: a theory of fault-tolerance components 检测器和校正器:容错组件的理论
A. Arora, S. Kulkarni
{"title":"Detectors and correctors: a theory of fault-tolerance components","authors":"A. Arora, S. Kulkarni","doi":"10.1109/ICDCS.1998.679772","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679772","url":null,"abstract":"Two primitive components, namely detectors and correctors, provide a basis for achieving the different types of fault tolerance properties required in computing systems. We develop the theory of these primitive tolerance components, characterizing precisely their role in achieving the different types of fault tolerance. Also, we illustrate how they can be used to formulate extant design methods and argue that they sometimes offer the potential for better designs than those obtained from extant methods.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121505166","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}
引用次数: 150
A statistical method for time synchronization of computer clocks with precisely frequency-synchronized oscillators 具有精确频率同步振荡器的计算机时钟时间同步的统计方法
T. Yamashita, S. Ono
{"title":"A statistical method for time synchronization of computer clocks with precisely frequency-synchronized oscillators","authors":"T. Yamashita, S. Ono","doi":"10.1109/ICDCS.1998.679484","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679484","url":null,"abstract":"With the growing of computer networks, continuous media communication and processing are expected in distributed systems. Continuous media communication and processing require both time and frequency synchronization between computer clocks. The authors propose a statistical time synchronization method for computer clocks that have precisely frequency-synchronized oscillators. This method not only improves time synchronization accuracy but also prevents degradation of the frequency stability of the precise oscillators when errors in the measured time offset between computer clocks caused by network traffic possess a Gaussian distribution. The improvement of time synchronization accuracy is achieved by estimating the confidence interval of the measured time offsets between the computer clocks. The prevention of frequency stability degradation is achieved by testing the difference between the latest mean and the mean at the last time adjustment for deciding the need for time correction. Evaluation by simulation of changes in the time offset in an ISDN clock synchronization system showed that this method achieves accurate time and stable frequency synchronization.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121905559","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}
引用次数: 5
Consistency conditions for multi-object distributed operations 多对象分布式操作的一致性条件
N. Mittal, V. Garg
{"title":"Consistency conditions for multi-object distributed operations","authors":"N. Mittal, V. Garg","doi":"10.1109/ICDCS.1998.679835","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679835","url":null,"abstract":"The traditional distributed shared memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore, multi-object operations such as double compare and swap, and atomic m-register assignment cannot be efficiently expressed in this model. We extend the traditional DSM model to allow operations to span multiple objects. We show that memory consistency conditions such as sequential consistency and linearizability can be extended to this general model. We also provide algorithms to implement these consistency conditions in a distributed system.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123493057","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}
引用次数: 16
Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels 使用扩展安全级别的网状连接多计算机中的容错自适应最小路由
Jie Wu
{"title":"Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels","authors":"Jie Wu","doi":"10.1109/ICDCS.1998.679771","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679771","url":null,"abstract":"The minimal routing problem in mesh-connected multicomputers with faulty blocks is studied. Two dimensional (2D) meshes are used to illustrate the approach. A sufficient condition for minimal routing in 2D meshes with faulty blocks is proposed. Unlike many other models that assume all the nodes know global fault distribution, our approach is based on the concept of an extended safety level which is a special form of limited fault information. Fault information is distributed to a limited number of nodes while it is still sufficient to support minimal routing. We study the existence of minimal paths at a given source node, limited distribution of fault information, and minimal routing itself. The proposed approach is also adaptive which allows all messages to use any minimal path. Our approach is the first attempt to address adaptive and minimal routing in 2D meshes with faulty blocks using limited fault information.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115654713","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}
引用次数: 61
NFS/M: an open platform mobile file system NFS/M:开放平台移动文件系统
John C.S. Lui, Oldfield K. Y. So, T. Tam
{"title":"NFS/M: an open platform mobile file system","authors":"John C.S. Lui, Oldfield K. Y. So, T. Tam","doi":"10.1109/ICDCS.1998.679783","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679783","url":null,"abstract":"With the advancement of wireless networks and mobile computing, there is an increasing need to build a mobile file system that can perform efficiently and correctly for accessing online information. Previous system research on mobile file systems is based on some experimental platforms. We describe the design and implementation of a mobile file system on an open platform, the Linux kernel, and at the same time, our mobile file system is compatible with the popular NFS 2.0 protocol. We formally define the file semantics of our mobile file system, which we called NFS/M. We also specify the conditions of object conflict as well as our conflict resolution algorithms. NFS/M supports client side caching, data prefetching, file system service during the disconnected mode, data reintegration and conflict resolution on various file system objects. Since the NFS/M is based on an open platform, it serves as a basic building block for developing future mobile computing applications.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121254978","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}
引用次数: 14
Decentralized micropayment consolidation 分散的小额支付整合
J. Chomicki, S. Naqvi, M. Pucci
{"title":"Decentralized micropayment consolidation","authors":"J. Chomicki, S. Naqvi, M. Pucci","doi":"10.1109/ICDCS.1998.679733","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679733","url":null,"abstract":"We propose a novel protocol for aggregating micropayments in a networked environment. The protocol is based on the idea of debt consolidation and is fully decentralized. We propose client server and serverless versions of the protocol. We also analyze the mathematical properties of the protocol. Finally, we show how basic cryptographic techniques can be used to support the operation of the protocol in an untrusted environment.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128261019","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}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信