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

Conservative garbage collection on distributed shared memory systems 分布式共享内存系统上的保守垃圾收集

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507988

Weimin Yu, A. Cox

{"title":"Conservative garbage collection on distributed shared memory systems","authors":"Weimin Yu, A. Cox","doi":"10.1109/ICDCS.1996.507988","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507988","url":null,"abstract":"In this paper we present the design and implementation of a conservative garbage collection algorithm for distributed shared memory (DSM) applications that use weakly-typed languages like C or C++, and evaluate its performance. In the absence of language support to identify references, our algorithm constructed a conservative approximation of the set of cross-node references based on local information only. It was also designed to tolerate memory inconsistency on DSM systems that use relaxed consistency protocols. These techniques enabled every node to perform garbage collections without communicating with others, effectively avoiding the high cost of cross-node communication in networks of workstations. We measured the performance of our garbage collector against explicit programmer management using three application programs. In two out of the three programs the performance of the GC version is within 15% of the explicit version. The results showed that the garbage collector has two effects on application programs. On one hand, it tends to reduce memory locality, increasing the communication cost; on the other hand, it may eliminate synchronization and memory accesses that would be incurred if memory were managed by the programmer reducing the communication cost.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115275163","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}

引用次数: 11

Lock-based self-stabilizing distributed mutual exclusion algorithms 基于锁的自稳定分布式互斥算法

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508023

M. Mizuno, Mikhail Nesterenko, H. Kakugawa

引用次数: 29

Context management and its applications to distributed transactions 上下文管理及其在分布式事务中的应用

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508020

A. Kshemkalyani, G. Samaras, Andrew Citron

引用次数: 5

Fast dynamic process migration 快速动态过程迁移

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508015

E. T. Rousch, R. Campbell

{"title":"Fast dynamic process migration","authors":"E. T. Rousch, R. Campbell","doi":"10.1109/ICDCS.1996.508015","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508015","url":null,"abstract":"Dynamic process migration supports load sharing and processor fault tolerance. We present the new freeze free algorithm for process migration, which uses six techniques to: reduce process migration latency by an order of magnitude to 19.9 ms, effectively eliminate message freeze times, and to support processor fault tolerance. The freeze free algorithm resumes execution after the transfer of four items: the combined process control and execution state, the current code page, the current heap page, and the current code page. The algorithm effectively eliminates message freeze time by separating the process state from the communication state, and thus allows message processing to proceed in parallel with process migration. The algorithm eliminates old host residual dependencies by flushing old host resident, modified data; while the process executes in parallel on the new host. The paper analyzes the costs in both the process migration latency period and the cross-network demand paging operations, and identifies further cost reductions. This paper demonstrates that small overhead is needed for good load sharing system speedup by measuring the impact of increasing overhead an speedup.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134052968","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}

引用次数: 30

Real-time scheduling using compact task graphs 实时调度使用紧凑的任务图

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507901

Rajiv Gupta, D. Mossé, Richard Suchoza

引用次数: 16

An adaptive job allocation method for multicomputer systems 多机系统的自适应作业分配方法

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507920

Chung-Yen Chang, P. Mohapatra

{"title":"An adaptive job allocation method for multicomputer systems","authors":"Chung-Yen Chang, P. Mohapatra","doi":"10.1109/ICDCS.1996.507920","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507920","url":null,"abstract":"The fragmentation problem in multicomputer systems reduces the system utilization and prohibits the systems from performing at their full capacity. In this paper, we propose a generic job allocation method for multicomputer systems based on job size reduction. We reduce the subsystem size requirement adaptively according to the availability of processors. The fragmentation problem is greatly alleviated by this approach. To ensure that the benefit of reducing fragmentation is not outweighed by the penalty of executing jobs on less number of processors, we restrict the number of times the size of a job can be reduced; hence the name restricted size reduction (RSR). Extensive simulations are conducted to validate the RSR method for hypercubes and mesh-based systems with different allocation algorithms. It is observed in both mesh and hypercube that by using the RSR method a simple algorithm can provide better performance than the more sophisticated allocation algorithms. We have also compared RSR method with the limit allocation that is based on a similar idea. Our method outperforms the limit allocation and provides better fairness to different size jobs. The performance gain, fairness, and low complexity makes the RSR method highly attractive.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131679953","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

Specializing object-oriented RPC for functionality and performance 专门化面向对象RPC的功能和性能

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507915

M. J. Zelesko, D. Cheriton

引用次数: 18

A scalable technique for implementing multiple consistency levels for distributed objects 一种可扩展的技术，用于为分布式对象实现多个一致性级别

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507971

R. Kordale, M. Ahamad

{"title":"A scalable technique for implementing multiple consistency levels for distributed objects","authors":"R. Kordale, M. Ahamad","doi":"10.1109/ICDCS.1996.507971","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507971","url":null,"abstract":"In large scale distributed systems, caching and replication could greatly speedup access and increase availability. Consistency of replicated state can be guaranteed by forcing operations to occur in the same order at all sites. However some applications can preserve correctness with weaker consistency requirements leading to better performance. We propose an object lifetime based mutual consistency detection mechanism that is used to implement multiple consistency levels. This mechanism provides scalable implementations because caching overheads at client nodes depend only on the accesses done at the node. A contribution of this paper is the separation of the the mutual consistency detection mechanism from the policy that decides the desired consistency guarantees. This allows multiple consistency levels to coexist, thus improving system performance through the use of weaker consistency levels when possible. Besides improving performance, the mechanism allows for a graceful weakening of consistency requirements when stronger requirements cannot be maintained, as in the case of disconnection that can be experienced in mobile environments. The mutual consistency detection mechanism also provides a uniform way of hoarding a mutually consistent set of objects during voluntary disconnection.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115923687","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

The performance value of shared network caches in clustered multiprocessor workstations 共享网络缓存在集群多处理器工作站中的性能价值

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.507902

J. Bennett, Katherine E. Fletcher, W. Speight

{"title":"The performance value of shared network caches in clustered multiprocessor workstations","authors":"J. Bennett, Katherine E. Fletcher, W. Speight","doi":"10.1109/ICDCS.1996.507902","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507902","url":null,"abstract":"This paper evaluates the benefit of adding a shared cache to the network interface as a means of improving the performance of networked workstations configured as a distributed shared memory multiprocessor. A cache on the network interface offers the potential benefits of retaining evicted processor cache lines, providing implicit prefetching, and increasing intra-cluster sharing. Using simulation, eight parallel scientific applications were used to evaluate the performance impact of a shared network cache. In each case, we examined in detail the means by which processor cache misses were satisfied. For the applications studied, we found that the network cache offers substantial performance benefit when processor caches are too small to hold the application's primary working set, or when network contention limits application performance. The expected benefits of implicit prefetching and increased intra-cluster sharing did not contribute significantly to the performance enhancement of the network cache for most applications. Finally, the advantage afforded by the network cache diminishes as processor cache size increases and network contention decreases.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124198854","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

An extended network scheduling model 一个扩展的网络调度模型

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI: 10.1109/ICDCS.1996.508028

L. Ming

引用次数: 0