Proceedings of 17th International Conference on Distributed Computing Systems最新文献

Hierarchical, adaptive cache consistency in a page server OODBMS 页面服务器OODBMS中的分层、自适应缓存一致性

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

Markos Zaharioudakis, M. Carey

引用次数: 8

Deadline assignment in distributed hard real-time systems with relaxed locality constraints 放宽局部性约束的分布式硬实时系统的最后期限分配

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

Jan Jonsson, K. Shin

{"title":"Deadline assignment in distributed hard real-time systems with relaxed locality constraints","authors":"Jan Jonsson, K. Shin","doi":"10.1109/ICDCS.1997.598077","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598077","url":null,"abstract":"In a real time system, tasks are constrained by global end to end deadlines. In order to cater for high task schedulability, these deadlines must be distributed over component subtasks in an intelligent way. Existing methods for automatic distribution of end to end deadlines are all based on the assumption that task assignments are entirely known beforehand. This assumption is not necessarily valid for large real time systems. Furthermore, most task assignment strategies require information on deadlines in order to make good assignments, thus forming a circular dependency between deadline distribution and task assignment. We present a heuristic approach that performs deadline distribution prior to task assignment. The deadline distribution problem is presented in the context of large distributed hard real time systems with relaxed locality constraints, where schedulability analysis must be performed offline, and only a subset of the tasks are constrained by predetermined assignments to specific processors. Using experimental results we identify drawbacks of previously proposed techniques, and then show that our solution provides significantly better performance for a large variety of system configurations.","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":"122363227","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}

引用次数: 46

Race analysis of traces of asynchronous message-passing programs 异步消息传递程序跟踪的竞争分析

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

Kuo-Chung Tai

引用次数: 24

A framework for environment aware mobile applications 环境感知移动应用程序的框架

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

G. Welling, B. R. Badrinath

引用次数: 25

Two new quorum based algorithms for distributed mutual exclusion 两种新的分布式互斥仲裁算法

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

W. Luk, T. Wong

引用次数: 175

A structured channel borrowing scheme for dynamic load balancing in cellular networks 蜂窝网络中用于动态负载平衡的结构化信道借用方案

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

Sajal K. Das, S. Sen, R. Jayaram

{"title":"A structured channel borrowing scheme for dynamic load balancing in cellular networks","authors":"Sajal K. Das, S. Sen, R. Jayaram","doi":"10.1109/ICDCS.1997.597878","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597878","url":null,"abstract":"We propose an efficient dynamic load balancing scheme in cellular networks for managing a teletraffic hot spot in which channel demand exceeds a certain threshold. A hot spot, depicted as a stack of hexagonal 'ring' of cells, is classified as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called 'peripheral rings'. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the 'rings' or 'peripheral rings' to the hot cells in the hot spot. For the more general case of an incomplete hot spot, a cold cell is further classified as cold safe, cold semi-safe or cold unsafe, and a demand graph is constructed from the channel demand of each hot cell from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"473 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":"114612920","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}

引用次数: 56

Distributed recovery with K-optimistic logging 使用k -乐观日志的分布式恢复

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

O. Damani, Yi-Min Wang, V. Garg

引用次数: 37

Comparison of two middleware data dissemination services in a wide-area distributed system 广域分布式系统中两种中间件数据分发服务的比较

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

G. R. Malan, F. Jahanian, Peter Knoop

{"title":"Comparison of two middleware data dissemination services in a wide-area distributed system","authors":"G. R. Malan, F. Jahanian, Peter Knoop","doi":"10.1109/ICDCS.1997.598075","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598075","url":null,"abstract":"The paper provides an experimental comparison of two middleware data dissemination services: a distributed object based service, and a message based service. The paper compares these two services in the context of a common application: a wide area network collaboratory, namely the Upper Atmospheric Research Collaboratory (UARC). UARC is an example of an application that reliably streams data from a set of suppliers to a set of receivers. This comparison highlights the tradeoffs between ease of implementation and performance for a data streaming middleware service. By relying on a rigid language primitive, namely remote method invocation, the object based dissemination service gave up the control over its transport policies. In contrast, the lower level socket based service was specifically constructed to provide a flexible interface to its applications. This flexibility allowed the middleware to better support data delivery to a heterogeneous set of receivers. This is important in a wide area distributed system where hosts are connected together over a broad spectrum of network links. The paper provides a concrete example of the effects of high level design choices in the implementation of a wide area distributed system's communication middleware.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"25 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":"125898996","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

WebWave: globally load balanced fully distributed caching of hot published documents WebWave:热发布文档的全局负载均衡全分布式缓存

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

Abdelsalam Heddaya, Sulaiman Mirdad

{"title":"WebWave: globally load balanced fully distributed caching of hot published documents","authors":"Abdelsalam Heddaya, Sulaiman Mirdad","doi":"10.1109/ICDCS.1997.597907","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597907","url":null,"abstract":"Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. We show that large scale dynamic caching can be employed to globally minimize server idle time, and hence maximize the aggregate server throughput of the whole service. To be efficient, scalable and robust, a successful caching mechanism must have three properties: (1) maximize the global throughput of the system; (2) find cache copies without recourse to a directory service, or to a discovery protocol; and (3) be completely distributed in the sense of operating only on the basis of local information. We develop a precise definition, which we call tree load balance (TLB), of what it means for a mechanism to satisfy these three goals. We present an algorithm that computes TLB offline, and a distributed protocol that induces a load distribution that converges quickly to a TLB one. Both algorithms place cache copies of immutable documents on the routing tree that connects the cached document's home server to its clients, thus enabling requests to stumble on cache copies en route to the home server.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"34 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":"129423817","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}

引用次数: 80

Distributed connection management for real-time communication over wormhole-routed networks 在虫洞路由网络上进行实时通信的分布式连接管理

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

S. Sundaresan, R. Bettati

引用次数: 4