{"title":"A dynamic query scheduling framework for distributed and evolving information systems","authors":"Ling Liu, C. Pu","doi":"10.1109/ICDCS.1997.603389","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603389","url":null,"abstract":"The rapid growth of the wide area network technology has led to an increasing number of information sources available online. To ensure the query services to scale up with such dynamic open environments, an advanced distributed information system must provide adequate support for dynamic interconnection between information consumers and information producers, instead of just functioning as a static data delivery system. We develop a distributed query scheduling framework to demonstrate the feasibility and the benefit for supporting interoperability and dynamic information gathering across heterogeneous information sources, without relying on an integrated view predefined over the participating information sources. We outline the mechanisms developed for the main components of our distributed query scheduling framework, such as query routing and query execution planning services. We also provide a concrete example to illustrate the issues on how the information consumers' query requests are dynamically processed and linked to the heterogeneous information sources and how the query scheduling framework scales up as the number of information sources increases.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"37 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":"124568187","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}
{"title":"The Sage project: a new approach to software engineering for distributed applications","authors":"Aleta Ricciardi","doi":"10.1109/ICDCS.1997.598041","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598041","url":null,"abstract":"We describe the Sage project, a new approach to software engineering for (fault-tolerant) distributed applications. Sage uses the modal logic of knowledge and applies theoretical results detailing how processes learn facts about each other's state to derive the minimal communication graph for a wide range of coordination problems. The specification interface is controlled, yet expressive enough to capture important distributed coordination problems and weaker variants appropriate for wide-area applications. The resulting graphical display shows programmers which messages must be received. Sage allows users to experiment on the derived protocol by crashing processes, reordering events, losing messages, and partitioning the network. If a solution still exists, Sage regenerates the communication graph. This animates the effects of unpredictable system events on distributed applications, and separates the issues in testing a protocol's behavior in the face of failures, from the effects background system conditions can have on the testing procedure itself.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1 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":"130917504","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}
{"title":"Determining the expected load of dynamic tree embeddings in hypercubes","authors":"Keqin Li","doi":"10.1109/ICDCS.1997.603399","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603399","url":null,"abstract":"The main contribution to use recurrence relations in analyzing the performance of a dynamic tree embedding algorithm in hypercubes. These recurrence relations characterize the expected load on each processor in a randomized tree embedding, and enable us to evaluate expected loads numerically and analytically. As a matter of fact, our methodology does not depend on the hypercube topology, and can be applied to study dynamic tree growing in other networks.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"118 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":"117341350","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}
{"title":"Certification reports: supporting transactions in wireless systems","authors":"Daniel Barbará","doi":"10.1109/ICDCS.1997.603384","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603384","url":null,"abstract":"The emergence of small portable computers and the advances in wireless networking have made mobile computing today a reality. Information systems and databases are among the applications that make mobile computing attractive. While the topic of querying data in wireless and mobile systems has received a lot of attention, techniques to efficiently update data in these systems while providing transaction semantics are not fully developed. We present a novel protocol that uses the broadcast facility to help mobile units do some of the work of verifying if the transactions being run by them need to be aborted. Only when the mobile unit cannot detect any conflict is the server involved in completing the verification. Of course, if the transaction can commit, the server will install the valves in the central database and notify the mobile units (again, using the broadcast channel). The protocol uses a modified version of optimistic control. We study the performance of the protocol by means of a detailed simulation.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1 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":"128790307","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}
{"title":"Workload characteristics for process migration and load balancing","authors":"Mark Nuttall, M. Sloman","doi":"10.1109/ICDCS.1997.597896","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597896","url":null,"abstract":"Is process migration useful for load balancing? We present experimental results indicating that the answer to this question depends largely on the characteristics of the applied workload. Experiments with our Shiva system, which supports remote execution and process migration, show that only those CPU bound workloads which were generated using an unrealistic exponential distribution for execution times show improvements for dynamic load balancing. (We use the term 'dynamic' to indicate remote execution determined at and not prior to run time. The latter is known as 'static' load balancing.) Using a more realistic workload distribution and adding a number of short lived tasks prevents dynamic algorithms from working. Migration is only useful with heterogeneous workloads. We find the migration of executing tasks to remote data to be effective for balancing I/O bound workloads, and indicate the region of 'workload variable space' for which this migrate-to-data approach is useful.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"38 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":"114921513","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}
{"title":"Connection-oriented communications for real-time applications in FDDI-ATM-FDDI heterogeneous networks","authors":"Biao Chen, A. Sahoo, Wei Zhao, A. Raha","doi":"10.1109/ICDCS.1997.598036","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598036","url":null,"abstract":"We study connection-oriented service in an FDDI-ATM-FDDI heterogeneous network for real-time applications. We design and analyze an algorithm for connection admission control (CAC) for such a network. Upon a request of connection establishment, the CAC determines if the worst case delays of the requesting and existing connections can be satisfied given the available network resources. If so, the CAC allocates appropriate network resources to the requesting connection. The process of allocating resources for homogeneous networks (e.g. FDDI-only or ATM-only) may not be applied directly to a heterogeneous network environment (e.g. FDDI-ATM-FDDI network) because heterogeneity adds more complexity to the process. Hence resource allocation in a heterogeneous network needs more careful analysis than its homogeneous counterpart. We propose a CAC algorithm that will, by proper parameter tuning, allocate sufficient but not excessive network resources to the requesting connection in an FDDI-ATM-FDDI network. We show that the system can achieve satisfactory performance with this CAC algorithm. Our approach is compatible with current network standards and hence can be readily used in practical systems.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1963 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":"129858747","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}
Qin Zheng, Tetsuya Yokotani, T. Ichihashi, Yasunoni Nemoto
{"title":"Connection admission control for hard real-time communication in ATM networks","authors":"Qin Zheng, Tetsuya Yokotani, T. Ichihashi, Yasunoni Nemoto","doi":"10.1109/ICDCS.1997.598033","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598033","url":null,"abstract":"Connection Admission Control (CAC) as needed in ATM networks to provide Quality of Service (QoS) guarantees real-time connections. In this paper, we present a CAC scheme based on (1) a bit-stream traffic model to describe traffic generation patterns of CBR/VBR connections and traffic distortions within a network, and (2) worst-case queueing analysis to obtain hard cell queueing delay bounds. The proposed CAC scheme can be used for the establishment of hard real-time connections in ATM networks with conventional static priority FIFO queueing switches. The effectiveness of the scheme is illustrated by applying it to an ATM-based Real-Time Plant Control Network (RTPCN) currently under development by the Mitsubishi Electric Corporation. The CAC scheme presented in the paper can also be extended to set up soft real-time connections in ATM networks.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"172 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":"132569256","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}
{"title":"An architecture for post-development configuration management in a wide-area network","authors":"R. Hall, D. Heimbigner, A. Hoek, A. Wolf","doi":"10.1109/ICDCS.1997.598050","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598050","url":null,"abstract":"Few tools exist to address the post-development activities of configuring, releasing, installing, updating, reconfiguring, and even de-installing a software system. Certainly there is no unified approach for all of these activities, and none that can take full advantage of a wide-area network. The Software Dock represents an architecture for supporting post-development activities in such a setting. It is designed as a system of loosely-coupled, cooperating, distributed components that are bound together by a wide-area messaging and event system. In this paper we describe the Software Dock architecture and discuss the use of a prototype in deploying a complex system.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"2012 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":"114450102","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}
{"title":"Design and implementation of an RSVP-based quality of service architecture for integrated services Internet","authors":"T. Barzilai, D. Kandlur, A. Mehra, D. Saha","doi":"10.1109/ICDCS.1997.603412","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603412","url":null,"abstract":"The paper presents the design and implementation of a quality of service architecture for the Internet. The architecture is based on the emerging standards for resource reservation in the Internet, namely the RSVP protocol and the associated service specifications defined by the Internet Engineering Task Force. Our architecture represents a major functional enhancement to the traditional sockets based communication subsystem, while preserving application programming interface and binary compatibility with existing applications. It is scalable and supports a variety of network interfaces ranging from legacy LAN interfaces, such as token ring and Ethernet, to high speed ATM interfaces. We also describe our initial experiences with the implementation of this architecture on the IBM AIX platform.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"25 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":"128650314","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}
{"title":"Multi-threading and remote latency in software DSMs","authors":"K. Thitikamol, P. Keleher","doi":"10.1109/ICDCS.1997.598057","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598057","url":null,"abstract":"This paper evaluates the use of per-node multi-threading to hide remote memory and synchronization latencies in a software DSM. As with hardware systems, multi-threading in software systems can be used to reduce the costs of remote requests by switching threads when the current thread blocks. We added multi-threading to the CVM software DSM and evaluated its impact on performance for a suite of common shared memory programs. Multi-threading resulted in speed improvements of at least 17% in three of the seven applications in our suite, and lesser improvements in the other applications. However, we found that: good performance is not always achievable transparently for non-trivial applications; multi-threading can negatively interact with DSM operations; multi-threading decreases cache and TLB locality; and any multi-threading speedup is dependent on available work.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"30 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":"133405074","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}