{"title":"Improving data freshness in lazy master schemes","authors":"Esther Pacitti, E. Simon, R. Melo","doi":"10.1109/ICDCS.1998.679499","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679499","url":null,"abstract":"Many distributed database applications need to replicate data to improve data availability and query response time. The two phase commit protocol guarantees mutual consistency of replicated data but does not provide good performance. Lazy replication has been used as an alternative solution in several types of applications such as online financial transactions and telecommunication systems. In this case, mutual consistency is relaxed and the concept of freshness is used to measure the deviation between replica copies. We propose two update propagation strategies that improve freshness. Both of them use immediate propagation: updates to a primary copy are propagated towards a slave node as soon as they are detected at the master node without waiting for the commitment of the update transaction. We study the behavior of our strategies and show that they improve data freshness with respect to the deferred approach.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131628407","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":"Flexible protocol composition in BAST","authors":"B. Garbinato, R. Guerraoui","doi":"10.1109/ICDCS.1998.679466","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679466","url":null,"abstract":"The paper presents BAST, an object-oriented library of reliable distributed protocols. The authors show how BAST can be used to build fault-tolerant distributed applications, and how new protocols can be added to it. They discuss some distributed protocol design issues and the way these issues are circumvented in BAST. They briefly describe their Smalltalk and Java implementations of BAST, together with some performance results.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131342089","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":"Khazana: an infrastructure for building distributed services","authors":"J. Carter, A. Ranganathan, Sai Susarla","doi":"10.1109/ICDCS.1998.679815","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679815","url":null,"abstract":"Essentially all distributed systems, applications, and services at some level boil down to the problem of managing distributed shared state. Unfortunately, while the problem of managing distributed shared state is shared by many applications, there is no common means of managing the data-every application devises its own solution. We have developed Khazana, a distributed service exporting the abstraction of a distributed persistent globally shared store that applications can use to store their shared state. Khazana is responsible for performing many of the common operations needed by distributed applications, including replication, consistency management, fault recovery, access control and location management. Using Khazana as a form of middleware, distributed applications can be quickly developed from corresponding uniprocessor applications through the insertion of Khazana data access and synchronization operations.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124387075","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":"A language for specifying the composition of reliable distributed applications","authors":"F. Ranno, S. Shrivastava, S. Wheater","doi":"10.1109/ICDCS.1998.679806","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679806","url":null,"abstract":"This paper describes the design of a scripting language aimed at expressing task (unit of computation) composition and inter-task dependencies of distributed applications whose execution could span arbitrary large durations. This work is motivated by the observation that an increasingly large number of distributed applications are constructed by composing them out of existing applications and are executed in an heterogeneous environment. The resulting applications can be very complex in structure, containing many notification and dataflow dependencies between their constituent applications. The language enables applications to be structured with the properties of modularity, interoperability, dynamic reconfigurability and fault-tolerance.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076218","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":"A protocol for removing communication intrusion in monitored distributed systems","authors":"Wanqing Wu, Madalene Spezialetti, Rajiv Gupta","doi":"10.1109/ICDCS.1998.679494","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679494","url":null,"abstract":"The development of a distributed application that exhibits both desired functionality as well as performance is a complex task. Therefore, the construction of monitoring tools to assist in the development of complex distributed applications is of great practical significance. For example, monitoring tools can be used to observe the behavior and fine tune the performance. One of the fundamental problems that must be addressed is to ensure that the monitoring tool is able to report the true behavior of an application, that is, it is able to monitor the application non-intrusively. We identify the intrusive effects of monitoring on communication in an arbitrary point-to-point network and present the enhanced communication protocol for on-line communication intrusion removal. Our experiments demonstrate that the intrinsic overhead of a distributed system integrated with online intrusion removal techniques is 0.43%, 98.3% of intrusion on the accumulated number of events and 97.2% of intrusion on the sequence of event occurrences can be removed successfully.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117094825","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":"Reflective data sharing in managing Internet databases","authors":"A. Bouguettaya, B. Benatallah, D. Edmond","doi":"10.1109/ICDCS.1998.679500","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679500","url":null,"abstract":"The popularity of the Internet has generated an explosion in the number of accessible information sources. In addition, recent advances in wide-area networking have led to a push for a logically-unified, yet physically distributed, information repository accessible through the Internet. The architecture of data resources and sources should be scalable and able to accommodate hundreds and thousands of databases. These are called Internet databases. This has to be achieved against a backdrop of accommodating database autonomy and bridging their heterogeneity with reasonable overhead. In addition, manual and evolution management needs a careful design as ad hoc management is clearly intractable in a highly dynamic environment as the Internet. Therefore, there is a need for supporting a self-adjustable model of evolution. We propose an architecture that has the ability to reflect upon its own state and to decide when to evolve. The use of flexible constructs like service links, coalitions, and co-databases provide a dynamic and portable model for eliciting data sharing. Further, we propose an implementation model using CORBA and Web related technologies.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121596197","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":"A framework for dependability driven software integration","authors":"N. Suri, S. Ghosh, T. Marlowe","doi":"10.1109/ICDCS.1998.679755","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679755","url":null,"abstract":"The integration of system and SW functions for efficiency, performance and especially dependability is of interest from a research and system design perspective. We propose a framework for directing the process of integration of SW functions, with the objective of designing and maintaining desired dependability attributes of the system over the integration process. Rules of composition for integrated functions, and measures to quantify the goodness of dependable system integration are also addressed.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114400828","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":"Using broadcast primitives in replicated databases","authors":"I. Stanoi, D. Agrawal, A. E. Abbadi","doi":"10.1109/ICDCS.1998.679497","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679497","url":null,"abstract":"We explore the use of different variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a two-phase commitment protocol for ensuring correctness. We then develop a second protocol that uses causal broadcast and avoids the overhead of two-phase commit by exploiting the causal delivery properties of the broadcast primitives to implicitly collect the relevant information used in two-phase commit. Finally, we present a protocol that employs atomic broadcast and completely eliminates the need for acknowledgements during transaction commitment.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531898","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":"Timestamps for programs using messages and shared variables","authors":"A. Bechini, K. Tai","doi":"10.1109/ICDCS.1998.679522","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679522","url":null,"abstract":"Algorithms for vector timestamps have been developed to determine the \"happened before\" relations between events of an execution of a message passing program. Many message passing programs contain variables shared by multiple processes (including threads). Such programs need to have vector timestamps for send, receive, read and write events. We define two \"happened-before\" relations, called strong happened-before (SHB) and weak happened-before (WHB), between events of an execution involving send, receive, read and write statements. We then present two timestamp assignment algorithms, one for SHB and the other for WHB, and show how to use such timestamps to determine the SHB or WHB relation between any two events of an execution involving send, receive, read and write statements. For a program containing n processes, the size of a vector timestamp for SHB or WHB is n, regardless of the number of shared variables in the program. Finally, we show how to apply WHB timestamps to perform race analysis for programs using messages and shared variables.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131171933","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":"Experience with secure multi-processing in Java","authors":"D. Balfanz, L. Gong","doi":"10.1109/ICDCS.1998.679754","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679754","url":null,"abstract":"As the Java/sup TM/ platform is the preferred environment for the deployment of network computers, it is appealing to run multiple applications on a single Java enabled desktop. We experimented with using the Java platform as a multiprocessing, multi user environment. Although the Java Virtual Machine (JVM) is not inherently a single application design, we have found that the implementation of the Java Development Kit (JDK) often implicitly assumes that the JVM runs exactly one application at any one time. We report on the limitations we encountered and propose improvements to several aspects of the Java technology architecture, including its security features. We have implemented all the proposed changes in a prototype based on an in-house beta version of JDK 1.2. Our prototype uses a Bourne shell like command line tool to launch multiple applications (such as Appletviewer) within one JVM.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122649498","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}