发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
An efficient logging scheme for recoverable distributed shared memory systems 可恢复分布式共享内存系统的有效日志记录方案
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598058
T. Park, S. Cho, H. Yeom
{"title":"An efficient logging scheme for recoverable distributed shared memory systems","authors":"T. Park, S. Cho, H. Yeom","doi":"10.1109/ICDCS.1997.598058","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598058","url":null,"abstract":"The paper presents a new logging scheme for recoverable distributed shared memory systems. In previous schemes, the logging is performed whenever a new data item is accessed or written by a process. However, in the proposed scheme, only the data item accessed by multiple processes is logged when it is invalidated by the overwritten. Moreover, the logging is performed at one process responsible for that data item, unlike the other schemes in which every process accessing the data item performs the logging. As a result, the amount and the frequency of logging can be significantly reduced. The performance of the proposed scheme is analyzed using extensive simulation study and our new logging scheme shows superior performance in various system environments.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"31 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":"130248627","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
Messages versus messengers in distributed programming 分布式编程中的消息与信使
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598068
M. Fukuda, L. Bic, M. Dillencourt, J. M. Cahill
{"title":"Messages versus messengers in distributed programming","authors":"M. Fukuda, L. Bic, M. Dillencourt, J. M. Cahill","doi":"10.1109/ICDCS.1997.598068","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598068","url":null,"abstract":"Messengers are autonomous objects, each capable of navigating through the underlying network and performing various tasks at each node. Messenger applications are written using navigational commands rather than the send/receive primitives of conventional message-passing approaches. In this paper we contrast the two programming styles. The navigational style generally results in a smaller semantic gap between abstract algorithm descriptions and their actual implementations, which makes programs easier to construct, understand, and maintain. Other advantages of the navigational programming style include the ability to compute in unknown or dynamically changing network topologies.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"5 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":"121829868","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}
引用次数: 36
Predictable network computing 可预测网络计算
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598076
A. Polze, G. Fohler, Matthias Werner
{"title":"Predictable network computing","authors":"A. Polze, G. Fohler, Matthias Werner","doi":"10.1109/ICDCS.1997.598076","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598076","url":null,"abstract":"Clusters of networked commercial, off the shelf (COTS) workstations are presently used for computation intensive tasks that were typically assigned to parallel computers in the past. However, it is hardly possible to predict the timing behavior of such systems or to give guarantees about execution times. We show how our SONiC (Shared Objects Net-interconnected Computer) system can control timing and partitioning of a workstation as a step towards a distributed real time system built from COTS components. SONiC provides a class based programming interface for creation of replicated shared objects of arbitrary, user defined sizes. Weak consistency protocols are employed to improve system performance. Our scheduling service ensures the requested interactive behavior of a workstation while simultaneously giving a specified number of CPU cycles to parallel tasks. Using offline scheduling methods we are able to implement real time guaranteed services on COTS workstations.","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":"130687235","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
Indexed sequential data broadcasting in wireless mobile computing 无线移动计算中的索引顺序数据广播
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597887
Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu
{"title":"Indexed sequential data broadcasting in wireless mobile computing","authors":"Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu","doi":"10.1109/ICDCS.1997.597887","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597887","url":null,"abstract":"Energy saving is one of the most important issues in wireless mobile computing. Among others, one viable approach to achieving energy saving is to use an indexed data organization to broadcast data over wireless channels to mobile units. We explore the issue of indexing data with skewed access for sequential broadcasting in wireless mobile computing. We propose methods to build index trees based on access frequencies of data records. To minimize the average cost of index probes, we consider two cases: one for fixed index fanouts and the other for variant index fanouts, and devise algorithms to construct index trees for both cases. We show that the cost of index probes can be minimized not only by employing an imbalanced index tree that is designed in accordance with data access skew, but also by exploiting variant fanouts for index nodes.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"27 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":"131111459","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}
引用次数: 81
Fragment reconstruction: providing global cache coherence in a transactional storage system 片段重构:在事务性存储系统中提供全局缓存一致性
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597803
A. Adya, M. Castro, B. Liskov, U. Maheshwari, L. Shrira
{"title":"Fragment reconstruction: providing global cache coherence in a transactional storage system","authors":"A. Adya, M. Castro, B. Liskov, U. Maheshwari, L. Shrira","doi":"10.1109/ICDCS.1997.597803","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597803","url":null,"abstract":"Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by servicing client cache misses from the caches of other clients. However, existing cooperative caching techniques do not provide adequate support for fine grained sharing. We describe a new storage system architecture, split caching, and a new cache coherence protocol, fragment reconstruction, that combine cooperative caching with efficient support for fine grained sharing and transactions. We also present the results of performance studies that show that our scheme introduces little overhead over the basic cooperative caching mechanism and provides better performance when there is fine grained sharing.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"47 3 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":"125884813","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
A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints 具有一致性约束的硬实时分布式问题的FIFO最坏情况分析
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603275
L. George, P. Minet
{"title":"A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints","authors":"L. George, P. Minet","doi":"10.1109/ICDCS.1997.603275","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603275","url":null,"abstract":"A solution for a hard real time scheduling problem in a distributed system is designed and proved. The constraints of our problem are first to preserve consistency even in the presence of concurrency and second to preserve the order of task releases, provided that task release times differ more than clock precision. That is achieved by FIFO based scheduling. The feasibility conditions resulting from the worst case response time analysis of each task set are given. The solution complexity is shown to be pseudo polynomial.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"63 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":"125891344","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}
引用次数: 26
Layered analytic performance modelling of a distributed database system 分布式数据库系统的分层分析性能建模
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603390
F. Sheikh, M. Woodside
{"title":"Layered analytic performance modelling of a distributed database system","authors":"F. Sheikh, M. Woodside","doi":"10.1109/ICDCS.1997.603390","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603390","url":null,"abstract":"Very few analytic models have been reported for distributed database systems, perhaps because of complex relationships of the different kinds of resources in them. Layered queueing models seem to be a natural framework for these systems, capable of modelling all the different features which are important for performance (e.g. devices, communications, multithreaded processes, locking). To demonstrate the suitability of the layered framework, a previous queueing study of the CARAT distributed testbed has been recast as a layered model. Whereas the queueing model bears no obvious resemblance to the database system, the layered model directly reflects its architecture. The layered model predictions have about the same accuracy as the queueing model.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"40 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":"116998765","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}
引用次数: 35
Evaluating CORBA latency and scalability over high-speed ATM networks 在高速ATM网络上评估CORBA延迟和可伸缩性
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598074
D. Schmidt, A. Gokhale
{"title":"Evaluating CORBA latency and scalability over high-speed ATM networks","authors":"D. Schmidt, A. Gokhale","doi":"10.1109/ICDCS.1997.598074","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598074","url":null,"abstract":"We present two contributions to the study of CORBA performance over high-speed networks. First, we measure the latency of various types and sizes of two-way client requests using a pair of widely used implementations of CORBA-Orbix 2.1 and VisiBroker for C++ 2.0. Second, we use Orbix and VisiBroker to measure the scalability of CORBA servers in terms of the number of objects they can support efficiently. These experiments extend our previous work on CORBA performance for bandwidth-sensitive applications (such as satellite surveillance, medical imaging, and teleconferencing). Our results show that the latency for CORBA implementations is relatively high and server scalability is relatively low. Our latency experiments show that non-optimized internal buffering in CORBA implementations can cause substantial delay variance, which is unacceptable in many real-time or constrained-latency applications. Likewise our scalability experiments reveal that neither Orbix nor VisiBroker can handle a large number of objects in a single server process.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"26 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":"132165262","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}
引用次数: 90
Distributed data mining of probabilistic knowledge 概率知识的分布式数据挖掘
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598026
Wai Lam, Alberto Maria Segre
{"title":"Distributed data mining of probabilistic knowledge","authors":"Wai Lam, Alberto Maria Segre","doi":"10.1109/ICDCS.1997.598026","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598026","url":null,"abstract":"We present a distributed approach to data mining of a knowledge representation scheme known as Bayesian belief networks which are capable of dealing with uncertain knowledge. We make use of a machine learning paradigm and a distributed asynchronous search technique to achieve the task of distributed knowledge discovery from data. Our approach boasts a number of features, including dynamic load balancing and fault tolerance. Empirical experiments have been conducted to illustrate its feasibility, solving large scale Bayesian network discovery problems with multiple workstations.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"35 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":"117315362","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}
引用次数: 20
Supporting dynamic space-sharing on clusters of non-dedicated workstations 支持非专用工作站集群上的动态空间共享
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597902
Abdur Chowdhury, Lisa D. Nicklas, Sanjeev Setia, E. White
{"title":"Supporting dynamic space-sharing on clusters of non-dedicated workstations","authors":"Abdur Chowdhury, Lisa D. Nicklas, Sanjeev Setia, E. White","doi":"10.1109/ICDCS.1997.597902","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597902","url":null,"abstract":"Clusters of workstations are increasingly being viewed as a cost effective alternative to parallel supercomputers. However, resource management and scheduling on workstations clusters is complicated by the fact that the number of idle workstations available for executing parallel applications is constantly fluctuating. We present a case for scheduling parallel applications on non dedicated workstation clusters using dynamic space sharing, a policy under which the number of processors allocated to an application can be changed during its execution. We describe an approach that uses application level checkpointing and data repartitioning for supporting dynamic space sharing and for handling the dynamic reconfiguration triggered when failure or owner activity is detected on a workstation being used by a parallel application. The performance advantages of dynamic space sharing are quantified through a simulation study, and experimental results are presented for the overhead of dynamic reconfiguration of a grid oriented data parallel application using our approach.","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":"130266416","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信