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

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

筛选
英文 中文
Open metadata formats: efficient XML-based communication for heterogeneous distributed systems 开放元数据格式:异构分布式系统的高效基于xml的通信
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919013
Patrick M. Widener, K. Schwan, G. Eisenhauer
{"title":"Open metadata formats: efficient XML-based communication for heterogeneous distributed systems","authors":"Patrick M. Widener, K. Schwan, G. Eisenhauer","doi":"10.1109/ICDSC.2001.919013","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919013","url":null,"abstract":"The definition and translation of metadata is incorporated in all systems that exchange structured data. We observe that the manipulation of this metadata can be decomposed into three separate steps: discovery, binding of program objects to the metadata, and marshaling of data to and from wire formats. We have designed a method of representing message formats in XML, using data types that are available in the XML schema specification. We have implemented a tool called xml2wire that uses such metadata and exploits this decomposition in order to provide flexible metadata definition facilities for an efficient binary communications mechanism. We also observe that the use of xml2wire makes possible such flexibility without intolerable performance effects.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"4 5 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":"128808159","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
Design and evaluation of redistribution strategies for wide-area commodity distribution 广域商品配送再分配策略的设计与评价
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918944
U. Çetintemel, Banu Özden, A. Silberschatz, M. Franklin
{"title":"Design and evaluation of redistribution strategies for wide-area commodity distribution","authors":"U. Çetintemel, Banu Özden, A. Silberschatz, M. Franklin","doi":"10.1109/ICDSC.2001.918944","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918944","url":null,"abstract":"The proliferation of e-commerce has enabled a new set of applications that allow globally distributed purchasing of commodities such as books, CDs, travel tickets, etc., over the Internet. These commodities can be represented online by tokens, which can be distributed among servers to enhance the performance and availability of such applications. There are two fundamental approaches for distributing such tokens-partitioning and replication. Partitioning-based approaches eliminate the need for tight quorum synchronization required by replication-based approaches. The effectiveness of partitioning, however, relies on token redistribution techniques that allow dynamic migration of tokens to where they are needed. We propose pair-wise token redistribution strategies to support applications that involve wide-area commodity distribution. Using a detailed simulation model and real Internet message traces, we investigate the performance of our redistribution strategies and a previously proposed replication based scheme. Our results reveal that, for the types of applications and environment we address, partitioning-based approaches perform superior primarily due to their ability to provide higher server autonomy.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"8 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":"132270211","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
MVSS: Multi-View Storage System MVSS:多视图存储系统
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918930
Xiaonan Ma, A. Reddy
{"title":"MVSS: Multi-View Storage System","authors":"Xiaonan Ma, A. Reddy","doi":"10.1109/ICDSC.2001.918930","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918930","url":null,"abstract":"Presents MVSS, a storage system for active storage devices. MVSS offers a single framework for supporting various services at the device level. It provides a flexible interface for associating services to a file through multiple views of the file. Similar to views of a database in a multi-view database system, views in MVSS are generated dynamically and are not stored on physical storage devices. MVSS represents each view of an underlying file through a separate entry in the file system namespace. MVSS separates the deployment of services from file system implementations and thus allows services to be migrated to the storage devices. The paper presents the design of MVSS and shows how different services can be supported in MVSS at the device level. To illustrate our approach, we implemented a prototype system on PCs running Linux. We present results from the prototype implementation to demonstrate the effectiveness of our approach.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"65 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":"130244441","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}
引用次数: 15
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network 无线多跳移动自组织网络中缓解广播风暴的自适应方法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918978
Y. Tseng, S. Ni, En-Yu Shih
{"title":"Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network","authors":"Y. Tseng, S. Ni, En-Yu Shih","doi":"10.1109/ICDSC.2001.918978","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918978","url":null,"abstract":"In a multihop mobile ad hoc network, broadcasting is an elementary operation to support many applications. In (Ni et al., 1999), it is shown that naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Several threshold-based schemes are shown to perform better than flooding in (Ni et al., 1999). However, how to choose thresholds also poses a dilemma between reachability and efficiency under different host densities. We propose several adaptive schemes, which can dynamically adjust thresholds based on local connectivity information. Simulation results show that these adaptive schemes can offer better reachability as well as efficiency as compared to the results in (Ni et al., 1999).","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"4 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":"127761861","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}
引用次数: 639
Developing and refining an adaptive token-passing strategy 开发和改进自适应令牌传递策略
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918990
Burkhard Englert, L. Rudolph, Alexander A. Shvartsman
{"title":"Developing and refining an adaptive token-passing strategy","authors":"Burkhard Englert, L. Rudolph, Alexander A. Shvartsman","doi":"10.1109/ICDSC.2001.918990","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918990","url":null,"abstract":"Token rotation algorithms play an important role in distributed computing, to support such activities as mutual exclusion, round-robin scheduling, group membership and group communication protocols. Ring-based protocols maximize throughput in busy systems but can incur a linear (in the number of processors) delay when a processor needs to obtain a token to perform an operation. This paper synthesizes new algorithmic techniques for improving the performance (responsiveness) of logical ring protocols. The parameterized technique presents the safety properties of ring protocols and maintains high throughput in busy systems, while reducing the delay in lightly loaded systems from a linear to a logarithmic function in the number of processors. The development in this paper is done using term rewriting systems, where our parameterized protocol is developed in a series of safety-preserving refinements of a basic specification.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"24 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":"131865102","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
On the minimal characterization of the rollback-dependency trackability property 关于回滚依赖可跟踪性属性的最小表征
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918964
Islene C. Garcia, L. E. Buzato
{"title":"On the minimal characterization of the rollback-dependency trackability property","authors":"Islene C. Garcia, L. E. Buzato","doi":"10.1109/ICDSC.2001.918964","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918964","url":null,"abstract":"Checkpoint and communication patterns that enforce rollback-dependency trackability (RDT) have only online trackable checkpoint dependencies and allow efficient solutions to the determination of consistent global checkpoints. Baldoni, Helary and Raynal (1998) have explored RDT at the message level, in which checkpoint dependencies are represented by zigzag paths. They have presented many characterizations of RDT and conjectured that a certain communication pattern characterizes the minimal set of zigzag paths that must be tested online by a checkpointing protocol in order to enforce RDT. The contributions of this work are: a proof that their conjecture is false; a minimal characterization of RDT; and introduction of an original approach to analyze RDT checkpointing protocols.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"133 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":"115394844","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}
引用次数: 17
Token based group mutual exclusion for asynchronous rings 异步环的基于令牌的组互斥
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919001
Sébastien Cantarell, A. Datta, F. Petit, V. Villain
{"title":"Token based group mutual exclusion for asynchronous rings","authors":"Sébastien Cantarell, A. Datta, F. Petit, V. Villain","doi":"10.1109/ICDSC.2001.919001","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919001","url":null,"abstract":"We propose a group mutual exclusion algorithm for unidirectional rings. Our algorithm does not require the processes to have any id. Moreover, processes maintain no special data structures to implement any queues. The space requirement of processes depends only on the number of shared resources, and is equal to 4/spl times/log(m+1)+2 bits. The size of messages is 2/spl times/log(m+1) bits only. Every resource request generates O(n/sup 2/) messages in the worst case, but zero messages in the best case.","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":"114283370","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}
引用次数: 40
Fault-tolerant static scheduling for real-time distributed embedded systems 实时分布式嵌入式系统的容错静态调度
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919002
A. Girault, C. Lavarenne, Y. Sorel, M. Sighireanu
{"title":"Fault-tolerant static scheduling for real-time distributed embedded systems","authors":"A. Girault, C. Lavarenne, Y. Sorel, M. Sighireanu","doi":"10.1109/ICDSC.2001.919002","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919002","url":null,"abstract":"We present a heuristic for producing automatically a distributed fault-tolerant schedule of a given data-flow algorithm onto a given distributed architecture. The faults considered are processor failures, with a fail-silent behavior. Fault-tolerance is achieved with the software redundancy of computations and the time redundancy of data-dependencies.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"124 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":"116139402","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}
引用次数: 31
Performance analysis of the General Packet Radio Service 通用分组无线电业务的性能分析
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918998
C. Lindemann, Axel Thümmler
{"title":"Performance analysis of the General Packet Radio Service","authors":"C. Lindemann, Axel Thümmler","doi":"10.1109/ICDSC.2001.918998","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918998","url":null,"abstract":"Presents an efficient and accurate analytical model for the radio interface of the General Packet Radio Service (GPRS) in a GSM network. The model is utilized for investigating how many packet data channels should be allocated for GPRS under a given amount of traffic in order to guarantee appropriate quality of service. The presented model constitutes a continuous-time Markov chain. The Markov model represents the sharing of radio channels by circuit-switched GSM connections and packet-switched GPRS sessions under a dynamic channel allocation scheme. In contrast to previous work, the Markov model explicitly represents the mobility of users by taking into account arrivals of new GSM and GPRS users as well as handovers from neighboring cells. To validate the simplifications necessary for making the Markov model amenable to numerical solution, we provide a comparison of the results of the Markov model with a detailed simulator on the IP level.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"62 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":"127261370","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
A secure access control mechanism against Internet crackers 针对互联网破解者的安全访问控制机制
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919014
Kenichi Kourai, S. Chiba
{"title":"A secure access control mechanism against Internet crackers","authors":"Kenichi Kourai, S. Chiba","doi":"10.1109/ICDSC.2001.919014","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919014","url":null,"abstract":"Internet servers are always in danger of being \"highjacked\" by various attacks, like the buffer overflow attack. We propose a process cleaning technique for making an access control mechanism secure against hijacking. To minimize damage in cases where the full control of the servers is stolen, access restrictions must be imposed on the servers. However, designing a secure access control mechanism is not easy, because that mechanism itself can be a security hole. Process cleaning prevents malicious code injected by a cracker from illegally removing access restrictions from a hijacked server. In this paper, we describe the access control mechanism of our Compacto operating system using process cleaning. According to the results of our experiments, process cleaning can be implemented with acceptable performance overheads.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"120 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":"127291100","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信
小红书