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

Computing global functions in asynchronous distributed systems prone to process crashes 在异步分布式系统中计算全局函数容易导致进程崩溃

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

J. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel

{"title":"Computing global functions in asynchronous distributed systems prone to process crashes","authors":"J. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel","doi":"10.1109/ICDCS.2000.840973","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840973","url":null,"abstract":"Global data is a vector with one entry per process. Each entry must be filled with an appropriate value provided by the corresponding process. Several distributed computing problems amount to compute a function on global data. This paper proposes a protocol to solve such problems in the context of asynchronous distributed systems where processes may fail by crashing. The main problem that has to be solved lies in computing the global data and in providing each non-crashed process with a copy of it, despite the possible crash of some processes. To be consistent, the global data must contain (at least) all the values provided by the processes that do not crash. This defines the global data computation (GDC) problem. To solve this problem, processes execute a sequence of asynchronous rounds during which they construct (in a decentralized way) the value of the global data, and eventually each process gets a copy of it. To cope with process crashes, the protocol uses a perfect failure detector. The proposed protocol has been designed to be time-efficient. It allows early decisions. Let t be the maximum number of processes that may crash (t<n where n is the total number of processes) and f be the actual number of process crashes (f/spl les/t). In the worst case, the protocol terminates in min(2f+2,t+1) rounds. Moreover the protocol does not require processes to exchange information on their perception of crashes. The message size depends only on the size of the global data.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"13 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":"114946874","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}

引用次数: 15

Performance analysis of dynamic location updation strategies for mobile users 移动用户动态位置更新策略的性能分析

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

Asimava Bera, Nabanita Das

引用次数: 10

Popularity-aware greedy dual-size Web proxy caching algorithms 流行感知贪婪双大小Web代理缓存算法

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

Azer Bestavros, Shudong Jin

{"title":"Popularity-aware greedy dual-size Web proxy caching algorithms","authors":"Azer Bestavros, Shudong Jin","doi":"10.1109/ICDCS.2000.840936","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840936","url":null,"abstract":"Web caching aims at reducing network traffic, server load and user-perceived retrieval delays by replicating popular content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an online fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches. This trend points to the need for proxy cache replacement algorithms that directly capture popularity information. We present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy. We propose a novel cache replacement policy that uses such information to generalize the well-known greedy dual-size algorithm, and show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"58 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":"132750273","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}

引用次数: 190

MobileSpaces: a framework for building adaptive distributed applications using a hierarchical mobile agent system MobileSpaces:一个使用分层移动代理系统构建自适应分布式应用程序的框架

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

I. Satoh

引用次数: 143

An open real-time environment for parallel and distributed systems 一个开放的实时环境，用于并行和分布式系统

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

Tei-Wei Kuo, Kwei-Jay Lin, Yu-Chung Wang

引用次数: 21

Dynamic replica allocation using database migration in broadband networks 宽带网络中基于数据库迁移的动态副本分配

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

T. Hara, K. Harumoto, M. Tsukamoto, S. Nishio

引用次数: 14

A security architecture for mobile agents in Ajanta Ajanta中移动代理的安全体系结构

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

Neeran M. Karnik, A. Tripathi

引用次数: 65

Performance evaluation of soft real-time scheduling for multicomputer cluster 多机集群软实时调度性能评价

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

Weiping Zhu, B. Fleisch

引用次数: 21

Consistency requirements of distributed shared memory for Dijkstra's mutual exclusion algorithm 分布式共享内存对Dijkstra互斥算法的一致性要求

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

J. Brzeziński, D. Wawrzyniak

{"title":"Consistency requirements of distributed shared memory for Dijkstra's mutual exclusion algorithm","authors":"J. Brzeziński, D. Wawrzyniak","doi":"10.1109/ICDCS.2000.840978","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840978","url":null,"abstract":"As is well known any algorithm correct in an asynchronous shared memory setting (physically shared memory) can be directly applied in distributed shared memory (DSM) systems provided that the latter guarantees strong consistency (atomic or sequential) of replicas. Generally however, in DSM systems, weaker consistency models (causal, processor, PRAM, etc.) are often considered to improve the performance. A weakening consistency model may however imply the incorrectness of the algorithm. So we face a consistency requirement problem, the problem of finding the weakest consistency model of DSM that is sufficient and necessary for algorithm correctness. We consider a reliable DSM environment, and present a complex consistency model comprising three elementary models: sequential consistency, coherence and PRAM consistency. This complex model is then applied to Dijsktra's (1965) algorithm for mutual exclusion of n processes, one of the first solutions to a fundamental problem in both centralised and distributed operating systems. In the resulting algorithm, coherence and PRAM consistency are associated with some write operations performed at shared memory locations. As concurrent execution of write operations with weaker consistency models is more efficient when compared to the execution of strongly consistent operations, the proposed solution reduces synchronisation delay (mutual exclusion overhead) and thereby increases system throughput. The presented model is proven to be sufficient for algorithm correctness. Moreover, the algorithm is shown to be optimal in the sense that further relaxation of any write operations semantics violates progress (liveness) or safety of the algorithm.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"70 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":"126391765","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}

引用次数: 3

Active files: a mechanism for integrating legacy applications into distributed systems 活动文件:一种将遗留应用程序集成到分布式系统中的机制

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

P. Dasgupta, Ayal Itzkovitz, V. Karamcheti

{"title":"Active files: a mechanism for integrating legacy applications into distributed systems","authors":"P. Dasgupta, Ayal Itzkovitz, V. Karamcheti","doi":"10.1109/ICDCS.2000.840985","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840985","url":null,"abstract":"Despite increasingly distributed Internet information sources with diverse storage formats and access-control constraints, most of the end applications (e.g. filters and media players) that view and manipulate data from these sources operate against a traditional file-based interface. These legacy applications need to be rewritten to access remote sources, or need to rely upon ad-hoc intermediary applications that aggregate the data into a passive file before executing the legacy application. This paper presents a simple, elegant, programmable method for allowing natural integration of legacy applications into distributed system infrastructures, The approach, called \"active files\", enables multiple information sources to be encapsulated as a local file that serves as their logical proxy. This local file is accessed though a sentinel process, which automatically starts when the file is opened, aggregates data from multiple sources, and filters all access to and from the file. More importantly, the integration of active files into client applications is transparent: an active file is virtually indistinguishable from a regular file. Active files find a variety of applications in both distributed and non-distributed systems. We discuss active files, their semantics, their usage and their implementations in Windows NT.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"1 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":"116610588","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