{"title":"On improving reachability analysis for verifying progress properties of networks of CFSMs","authors":"H. V. Schoot, H. Ural","doi":"10.1109/ICDCS.1998.679495","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679495","url":null,"abstract":"State explosion is well-known to be the principle limitation in protocol verification. In this paper, leaping reachability analysis (LRA) is advocated as an incremental improvement of a verification technique called simultaneous reachability analysis (SRA) to tackle state explosion. SRA is a relief strategy for the verification of progress properties of protocols modeled as networks of communicating finite state machines (CFSMs) without any topological or structural constraints. The improvement is a uniform and property-driven relief strategy which proves to be adequate for detecting all deadlocks, all non-executable transitions, all unspecified receptions and all buffer overflows in a protocol specified in the CFSM model. Experiments show that LRA can largely relieve the state explosion problem by reducing the amount of storage space and execution time required for verification.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"16 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":"116682623","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":"Addressing false causality while detecting predicates in distributed programs","authors":"A. Tarafdar, V. Garg","doi":"10.1109/ICDCS.1998.679491","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679491","url":null,"abstract":"The partial-order model of distributed computations based on the happened before relation has been criticized for allowing false causality between events. Our strong causality model addresses this problem by allowing multiple local threads of control. This paper addresses the predicate detection problem for the class of weak conjunctive predicates in the strong causality model. We show that, in general, the problem is NP-complete. However, an efficient solution is demonstrated for a useful sub-case. Further, this solution can be used to achieve an exponential reduction in time for solving the general problem. Our predicate detection algorithms can be applied to distributed debugging when processes have independent events, as in multi-threaded processes.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"8 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":"122810933","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}
Owen de Kretser, Alistair Moffat, Tim Shimmin, J. Zobel
{"title":"Methodologies for distributed information retrieval","authors":"Owen de Kretser, Alistair Moffat, Tim Shimmin, J. Zobel","doi":"10.1109/ICDCS.1998.679488","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679488","url":null,"abstract":"Text collections have traditionally been located at a single site and managed as a monolithic whole. However, it is now common for a collection to be spread over several hosts and for these hosts to be geographically separated. The authors examine several alternative approaches to distributed text retrieval. They report on their experience with a full implementation of these methods, and give retrieval efficiency and retrieval effectiveness results for collections distributed over both a local area network and a wide area network. They conclude that, compared to monolithic systems, distributed information retrieval systems can be fast and effective, but that they are not efficient.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"59 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":"122625809","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 exception handling in the OPERA process support system","authors":"C. Hagen, G. Alonso","doi":"10.1109/ICDCS.1998.679803","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679803","url":null,"abstract":"Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a normal occurrence. Any programming tool intended for large, complex applications has to face this problem. However, current process support systems, despite their orientation towards complex, distributed, and heterogeneous applications, provide almost no support for exception handling. This paper shows how flexible mechanisms for failure handling are incorporated into the OPERA process support system using a combination of programming language concepts and transaction processing techniques. The resulting mechanisms allow the construction of fault-tolerant workflow processes in a transparent and flexible way while ensuring reusability of workflow components.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"122 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":"123837118","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 scalable scheduling algorithm for real-time distributed systems","authors":"Yacine Atif, B. Hamidzadeh","doi":"10.1109/ICDCS.1998.679738","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679738","url":null,"abstract":"Scheduling real time tasks in a distributed memory multiprocessor is characterized as sequencing a set of tasks and assigning them to processors of the architecture. Real time systems research has extensively investigated the sequencing dimension of the scheduling problem by extending uniprocessor scheduling techniques to more complex architectures. We introduce a technique that uses an assignment oriented representation to dynamically schedule real time tasks on the processors of the system. The technique we propose, automatically controls and allocates the scheduling time, in order to minimize deadline violation of real time tasks, due to the scheduling overhead. We evaluate this technique in the context of scheduling real time transactions in a distributed database application which we implemented on an Intel Paragon distributed memory multiprocessor. In this implementation, we compared the performance of our algorithm with another dynamic algorithm that uses a sequence oriented representation. The results show interesting performance trade-offs among the candidate algorithms and validate our conjectures about scalability performance limitations of sequence oriented representations. The results also show the effect of the mechanisms that our technique uses to control and allocate scheduling time.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"58 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":"131704461","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":"Group communication protocol for real-time applications","authors":"T. Tachikawa, H. Higaki, M. Takizawa","doi":"10.1109/ICDCS.1998.679485","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679485","url":null,"abstract":"In distributed applications, a group of multiple processes cooperate by exchanging messages. It is critical to support the group of application processes with enough quality of service (QoS) including the ordered delivery of messages. The delay time and the message loss ratio are significant QoS parameters. In Internet applications, the delay time and the loss ratio are significantly different in different communication channels. The authors define a novel causality named /spl Delta/*-causality among the messages to hold in the world-wide environment. They discuss how to transmit messages to the destination processes and how to resolve message loss and delay supporting the /spl Delta/*-causality given the requirements of delay time and message loss ratio.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"76 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":"127488020","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":"Competitive sourcing for Internet commerce","authors":"Steven P. Ketchpel, H. Garcia-Molina","doi":"10.1109/ICDCS.1998.679845","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679845","url":null,"abstract":"In electronic commerce on the Internet, a customer can choose among several competitive suppliers, but because of the nature of the Internet, the reliability and trustworthiness of suppliers may vary significantly. The customer's goal is to maximize its utility, by minimizing the expense required to fulfil its request, and maximizing its probability of success by some deadline. To this end, the customer creates a request strategy, describing which suppliers to contact under what conditions. We describe models for representing request strategies complete with supplier reliabilities, delivery timeliness profiles, and customer deadlines. We also develop decision procedures for selecting request strategies that maximize expected utility under certain scenarios, and more efficient heuristics that approximate the optimal solution.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"22 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":"121436006","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":"Quarterware for middleware","authors":"Ashish Singhai, A. Sane, R. Campbell","doi":"10.1109/ICDCS.1998.679502","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679502","url":null,"abstract":"We make two observations about communications middleware: first, most middleware are similar, the differences are in their interfaces and optimizations; second, neither a fixed set of abstractions nor a fixed implementation of a set of abstractions is likely to be sufficient and well-performing for all applications. Based on these observations, we present Quarterware, a customizable middleware architecture. It abstracts basic middleware functionality, and admits application specific specializations and extensions. We demonstrate its flexibility by deriving implementations for core facilities of CORBA, RMI, and MPI. The performance results show that the derived implementations equal or exceed the performance of corresponding native versions. These results suggest that customizing middleware on a per-application basis is an effective approach for building robust, high-performance applications.","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":"121463542","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":"Optimal channel allocation for data dissemination in mobile computing environments","authors":"Qinglong Hu, Lee, Wang-Chien Lee","doi":"10.1109/ICDCS.1998.679782","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679782","url":null,"abstract":"We discuss the wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels are described. We provide analytical models and cost formulae for the exclusive broadcast channels and the exclusive on-demand channels and propose a dynamic channel allocation algorithm for optimizing system performance. Our performance evaluation shows that dynamic channel allocation significantly improves system performance and the channel allocation algorithm gives us the optimal solution for various system parameter settings.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"2013 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114126061","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":"Self-stabilization with global rooted synchronizers","authors":"L. O. Alima, J. Beauquier, A. Datta, S. Tixeuil","doi":"10.1109/ICDCS.1998.679492","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679492","url":null,"abstract":"We propose a self-stabilizing synchronization technique, called the global rooted synchronization, that synchronizes processors in a tree network. This synchronizer converts a synchronous protocol for tree networks into a self-stabilizing version. The synchronizer requires only O(1) memory (other than the memory needed to maintain the tree) at each node regardless of the size of the network, stabilizes in O(h) time, where h is the height of the tree, and does not invoice any global operations. Applications of this technique are presented.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"26 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":"131753557","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}