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

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

筛选
英文 中文
Modular composition of redundancy management protocols in distributed systems: an outlook on simplifying protocol level formal specification and verification 分布式系统中冗余管理协议的模块化组成:简化协议级形式规范和验证的展望
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918955
Purnendu Sinha, N. Suri
{"title":"Modular composition of redundancy management protocols in distributed systems: an outlook on simplifying protocol level formal specification and verification","authors":"Purnendu Sinha, N. Suri","doi":"10.1109/ICDSC.2001.918955","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918955","url":null,"abstract":"In recent years, formal methods (FMs) have been extensively used for the verification and validation (V&V) of dependable distributed protocols. In our studies utilizing FMs for V&V, we have observed that a number of protocols providing for distributed and dependable services can often be formulated using a small set of basic functional primitives or their variations. Thus, from the formal viewpoint, the objective of this paper is to introduce techniques, utilizing concepts of category theory, that could effectively identify and reuse basic formal modules in order to simplify formal specification and verification for a spectrum of protocols.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"34 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":"123857660","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
Multiprocessor preprocessing algorithms for uniprocessor on-line scheduling 单处理机在线调度的多处理机预处理算法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918951
J. Goossens, Sanjoy Baruah
{"title":"Multiprocessor preprocessing algorithms for uniprocessor on-line scheduling","authors":"J. Goossens, Sanjoy Baruah","doi":"10.1109/ICDSC.2001.918951","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918951","url":null,"abstract":"H. Chetto and M. Chetto (1989) presented an algorithm for the online admission control and run-time scheduling of aperiodic real-time jobs in preemptive uniprocessor environments that are executing systems of periodic hard real-time tasks. This algorithm requires a significant degree of preprocessing of the system of periodic tasks - in general, this preprocessing takes a time that is exponential in the representation of the periodic task system. In this paper, we develop techniques for speeding up the preprocessing phase of the Chetto & Chetto algorithm, by adapting it for implementation in parallel environments. We validate the effectiveness of our parallelization both by theoretical results and through simulation experiments.","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":"122364759","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
Dynamic migration algorithms for distributed object systems 分布式对象系统的动态迁移算法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918940
V. Kalogeraki, P. Melliar-Smith, L. Moser
{"title":"Dynamic migration algorithms for distributed object systems","authors":"V. Kalogeraki, P. Melliar-Smith, L. Moser","doi":"10.1109/ICDSC.2001.918940","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918940","url":null,"abstract":"Complex distributed object systems require dynamic migration algorithms that allocate and reallocate objects to respond to changes in the load or in the availability of the resources. We present the Cooling and Hot-Spot migration algorithms that reallocate objects when the load on a processor is high or when the latency of a task is high. The algorithms have been implemented as a feedback loop in the Eternal Resource Management System where information obtained from monitoring the behavior of the objects and the usage of the processors' resources is used to dynamically balance the load on the processors and improve the latency of the tasks. The cost of moving an object is justified by amortization over many method invocations, and constrains the rate at which objects are moved. The experimental results show that our algorithms guarantee steady flow of operation for the tasks and gracefully migrate objects from the processors when processor overloads and high task latencies are detected.","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":"121964456","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}
引用次数: 23
A transparent network handover for nomadic CORBA users 为流浪CORBA用户提供透明的网络切换
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918980
Rainer Ruggaber, J. Seitz
{"title":"A transparent network handover for nomadic CORBA users","authors":"Rainer Ruggaber, J. Seitz","doi":"10.1109/ICDSC.2001.918980","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918980","url":null,"abstract":"This paper introduces a generic disconnection handling and network handover mechanism for nomadic CORBA applications. The disconnection handling provides a transparent or explicit mode. In the explicit mode, a special class provided by the user or application is informed if a disconnection occurs and can take appropriate actions. The handover mechanism supports an active handover, where the handover decision is based on application and user needs as well as a passive handover which is needed if after a disconnection the original network is not available. Both mechanisms provide a solution for the lost reply problem occurring if the mobile node is disconnected before the reply to an outstanding request has arrived. The presented mechanisms are integrated into the generic proxy platform /spl Pi//sup 2/. /spl Pi//sup 2/ transparent encapsulates the wireless link and splits the connection between the client on the mobile node and the server into separate parts. /spl Pi//sup 2/ can be transparently integrated into existing distributed systems without changes to clients or servers using a generic interface and dynamic type determination.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"71 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":"132056797","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 fully automated object extraction system for the World Wide Web 一个完全自动化的万维网对象提取系统
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918966
David J. Buttler, Ling Liu, C. Pu
{"title":"A fully automated object extraction system for the World Wide Web","authors":"David J. Buttler, Ling Liu, C. Pu","doi":"10.1109/ICDSC.2001.918966","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918966","url":null,"abstract":"This paper presents a fully automated object extraction system Omini. A distinct feature of Omini is the suite of algorithms and the automatically learned information extraction rules for discovering and extracting objects from dynamic Web pages or static Web pages that contain multiple object instances. We evaluated the system using more than 2,000 Web pages over 40 sites. It achieves 100% precision (returns only correct objects) and excellent recall (between 99% and 98%, with very few significant objects left out). The object boundary identification algorithms are fast, about 0.1 second per page with a simple optimization.","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":"132405439","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}
引用次数: 277
Adaptive protocols for agent migration 代理迁移的自适应协议
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919006
I. Satoh
{"title":"Adaptive protocols for agent migration","authors":"I. Satoh","doi":"10.1109/ICDSC.2001.919006","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919006","url":null,"abstract":"A framework for building adaptive network protocols for agent migration over a network is presented. A key idea of the framework is to introduce mobile agents as first-class objects. That is, the framework allows network protocols for agent migration to be naturally implemented within mobile agents and then dynamically deployed at network nodes by migrating the agents that carry the protocols. A prototype implementation was built on a hierarchical mobile agent system, and several practical protocols for agent migration were designed and implemented. These protocols can have significant contributions to active network technology as well as mobile agent technology.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"6 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":"129731671","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}
引用次数: 12
Placement of read-write Web proxies on the Internet 在Internet上放置读写Web代理
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919000
X. Jia, Deying Li, Xiaodong Hu, D. Du
{"title":"Placement of read-write Web proxies on the Internet","authors":"X. Jia, Deying Li, Xiaodong Hu, D. Du","doi":"10.1109/ICDSC.2001.919000","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919000","url":null,"abstract":"This paper investigates the optimal placement of proxies of a Web server on the Internet. With the consideration of both read and write operations to the data on the Web server. First, we study the problem of optimal placement of k proxies in a system to minimize the total access cost to the Web server. Then, for unknown number of proxies, we find the optimal number of proxies required in the system. The problems are formulated using a dynamic programming method and optimal solutions are obtained. Intensive simulations have been conducted to evaluate the performance of the proposed algorithms, and to demonstrate the relationship between the number of proxies required in the system and the read-write ratio. This work can significantly alleviate the Web access traffic on the Internet and improve the performance of the Web server.","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":"129430699","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
Self-stabilizing PIF algorithm in arbitrary rooted networks 任意根网络中的自稳定PIF算法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918937
Alain Cournier, F. Petit, V. Villain, A. Datta
{"title":"Self-stabilizing PIF algorithm in arbitrary rooted networks","authors":"Alain Cournier, F. Petit, V. Villain, A. Datta","doi":"10.1109/ICDSC.2001.918937","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918937","url":null,"abstract":"We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a preconstructed spanning tree. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to behave according to its specification. Every PIF wave initiated by the root inherently creates a tree in the graph. So, the tree is dynamically created according to the progress of the PIF wave. This allows our PIF algorithm to take advantage of the relative speed of different components of the network. The proposed algorithm can be easily used to implement any self-stabilizing system which requires a (self-stabilizing) wave protocol running on an arbitrary network.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"235 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":"115575943","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}
引用次数: 32
Revisiting hierarchical quorum systems 重新审视等级仲裁制度
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-01 DOI: 10.1109/ICDSC.2001.918956
Nuno M. Preguiça, J. Martins
{"title":"Revisiting hierarchical quorum systems","authors":"Nuno M. Preguiça, J. Martins","doi":"10.1109/ICDSC.2001.918956","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918956","url":null,"abstract":"In distributed systems, it is often necessary to provide coordination among the multiple concurrent processes. Quorum systems provide a decentralized approach to provide such coordination that is resilient to node and communication link failures. Quorum systems are highly available and may be used to balance the load among the elements of the system. In this paper, we propose a modification to the hierarchical grid quorum system that leads to a smaller quorum size and better availability and load. We also propose a new hierarchical quorum construction based on the organization of elements in a triangular shape that presents better average quorum size, availability and load than other highly-available systems with almost optimal load.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746001","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
Anonymous Gossip: improving multicast reliability in mobile ad-hoc networks 匿名八卦:提高移动ad-hoc网络的组播可靠性
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-02-06 DOI: 10.1109/ICDSC.2001.918957
Ranveer Chandra, Venugopalan Ramasubramanian, K. Birman
{"title":"Anonymous Gossip: improving multicast reliability in mobile ad-hoc networks","authors":"Ranveer Chandra, Venugopalan Ramasubramanian, K. Birman","doi":"10.1109/ICDSC.2001.918957","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918957","url":null,"abstract":"In recent years, a number of applications of ad-hoc networks have been proposed. Many of them are based on the availability of a robust and reliable multicast protocol. We address the issue of reliability and propose a scalable method to improve packet delivery of multicast routing protocols and decrease the variation in the number of packets received by different nodes. The proposed protocol works in two phases. In the first phase, any suitable protocol is used to multicast a message to the group, while in the second concurrent phase, the gossip protocol tries to recover lost messages. Our proposed gossip protocol is called Anonymous Gossip (AG) since nodes need not know the other group members for gossip to be successful. This is extremely desirable for mobile nodes, that have limited resources, and where the knowledge of group membership is difficult to obtain. As a first step, anonymous gossip is implemented over MAODV without much overhead and its performance is studied. Simulations show that the packet delivery of MAODV is significantly improved and the variation in number of packets delivered is decreased.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128447229","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}
引用次数: 259
首页 上一页 下一页 尾页
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学术官方微信
小红书