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

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

筛选
英文 中文
Client/server qualities: a basis for reliable distributed workflow management systems 客户/服务器质量:可靠的分布式工作流管理系统的基础
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598027
H. Schuster, S. Jablonski, C. Bussler
{"title":"Client/server qualities: a basis for reliable distributed workflow management systems","authors":"H. Schuster, S. Jablonski, C. Bussler","doi":"10.1109/ICDCS.1997.598027","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598027","url":null,"abstract":"In distributed workflow management systems (WfMSs) many workflow servers and application programs referenced within workflows have to work together cooperatively. We introduce a middleware service for WfMSs which offers qualities for client/server communication. These qualities characterize the behavior of clients and servers in case of failure and recovery. Our middleware service builds an abstraction from the concrete implementation of a client/server interaction and hides characteristics of underlying system services, e.g. RPC mechanisms and TP monitors. For this reason, our middleware service supports the implementation of reliable distributed WfMSs.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"36 7 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":"114282969","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
A reflective model for mobile software objects 移动软件对象的反射模型
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598066
O. Holder, I. Ben-Shaul
{"title":"A reflective model for mobile software objects","authors":"O. Holder, I. Ben-Shaul","doi":"10.1109/ICDCS.1997.598066","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598066","url":null,"abstract":"Mobile software objects are autonomous computational entities that travel in large-scale and widely-distributed heterogeneous systems, and whose functionality can be attached to diverse computing environments. An object model that supports mobile objects should have special characteristics such as mutability of object's structure and semantics to facilitate adjustment to different environments, self-containment of objects to allow their migration as autonomous units, and extensive support for security. We discuss the requirements and design guidelines of such a model, and present MROM, a reflective model based on these guidelines. We also discuss MROM's implementation and present a component interoperability framework that was built on top of it, as an example application of the model.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"54 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":"133022004","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
Dynamic Light-Weight Groups 动态轻量级组
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597806
Katherine Guo, L. Rodrigues
{"title":"Dynamic Light-Weight Groups","authors":"Katherine Guo, L. Rodrigues","doi":"10.1109/ICDCS.1997.597806","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597806","url":null,"abstract":"The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that use a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups onto instances of a virtually synchronous implementation is called a Light-Weight Group Service. This paper discusses the Light-Weight Group protocols in dynamic environments, where mappings cannot be defined a priori and may change over time. We show that it is possible to establish mappings that promote sharing and, at the same time, minimize interference. These mappings can be established in an automated manner using heuristics applied locally at each node. Experiments using an implementation in the Horus system show that significant performance improvements can be achieved with this approach.","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":"134588649","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
Building trust for distributed commerce transactions 为分布式商业交易建立信任
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598062
Jiawen Su, Daniel W. Manchala
{"title":"Building trust for distributed commerce transactions","authors":"Jiawen Su, Daniel W. Manchala","doi":"10.1109/ICDCS.1997.598062","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598062","url":null,"abstract":"The explosive growth of the Internet exposes unprecedented commercial opportunities over the network. The vast computer networks easily bring together customers and vendors who are physically distributed in different continents. Current research in electronic commerce mainly focuses on payment mechanisms. However, the global presence of customers and vendors makes it difficult to build trust among the parties involved in a transaction. We develop systematic mechanisms to address the trust problem in a network commerce environment. We first develop protocols for a single-customer single-vendor case where one customer buys goods from one vendor. Then we derive protocols for more complicated environments such as when a customer wants to buy goods from several vendors as part of a single transaction. Most of our protocols require some trusted third-party to intermediate transactions. However the workload and requirements placed on the trusted third-party vary from the whole goods and payment store-and-forward to very simple book-keepings of encryption keys. Our contributions also include an algorithm to find the optimal trusted agent.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"36 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":"133784551","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}
引用次数: 27
Distributed detection of generalized deadlocks 广义死锁的分布式检测
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603415
A. Kshemkalyani, M. Singhal
{"title":"Distributed detection of generalized deadlocks","authors":"A. Kshemkalyani, M. Singhal","doi":"10.1109/ICDCS.1997.603415","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603415","url":null,"abstract":"Fast and efficient detection of deadlocks remains an important problem in distributed operating systems. We present a distributed algorithm to detect generalized deadlocks in distributed systems. The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine a deadlock. If sufficient information to decide the reducibility of a node is not available at that node, the algorithm attempts reduction later in a lazy manner. We prove the correctness of the algorithm. The algorithm has a message complexity of 2e messages and a worst case time complexity of 2d hops, where e is the number of edges and d is the diameter of the WFG. The algorithm is shown to perform better in both time and message complexity than the best known distributed algorithms to detect distributed generalized deadlocks. We conjecture that the algorithm is optimal in the number of messages and time delay, among distributed algorithms to detect generalized deadlocks.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"32 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":"128327550","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
A dynamic probe strategy for quorum systems 仲裁系统的动态探测策略
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597860
M. Neilsen
{"title":"A dynamic probe strategy for quorum systems","authors":"M. Neilsen","doi":"10.1109/ICDCS.1997.597860","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597860","url":null,"abstract":"A quorum system is a collection of sets called quorums. Any two quorums in a quorum system must have at least one element in common. Quorum systems can be used for many different applications in a distributed system. A quorum system is available, if all elements in at least one quorum ore operational. The elements are probed to determine if they are available. A probe strategy is used to determine the order in which the elements are probed. This paper studies the average case probe complexity, which is defined as the expected number of probes required to determine if a given quorum system is available. Then, two new probe strategies are presented and analyzed. The first strategy is a generalizations of the alternating color strategy, and the second strategy is based on a measure of the relative importance of each element in the system.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"4 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":"115535837","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}
引用次数: 8
An optimistic quality-of-service provisioning scheme for cellular networks 一种蜂窝网络的乐观服务质量提供方案
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603410
Sajal K. Das, R. Jayaram, S. Sen
{"title":"An optimistic quality-of-service provisioning scheme for cellular networks","authors":"Sajal K. Das, R. Jayaram, S. Sen","doi":"10.1109/ICDCS.1997.603410","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603410","url":null,"abstract":"We propose an optimistic quality-of-service (QoS) provisioning scheme for multimedia traffic in wireless networks. The scheme uses the standard classification of network traffic into two priority classes based on their bandwidth requirement and delay tolerance. We classify the users as local or departing based on their current coordinates in the cell. A call admission algorithm, a call management algorithm and a prediction based resource reservation algorithm which reserves the specified bandwidth (by borrowing channels from neighboring cells, if required) in the predicted destination cell(s) of a departing user are presented. A novel approach called bandwidth compaction is proposed which enables more efficient spectrum utilization. Simulation experiments show improvements of about 24% in the call blocking probability and 12% in the connection dropping probability over other bandwidth reserving schemes. An overall improvement of 24% in bandwidth utilization over other schemes not employing any bandwidth management technique, is also observed.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"43 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":"124141826","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
Encapsulating mobile objects 封装移动对象
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598069
Hermann Härtig, Lars Reuther
{"title":"Encapsulating mobile objects","authors":"Hermann Härtig, Lars Reuther","doi":"10.1109/ICDCS.1997.598069","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598069","url":null,"abstract":"This paper describes a technique to effectively isolate mobile objects or processes that execute downloaded, potentially suspicious programs. It relies on wish lists, trust lists and capability lists. Wish lists are carried along with programs or mobile objects and denote the resources requested by the program to do what it claims to do. Wish lists are transformed into capability lists when downloaded programs are started. Trust lists reside on stations and are used to determine which members of wish lists are taken over into capability lists. The capability lists are enforced during the execution of programs. All lists are symbolic to enable their interpretation in heterogeneous environments. The paper describes the technique, its integration in a Linux environment and first experiences.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"36 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":"125086513","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
Exploiting temporal and spatial constraints on distributed shared objects 利用分布式共享对象的时间和空间约束
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598052
R. West, K. Schwan, Ivan Tacic, M. Ahamad
{"title":"Exploiting temporal and spatial constraints on distributed shared objects","authors":"R. West, K. Schwan, Ivan Tacic, M. Ahamad","doi":"10.1109/ICDCS.1997.598052","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598052","url":null,"abstract":"Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions. Researchers have developed consistency protocols for replicated 'memory' objects. These protocols are well suited to scientific applications but less suited to multimedia or groupware applications. We address the state sharing needs of complex distributed applications with: high-frequency symmetric accesses to shared objects; unpredictable and limited locality of accesses; dynamically changing sharing behavior; and potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints on shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"200 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":"121086362","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
Extensible resource management for cluster computing 用于集群计算的可扩展资源管理
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603418
N. Islam, A. Prodromidis, M. Squillante, A. Gopal, L. Fong
{"title":"Extensible resource management for cluster computing","authors":"N. Islam, A. Prodromidis, M. Squillante, A. Gopal, L. Fong","doi":"10.1109/ICDCS.1997.603418","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603418","url":null,"abstract":"Advanced general purpose parallel systems should be able to support diverse applications with different resource requirements without compromising effectiveness and efficiency. We present a resource management model for cluster computing that allows multiple scheduling policies to co-exist dynamically. In particular, we have built Octopus, an extensible and distributed hierarchical scheduler that implements new space sharing, gang scheduling and load sharing strategies. A series of experiments performed on an IBM SP2 suggest that Octopus can effectively match application requirements to available resources, and improve the performance of a variety of parallel applications within a cluster.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"08 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":"125427556","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}
引用次数: 29
首页 上一页 下一页 尾页
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学术官方微信