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

Proceedings 21st International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
Transactions on partially replicated data based on reliable and atomic multicasts 基于可靠和原子组播的部分复制数据的事务
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918958
Udo Fritzke, Philippe Ingels
{"title":"Transactions on partially replicated data based on reliable and atomic multicasts","authors":"Udo Fritzke, Philippe Ingels","doi":"10.1109/ICDSC.2001.918958","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918958","url":null,"abstract":"We focus on a partial data replication model in which each object is made fault-tolerant by a process group. We propose a replication control protocol that provides transaction properties based both on reliable and atomic multicast primitives and a two phase locking protocol. Furthermore, we propose two deadlock prevention rules to obtain two variants of the base protocol, one that favors the execution of transaction write operations over read operations and another one that does the contrary, favoring read over write. The latter variant ensures that read-only transactions are never aborted. Both protocols ensure that all transactions are not aborted by deadlock prevention rules.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117125397","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
Interagent communication and synchronization in DaAgent DaAgent中的代理间通信和同步
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919003
Shivakant Mishra, Peng Xie
{"title":"Interagent communication and synchronization in DaAgent","authors":"Shivakant Mishra, Peng Xie","doi":"10.1109/ICDSC.2001.919003","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919003","url":null,"abstract":"This paper describes the design and implementation of interagent communication and synchronization models in the DaAgent mobile agent-based computing system. Eight models of interagent communication and synchronization are proposed. The paper evaluates these models based on their utility, performance, and applicability in an Internet computing environment.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923668","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
A general resource allocation synchronization problem 一般的资源分配同步问题
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918986
P. Keane, Mark Moir
{"title":"A general resource allocation synchronization problem","authors":"P. Keane, Mark Moir","doi":"10.1109/ICDSC.2001.918986","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918986","url":null,"abstract":"We introduce a new synchronization problem called GRASP. We show that this problem is very general, in that it can provide solutions with strong properties to a wide make of previously-studied and new problems. We present a shared-memory solution to this problem that is based on a new solution to the dining philosophers problem with constant failure locality. We use the powerful tool of wait-free transactions to simplify our solution without restricting concurrency.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"428 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122800861","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}
引用次数: 10
Selective checkpointing and rollbacks in multithreaded distributed systems 多线程分布式系统中的选择性检查点和回滚
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918931
Mangesh Kasbekar, C. Das
{"title":"Selective checkpointing and rollbacks in multithreaded distributed systems","authors":"Mangesh Kasbekar, C. Das","doi":"10.1109/ICDSC.2001.918931","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918931","url":null,"abstract":"Modern distributed systems are often multithreaded and object-oriented in their design. They require efficient techniques to checkpoint and restore their state for improving fault-tolerance properties. The traditional process-based techniques of distributed checkpointing and rollback algorithms suffer from the problem of false dependencies, which makes them very rigid and inefficient for use with modern systems. In this paper, we develop protocols that can selectively checkpoint (and rollback) some threads of a distributed system while leaving others untouched, and yet ensuring the consistency of state resulting from such a partial rollback.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122485615","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
A protocol design of communication state transfer for distributed computing 面向分布式计算的通信状态转移协议设计
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919007
K. Chanchio, Xian-He Sun
{"title":"A protocol design of communication state transfer for distributed computing","authors":"K. Chanchio, Xian-He Sun","doi":"10.1109/ICDSC.2001.919007","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919007","url":null,"abstract":"This paper presents the design of a communication state transfer protocol to support process migration in a dynamic, distributed computing environment. In our design, processes in distributed computation communicate one another via message passing and are migration-enabled. Due to mobility, mechanisms to maintain reliability and correctness of data communication are needed. Following an event-based approach, Such mechanisms are derived to handle various communication situations when a process migrates. These mechanisms collectively preserve the semantics of the communication and support efficient communication state transfer.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128707566","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
Distributed admission control for anycast flows with QoS requirements 具有QoS要求的任意播流的分布式准入控制
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918959
D. Xuan, W. Jia
{"title":"Distributed admission control for anycast flows with QoS requirements","authors":"D. Xuan, W. Jia","doi":"10.1109/ICDSC.2001.918959","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918959","url":null,"abstract":"We study a distributed admission control (DAC) procedure for anycast flows with QoS requirements. We focus on algorithms that perform destination selection, which is critical in anycast. Several algorithms are proposed. These algorithms differ from each other in their dependence on system status information. We also address the issue of resource reservation and re-trial control in the DAC procedure. Performance data obtained by mathematical analysis and computer simulation show that in terms of admission probabilities, DAC systems that are based on local status information can perform closely to those that utilize global and dynamic status information. We note that the latter is much more expensive and difficult to realize.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130356318","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
Shared state consistency for time-sensitive distributed applications 时间敏感型分布式应用的共享状态一致性
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918991
V. Krishnaswamy, M. Ahamad, M. Raynal, D. Bakken
{"title":"Shared state consistency for time-sensitive distributed applications","authors":"V. Krishnaswamy, M. Ahamad, M. Raynal, D. Bakken","doi":"10.1109/ICDSC.2001.918991","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918991","url":null,"abstract":"Distributed applications that share a dynamically changing state are increasingly being deployed in wide-area environments. Such applications must access the state in a consistent manner, but the consistency requirements vary significantly from other systems. For example, shared memory models, such as sequential consistency, focus on the ordering of operations, and the same level of consistency is provided to each process. In interactive distributed applications, the timeliness of updates becoming effective could be an extremely important consistency requirement, and it could be different across different users. We propose a system that provides both non-timed and time-sensitive read and write operations for dynamic shared state. For example, a timed read can be used by a process to read a recently written value, whereas a timed write can make a new value available to all readers within a certain amount of time. We develop a consistency model that precisely defines the semantics of timed and non-tinted read and write operations. A protocol that implements this model is also presented. We also describe an implementation and some performance measurements.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115110749","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
Design and implementation of a composable reflective middleware framework 设计和实现一个可组合的反射中间件框架
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918995
N. Venkatasubramanian, Mayur Deshpande, S. Mohapatra, Sebastian Gutierrez-Nolasco, Jehan Wickramasuriya
{"title":"Design and implementation of a composable reflective middleware framework","authors":"N. Venkatasubramanian, Mayur Deshpande, S. Mohapatra, Sebastian Gutierrez-Nolasco, Jehan Wickramasuriya","doi":"10.1109/ICDSC.2001.918995","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918995","url":null,"abstract":"With the evolution of the global information infrastructure, service providers will need to provide effective and adaptive resource management mechanisms that can serve more concurrent clients and deal with applications that exhibit quality-of-service (QoS) requirements. Flexible, scalable and customizable middleware can be used as an enabling technology for next-generation systems that adhere to the QoS requirements of applications that execute in highly dynamic distributed environments. To enable application-aware resource management, we are developing a customizable and composable middleware framework called CompOSE|Q (Composable Open Software Environment with QoS), based on a reflective meta-model. In this paper, we describe the architecture and runtime environment for CompOSE|Q and briefly assess the performance overhead of the additional flexibility. We also illustrate how flexible communication mechanisms can be supported efficiently in the CompOSE|Q framework.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129311230","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}
引用次数: 44
Distributed query processing in the Internet: exploring relation replication and network characteristics 互联网中的分布式查询处理:探究关系复制和网络特性
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918974
Chang-Hung Lee, Ming-Syan Chen
{"title":"Distributed query processing in the Internet: exploring relation replication and network characteristics","authors":"Chang-Hung Lee, Ming-Syan Chen","doi":"10.1109/ICDSC.2001.918974","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918974","url":null,"abstract":"We introduce the concept of network graph for distributed query processing. Semijoins and joins are termed contributive replicated semijoins and contributive replicated joins, respectively, when they are interleaved into a join sequence to reduce the amount of data transmission cost required in a network with replicated relations. Our solution procedure consists of three consecutive steps, namely relation selection, join sequence scheduling and merge processing. A simulator is developed to evaluate the performance of algorithms devised. Our results show that the approach of interleaving a join sequence with contributive replicated semijoins/joins is not only efficient in its execution but also effective in reducing the total amount of data transmission cost required to process distributed queries.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"405 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123380460","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}
引用次数: 7
Adaptive beacon placement 自适应信标放置
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918979
N. Bulusu, D. Estrin, J. Heidemann
{"title":"Adaptive beacon placement","authors":"N. Bulusu, D. Estrin, J. Heidemann","doi":"10.1109/ICDSC.2001.918979","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918979","url":null,"abstract":"Beacon placement strongly affects the quality of spatial localization, a critical service for context-aware applications in wireless sensor networks; yet this aspect of localization has received little attention. Fixed beacon placement approaches such as uniform and very dense placement are not always viable and will be inadequate in very noisy environments in which sensor networks may be expected to operate (with high terrain and propagation uncertainties). We motivate the need for empirically adaptive beacon placement and outline a general approach based on exploration and instrumentation of the terrain conditions by a mobile human or robot agent. We design, evaluate and analyze three novel adaptive beacon placement algorithms using this approach for localization based on RF-proximity. In our evaluation, we find that beacon density rather than noise level has a more significant impact on beacon placement algorithms. Our beacon placement algorithms are applicable to a low (beacon) density regime of operation. Noise makes moderate density regimes more improvable.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114252375","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}
引用次数: 349
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书