Proceedings 20th IEEE International Conference on Distributed Computing Systems最新文献

A framework to protect mobile agents by using reference states 一个使用参考状态保护移动代理的框架

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840953

F. Hohl

引用次数: 81

Adaptive data delivery in wireless communication environments 无线通信环境中的自适应数据传输

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840957

Chi-Wai Lin, Lee

引用次数: 24

Task assignment with unknown duration 持续时间未知的任务分配

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840932

Mor Harchol-Balter

引用次数: 245

Quartz: a QoS architecture for open systems 石英:用于开放系统的QoS架构

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840930

Frank Siqueira, V. Cahill

{"title":"Quartz: a QoS architecture for open systems","authors":"Frank Siqueira, V. Cahill","doi":"10.1109/ICDCS.2000.840930","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840930","url":null,"abstract":"This paper describes an architecture that provides support for quality of service (QoS) specification and enforcement in heterogeneous distributed computing systems. The Quartz QoS architecture has been designed to overcome various limitations of previous QoS architectures that have constrained their use in heterogeneous systems. These limitations include dependencies on specific platforms and the fact that their functionality is often limited by design to one particular area of application. Quartz is able to accommodate differences among diverse computing platforms and areas of application by adopting a flexible and extensible platform-independent design, which allows its internal components to be rearranged dynamically in order to adapt the architecture to the surrounding environment. Further significant problems found in other QoS architectures, such as the lack of flexibility and expressiveness in the specification of QoS requirements and limited support for resource adaptation, are also addressed by Quartz. This paper describes the motivations for and design of Quartz in detail, presents a prototype implementation of Quartz and an analysis of its design based on experience with a number of applications that use this prototype.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611448","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}

引用次数: 62

Scheduling heuristics for data requests in an oversubscribed network with priorities and deadlines 在具有优先级和截止日期的超额订阅网络中用于数据请求的调度启发式方法

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840911

M. Theys, N. Beck, H. Siegel, M. Jurczyk, Min Tan

{"title":"Scheduling heuristics for data requests in an oversubscribed network with priorities and deadlines","authors":"M. Theys, N. Beck, H. Siegel, M. Jurczyk, Min Tan","doi":"10.1109/ICDCS.2000.840911","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840911","url":null,"abstract":"Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links available. Sites in the network request data items and each request has an associated deadline and priority. This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. The network is assumed to be oversubscribed and not all requests for data items can be satisfied. A mathematical model for the basic data staging problem is given. Then, three multiple-source shortest-path algorithm based heuristics for finding a near-optimal schedule of the communication steps for staging the data are presented. Each heuristic can be used with each of four cost criteria developed. Thus, twelve implementations are examined. In addition, two different weightings for the relative importance of different priority levels are considered. The performance of the proposed heuristics is evaluated and compared by simulations. The proposed heuristics are shown to perform well with respect to upper and lower bounds. Furthermore, the heuristics and a complex cost criterion allow more highest priority messages to be received than a simple-cost-based heuristic that schedules all highest priority messages first.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004294","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

Highly concurrent shared storage 高度并发共享存储

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840942

Khalil Amiri, Garth A. Gibson, Richard A. Golding

{"title":"Highly concurrent shared storage","authors":"Khalil Amiri, Garth A. Gibson, Richard A. Golding","doi":"10.1109/ICDCS.2000.840942","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840942","url":null,"abstract":"Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and file systems highly scalable, reliable storage. In such systems, hosts perform access tasks (read and write) and management tasks (storage migration and reconstruction of data on failed devices.) Each task translates into multiple phases of low-level device I/Os, so that concurrent host tasks accessing shared devices can corrupt redundancy codes and cause hosts to read inconsistent data. Concurrent control protocols that scale to large system sizes are required in order to coordinate on-line storage management and access tasks. In this paper we identify, the tasks that storage controllers must perform, and propose an approach which allows these tasks to be composed from basic operations-called base storage transactions (BSTs)-such that correctness requires only the serializability of the BSTs and not of the parent tasks. We present highly scalable distributed protocols which exploit storage technology trends and BST properties to achieve serializability while coming within a few percent of ideal performance.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121547842","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}

引用次数: 66

The effect of false-name declarations in mechanism design: towards collective decision making on the Internet 假名声明在机制设计中的作用:面向互联网集体决策

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840916

M. Yokoo, Y. Sakurai, S. Matsubara

引用次数: 59

Graceful quorum reconfiguration in a robust emulation of shared memory 在共享内存的健壮模拟中进行优雅的仲裁重新配置

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840958

Burkhard Englert, Alexander A. Shvartsman

{"title":"Graceful quorum reconfiguration in a robust emulation of shared memory","authors":"Burkhard Englert, Alexander A. Shvartsman","doi":"10.1109/ICDCS.2000.840958","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840958","url":null,"abstract":"Providing shared-memory abstraction in message-passing systems often simplifies the development of distributed algorithms and allows for the reuse of shared-memory algorithms in the message-passing setting. A robust emulation of atomic single-writer/multi-reader registers in message-passing systems was developed by Attiya, Bar-Noy and Dolev (1995). This emulation was extended by Lynch and Shvartsman (1997) to multi-writer/multi-reader registers using reconfigurable quorum systems. In this work we present a new atomic multi-writer/multi-reader register service that includes a fault-tolerant reconfiguration service. This new emulation has a substantially improved performance and fault-tolerance characteristics. We introduce the concept of intermediate quorum configurations and show how they can be used by readers/writers during reconfiguration. The result is that the quorum reconfigurations are graceful: readers and writers no longer \"busy-wait\" during reconfigurations, bur are able to complete their operations. An additional advance is that the reconfigurer is eliminated as the single point of failure. When the reconfigurer fails, readers and writers continue using intermediate configurations. In finite executions, read and write operations terminate in bounded time using a bounded number of messages (the bounds depend on the \"currency\" of the configuration at the invoker of the operation). Finally, the service places no restrictions on the installed quorum configuration: a previously installed quorum system can be replaced by an arbitrary new quorum system.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134365056","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}

引用次数: 55

A query propagation approach to improve CORBA Trading Service scalability 一种改进CORBA交易服务可伸缩性的查询传播方法

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840963

Z. Tari, G. Craske

{"title":"A query propagation approach to improve CORBA Trading Service scalability","authors":"Z. Tari, G. Craske","doi":"10.1109/ICDCS.2000.840963","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840963","url":null,"abstract":"Existing CORBA traders, at least most of them, support the core functions of the OMG specification of the Trading Service. We believe that this is useful and can help potential users to use such a service in heterogeneous environments. However we also believe that this is not sufficient because such environments deal with dynamic information and often require scalability (e.g. stock market applications). The CORBA Trading Service uses static information recorded in different components of a trading graph, which reduces its ability to deal with dynamic environments. This paper proposes solutions to the issue of type management and query routing in the context of CORBA Trading Service to improve the scalability and the quality of the results returned by the core trader functions. We propose a query routing mechanism that uses dynamic information recorded within different traders. Some of this information, such as hit factor, is calculated based on the number of offers a remote trader can address and their relative hops away. Finally, we demonstrate that the proposed approach has led to better performance for the core CORBA trader functions.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132885190","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

Agent migration between incompatible agent platforms 不兼容的代理平台之间的代理迁移

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840901

P. Misikangas, K. Raatikainen

引用次数: 26