Proceedings of 17th International Conference on Distributed Computing Systems最新文献_第2页

Aggressive release consistency for software distributed shared memory 软件分布式共享内存的严格发布一致性

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598054

S. Fu, N. Tzeng

引用次数: 4

Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events 通过跟踪相关突变事件的因果关系，实现全面的分布式垃圾收集

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603403

S. Louboutin, V. Cahill

{"title":"Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events","authors":"S. Louboutin, V. Cahill","doi":"10.1109/ICDCS.1997.603403","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603403","url":null,"abstract":"Comprehensive distributed garbage collection in object-oriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardise the scalability of these approaches: the bottleneck associated with having to reach a global consensus before any resource can actually be reclaimed; and the overhead of eager log-keeping. This paper describes an alternative approach to comprehensive distributed garbage collection that entails computing the vector-time characterising the causal history of some relevant events of the mutator processes computations. Knowing the causal histories of these events makes it possible to identify garbage objects that are not identifiable by means of per-site garbage collection alone. Computing the vector-times necessary to identify garbage is possible without the unbounded space overheads usually associated with dynamically reconstructing vector-times of arbitrary events of distributed computations. Our approach integrates a lazy log-keeping mechanism and therefore tackles both of the aforementioned stumbling blocks of distributed garbage collection.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251695","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}

引用次数: 12

A quality of service based allocation and routing algorithm for distributed, heterogeneous real time systems 一种基于服务质量的分布式异构实时系统分配和路由算法

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598039

S. Chatterjee

{"title":"A quality of service based allocation and routing algorithm for distributed, heterogeneous real time systems","authors":"S. Chatterjee","doi":"10.1109/ICDCS.1997.598039","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598039","url":null,"abstract":"An increasing number of applications execute over a set of computing and communication resources and have end-to-end quality of service (QoS) requirements. Given a system and an application with specific flow structure and QoS requirements, this paper describes an integrated QoS-based allocation and routing algorithm that determines which computing and communication resources to utilize for this application. More specifically, the algorithm finds the best flow path for an application, subject to application flow and QoS constraints, so as to optimize system objectives (e.g., minimize total system utilization or balance the load). The paper also introduces a /spl Delta/-optimal algorithm that, relative to the optimal algorithm, significantly reduces the run-time of the algorithm with a minor degradation in the optimality of the solution. The /spl Delta/-optimal algorithm is guaranteed to produce a result that is at most /spl Delta/-units sub-optimal. The paper also analyzes the optimality and run time of the solution as a function of /spl Delta/ for two multimedia scenarios. Rules of thumb for setting /spl Delta/ are also given.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126477405","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}

引用次数: 13

Centralized failure injection for distributed, fault-tolerant protocol testing 集中故障注入用于分布式、容错协议测试

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597856

G. A. Alvarez, F. Cristian

引用次数: 22

A fault-tolerant object service on CORBA CORBA上的容错对象服务

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598073

Deron Liang, Chen-Liang Fang, S. Yuan, Chyouhwa Chen, G. Jan

引用次数: 54

Improving performance of TCP over wireless networks 提高无线网络上TCP的性能

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598070

B. S. Bakshi, P. Krishna, N. Vaidya, D. Pradhan

{"title":"Improving performance of TCP over wireless networks","authors":"B. S. Bakshi, P. Krishna, N. Vaidya, D. Pradhan","doi":"10.1109/ICDCS.1997.598070","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598070","url":null,"abstract":"Transmission Control Protocol (TCP) assumes a relatively reliable underlying network where most packet losses are due to congestion. In a wireless network, however, packet losses will occur more often due to unreliable wireless links than due to congestion. When using TCP over wireless links, each packet loss on the wireless link results in congestion control measures being invoked at the source. This causes severe performance degradation. In this paper, we study the effect of: burst errors on wireless links; packet size variation on the wired network; local error recovery by the base station; and explicit feedback by the base station, on the performance of TCP over wireless networks. It is shown that the performance of TCP is sensitive to the packet size, and that significant performance improvements are obtained if a good packet size is used. While local recovery by the base station using link-level retransmissions is found to improve performance, timeouts can still occur at the source, causing redundant packet retransmissions. We propose an explicit feedback mechanism, to prevent these timeouts during local recovery. Results indicate significant performance improvements when explicit feedback from the base station is used. A major advantage of our approaches over existing proposals is that no state maintenance is required at any intermediate host. Experiments are performed using the Network Simulator (NS) from Lawrence Berkeley Labs. The simulator has been extended to incorporate wireless link characteristics.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115816510","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}

引用次数: 129

Access control in wide-area networks 广域网中的访问控制

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598064

M. Hiltunen, R. Schlichting

引用次数: 0

Scheduling algorithms for distributed Web servers 分布式Web服务器的调度算法

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598025

M. Colajanni, P. Yu, D. Dias

引用次数: 58

Efficient load balancing in interconnected LANs using group communication 使用群通信的互联局域网的有效负载平衡

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597900

C. Hui, S. Chanson

引用次数: 9

Synthesizing protocol specifications from service specifications in timed extended finite state machines 从定时扩展有限状态机的服务规范中合成协议规范

Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598044

Jun-Cheol Park, Raymond E. Miller

{"title":"Synthesizing protocol specifications from service specifications in timed extended finite state machines","authors":"Jun-Cheol Park, Raymond E. Miller","doi":"10.1109/ICDCS.1997.598044","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598044","url":null,"abstract":"We propose a specification model and present a method to algorithmically derive a protocol specification from a service specification based on the model. Unlike the previous models based on finite state machines, the proposed model can explicitly express concurrency, synchronization, and timing requirements such as delays and timeouts. We assume that there exists a reliable communication channel between say two protocol entities and the maximum delay for each channel is bounded by a positive constant. Because of the variable nature of the communication delays along with the time constraints associated with events, no protocol specification can fully simulate the service specification. The proposed method derives a protocol specification that is optimal in the sense that it provides the largest possible subset of the service specification under the communication delay constraints. We also give a method to derive a sub specification from a service specification and a maximum communication delay of each channel such that the sub specification, but no superset of it, can be simulated by the derived protocol specification.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972728","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}

引用次数: 21