{"title":"Dynamic definition of entries and attributes in the directory service","authors":"S. Benford","doi":"10.1109/DCS.1988.12560","DOIUrl":"https://doi.org/10.1109/DCS.1988.12560","url":null,"abstract":"Mechanisms are specified for achieving integrity controls over entries and attributes within a directory information base to facilitate the dynamic management of directory information. The existence of the commonly understood directory data and architectural models is assumed. Two directory objects, attribute definitions and entry definitions, are described; they specify the structure of classes of entries and attributes, respectively. The issues of scope and dynamic creation of definitions are given particular attention. A solution is proposed for problems directory management, which is not covered by present standards.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130408531","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":"Toward automating analysis support for developers of distributed software","authors":"J. Wileden, G. Avrunin","doi":"10.1109/DCS.1988.12536","DOIUrl":"https://doi.org/10.1109/DCS.1988.12536","url":null,"abstract":"A constrained expression approach to analyzing large-scale software is presented. Its advantages include broad applicability and reasonable efficiency relative to other proposed approaches. An overview is given of the current status of work on tools supporting analysis of distributed software systems. The constrained expression approach is outlined, and it is shown how it can be used to analyze distributed software. This is illustrated by a description of a recent experiment. An improved prototype toolset currently being built is described. Plans for enhanced tools and further experimentation are summarized.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128269869","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":"Distributed debugging tools for heterogeneous distributed systems","authors":"P. Bates","doi":"10.1109/DCS.1988.12531","DOIUrl":"https://doi.org/10.1109/DCS.1988.12531","url":null,"abstract":"A description is given of a collection of tools that form an implementation of event-based abstraction (EBBA), a paradigm for high-level debugging of distributed systems. The tools are capable of operating effectively in a heterogeneous environment containing processors of varying design and power. Toolset users construct libraries of behavior models and observe the behavior of the system through the models. The toolset is a collection of components that are collectively a distributed system for debugging distributed systems. The components can be combined in varying ways to provide levels of debugging service appropriate for the resources available at individual nodes.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122830251","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":"Load sharing in hybrid distributed-centralized database systems","authors":"B. Ciciani, D. Dias, Philip S. Yu","doi":"10.1109/DCS.1988.12527","DOIUrl":"https://doi.org/10.1109/DCS.1988.12527","url":null,"abstract":"In a hybrid distributed-centralized database system architecture, some transactions run at (geographically) distributed systems, and other transactions at a central computing complex. Static and dynamic load-sharing strategies are studied for such systems. The strategies take into account not only the difference in load at different sites, but also the effect of routing on data-contention and transaction-abort probabilities. Five dynamic strategies are examined and are compared with an optimal static strategy. A dynamic strategy that is based on analytical estimates of the effect of routing on all transactions in the system, rather than that on the incoming transaction alone, is found to be the best.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122969233","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":"DAPHNE: support for distributed applications programming in heterogeneous computer networks","authors":"Klaus-Peter Löhr, Joachim Müller, Lutz Nentwig","doi":"10.1109/DCS.1988.12501","DOIUrl":"https://doi.org/10.1109/DCS.1988.12501","url":null,"abstract":"A description is given of DAPHNE, a system of tools and run-time support routines that allow programs to be broken into parts for distributed execution on different nodes of a heterogeneous computer network. This approach serves as a natural basis for classical network services such as remote file access or remote login while at the same time allowing arbitrary distributed applications to be written in a standard programming language. The pivot of DAPHNE is a remote procedure call mechanism that is specifically adapted to a heterogeneous environment, notably heterogeneous systems software. The current language context of DAPHNE is Modula-2. Prototype software exists for a local area network including Unix and MS-DOS systems.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121181143","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":"Hierarchical distributed simulations","authors":"A. Prakash, C. Ramamoorthy","doi":"10.1109/DCS.1988.12535","DOIUrl":"https://doi.org/10.1109/DCS.1988.12535","url":null,"abstract":"Running simulations in a distributed manner by decentralizing the advancement of clock potentially allows significant speedup. However, because time may not advance at the same rate in the target system and the testbed system, deadlocks that do not occur in the target system can occur during distributed simulation. Previous approaches to deadlock resolution incur either high computation overhead through centralized coordination or high communication overhead through a fully distributed solution. Hierarchical decentralized algorithms that take advantage of the locality of these deadlocks are presented. Overheads associated with time advancement are computed analytically, so that appropriate clustering policies can be designed.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116665716","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 general approach to recognizing event occurrences in distributed computations","authors":"Madalene Spezialetti, J. P. Kearns","doi":"10.1109/DCS.1988.12530","DOIUrl":"https://doi.org/10.1109/DCS.1988.12530","url":null,"abstract":"A generalized approach to the task of monitoring a distributed computation for event occurrences is presented that involves analyzing the characteristics of both the behavior to be recognized and the environment in which it can occur. The monotonicity of an event, which is a measurement of the stableness of its state, is the primary feature used in characterizing events. A general classification system for monitoring strategies is also presented. The classifications are based on the view of time used by the monitoring system, the delay between the occurrence of an event and its recognition, and the assertions that can be made about the system state at the point of recognition. The properties of an event and a computation can be used to determine the applicability of various types of monitoring strategies.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115522425","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":"Shadow editing: a distributed service for supercomputer access","authors":"D. Comer, J. Griffioen, R. Yavatkar","doi":"10.1109/DCS.1988.12520","DOIUrl":"https://doi.org/10.1109/DCS.1988.12520","url":null,"abstract":"The use of long-haul networks by the scientific community to access resources at supercomputing centers has created a need for high-level user services and tools to provide transparent and efficient access to remote resources. A way to provide a computational service for supercomputer access in a distributed environment is described. The issues involved in the design of such a service are discussed, and attention is focused on a remote job submission facility. A prototype implementation is also described.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711393","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 deadlock resolution for lock-based concurrency control schemes","authors":"","doi":"10.1109/DCS.1988.12521","DOIUrl":"https://doi.org/10.1109/DCS.1988.12521","url":null,"abstract":"A distributed algorithm is proposed for detection and resolution of resource deadlocks in object-oriented distributed systems. The algorithm can be used in conjunction with concurrency control algorithms that are based on the semantic lock model. To drastically reduce message traffic, the algorithm properly identifies and eliminates redundant messages. It is shown that its worst and average time complexities are O(ne), where e is the number of edges in the waits-for graph and n is the number of vertices.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"417 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120882419","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":"Evaluation dynamic processing of distributed queries","authors":"P. Bodorik, J. Riordon","doi":"10.1109/DCS.1988.12554","DOIUrl":"https://doi.org/10.1109/DCS.1988.12554","url":null,"abstract":"Several issues that arise in processing distributed queries dynamically are investigated. The effect of inaccuracies in estimation on the cost/delay of strategies is considered. Two methods than can be used to decide whether or not to correct a strategy are examined and compared. The problem of aborting operations in process is also examined, i.e. whether operations which are in progress should be aborted or whether they should be permitted to complete.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703349","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}