{"title":"Real-time primary-backup (RTPB) replication with temporal consistency guarantees","authors":"Hengming Zou, F. Jahanian","doi":"10.1109/ICDCS.1998.679486","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679486","url":null,"abstract":"The paper presents a real-time primary-backup (RTPB) replication scheme for supporting fault-tolerant real-time applications. It formally defines two types of temporal consistency, namely external temporal consistency and inter-object temporal consistency. By introducing a key concept called phase variance, the authors are able to build temporal consistency models and derive necessary and sufficient conditions that can be used as the basis for update and transmission scheduling that achieve temporal consistency guarantees. Furthermore, they prove that the term phase variance used in the models can be bounded under various scheduling algorithms, namely EDF, rate monotonic and distance-constrained scheduling. A RTPB implementation was developed within the x-kernel architecture on the MK 7.2 microkernel and the results of a detailed performance evaluation is also discussed.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"104 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":"132759990","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}
W. E. Walsh, Michael P. Wellman, Peter R. Wurman, Jeffrey K. MacKie-Mason
{"title":"Some economics of market-based distributed scheduling","authors":"W. E. Walsh, Michael P. Wellman, Peter R. Wurman, Jeffrey K. MacKie-Mason","doi":"10.1109/ICDCS.1998.679848","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679848","url":null,"abstract":"Market mechanisms solve distributed scheduling problems by allocating the scheduled resources according to market prices. We model distributed scheduling as a discrete resource allocation problem, and demonstrate the applicability of economic analysis to this framework. Drawing on results from the literature, we discuss the existence of equilibrium prices for some general classes of scheduling problems, and the quality of equilibrium solutions. We then present two auction protocols for implementing solutions, and analyze their computational and economic properties.","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":"130477202","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}
Özalp Babaoglu, R. Davoli, A. Montresor, R. Segala
{"title":"System support for partition-aware network applications","authors":"Özalp Babaoglu, R. Davoli, A. Montresor, R. Segala","doi":"10.1109/ICDCS.1998.679501","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679501","url":null,"abstract":"Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts. We consider partition awareness as an instance of environment awareness in network applications that need to be reliable and self-managing. Partition-aware applications dynamically reconfigure themselves and adjust the quality of their services in response to partitioning and merging of networks. As such, they can automatically adapt to changes in the environment so as to remain available in multiple partitions without blocking, albeit with reduced or degraded functionality. We propose a system layer consisting of group membership and reliable multicast services that provides systematic support for partition-aware application development. We illustrate the effectiveness of the proposed interface by solving several problems that represent different classes of realistic network applications.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"20 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":"131417415","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":"Lightweight transactions on networks of workstations","authors":"A. Papathanasiou, E. Markatos","doi":"10.1109/ICDCS.1998.679811","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679811","url":null,"abstract":"Although transactions have been a valuable abstraction of atomicity, persistency, and recoverability, they have not been widely used in programming environments today, mostly because of their high overheads that have been driven by the low performance of magnetic disks. A major challenge in transaction-based systems is to remove the magnetic disk from the critical path of transaction management. We present PERSEAS, a transaction library for main memory databases that decouples the performance of transactions from the magnetic disk speed. Our system is based on a layer of reliable main memory that provides fast and recoverable storage of data. We have implemented our system as a user-level library on top of the Windows NT operating system in a network of workstations connected with the SCI interconnection network. Our experimental results suggest that PERSEAS achieves performance that is orders of magnitude better than traditional recoverable main memory systems.","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":"133700700","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":"Efficient ordered broadcasting in reliable CSMA/CD networks","authors":"P. Jalote","doi":"10.1109/ICDCS.1998.679493","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679493","url":null,"abstract":"Ordered broadcast is a communication paradigm which requires that all the nodes in the network receive a message, and that the nodes receive the different messages in the same order. Ordered broadcast is particularly useful for supporting fault tolerance in distributed systems. We present a protocol for ordered broadcasts in a CSMA/CD network that uses the high reliability and collision detection properties of these networks in a novel manner. The control of the protocol is distributed, and even if the sender of a message fails after transmitting a message which is missed by some nodes, the ordered broadcast property is satisfied. The protocol has a small overhead, but requires both hardware and software support for implementation.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"23 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":"128073485","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":"Granularity control for distributed execution of logic programs","authors":"G. Xirogiannis","doi":"10.1109/ICDCS.1998.679506","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679506","url":null,"abstract":"Distributed execution of logic programs requires a match of granularity between a program and the distributed multiprocessor it runs on to exploit its potential for performance fully. This paper presents methods to control the granularity of tasks on distributed heterogeneous processors effectively. It considers the characteristics of such platforms and relates the amount of local computation with the significant communication overheads by introducing the notion of a collection of parallel tasks. The experimental results indicate that the proposed controls can model all kinds of predicates (recursive, mutually recursive etc.) satisfactorily and improve the performance of various forms of parallelism (AND, OR, combinations).","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"33 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":"126893420","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}
K. Chandran, S. Raghunathan, S. Venkatesan, R. Prakash
{"title":"A feedback based scheme for improving TCP performance in ad-hoc wireless networks","authors":"K. Chandran, S. Raghunathan, S. Venkatesan, R. Prakash","doi":"10.1109/ICDCS.1998.679778","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679778","url":null,"abstract":"Ad-hoc networks are completely wireless networks of mobile hosts, in which the topology rapidly changes due to the movement of mobile hosts. This frequent topology may lead to sudden packet losses and delays. Transport protocols like TCP have been built mainly for reliable, fixed networks. Hence, when used in ad-hoc networks, TCP misinterprets this loss as congestion and invokes congestion control. This leads to unnecessary retransmissions and loss of throughput. To overcome this problem, a feedback scheme is proposed, so that the source can distinguish between route failure and network congestion. When a route is disrupted, the source is sent a route failure notification (RFN) packet, allowing it to freeze its timers and stop sending packets. When the route is re-established, the source is informed through a route re-establishment notification (RRN) packet, upon which it resumes by unfreezing timers and continuing packet transmissions. The simulated performance of TCP on ad-hoc networks with and without feedback is compared and reported. It is observed that in the event of route failures, as the route re-establishment time increases, the use of feedback provides significant gains in throughput as well as savings in unnecessary packet transmissions. Several further enhancements and directions for future work are also sketched.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"12 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":"128021084","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}
E. Anceaume, G. Cabillic, Pascal Chevochot, I. Puaut
{"title":"HADES: a middleware support for distributed safety-critical real-time applications","authors":"E. Anceaume, G. Cabillic, Pascal Chevochot, I. Puaut","doi":"10.1109/ICDCS.1998.679736","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679736","url":null,"abstract":"Most distributed safety critical real time systems designed in the past have been specialized to meet the particular requirements of the application domain to which they were targeted. This approach led to specific, inflexible, dedicated and non reusable solutions, often based on specialized hardware. The paper presents an overview of HADES, which provides a set of flexible tools built on top of off the shelf hardware, and designed to help in the construction of a panel of distributed safety critical real time applications. In order for HADES to support the execution of the widest range of applications, we have followed a rigorous methodology based on: (i) the separation of services dedicated to a specific application domain (scheduling policy) from services providing a range of robustness properties common to a large spectrum of application domains (e.g. task dispatching, fault detection, clock synchronization, monitoring); (ii) the provision of a precise cost information induced by all these services in order to increase the accuracy of the application feasibility test.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"11 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":"121608365","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}