[1992] Proceedings of the 12th International Conference on Distributed Computing Systems

9-12 June 1992

Filter Results

Displaying Results 1 - 25 of 86
  • Proceedings of the 12th International Conference on Distributed Computing Systems (Cat No.92CH3175-7)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • An algorithmic method for protocol conversion

    Publication Year: 1992, Page(s):328 - 335
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    An algorithmic method for constructing protocol converters to achieve interoperability between networks that implement incompatible protocols is presented. The converter constructed using this approach does not cause unspecified receptions or deadlocks if the original protocols are safe. The method is guaranteed to generate a valid converter if one exists for the given protocols, with the conversi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An implementation of flush channels based on a verification methodology

    Publication Year: 1992, Page(s):336 - 343
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Flush channels generalize more conventional asynchronous message passing protocols. A distributed system that uses flush channels allows a programmer the flexibility of specifying the delivery order of each message in relation to other messages transmitted on the channel. An implementation technique that follows directly from a verification methodology for flush channels is presented. A relatively... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing protocol converters from service specifications

    Publication Year: 1992, Page(s):344 - 351
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    A four-step algorithm for constructing a protocol converter using the top-down approach is proposed. The algorithm involves construction of a system graph from the required service specification and the service specifications of the target protocols; construction of a service converter and new protocols services from the constructed system graph modification of the given protocols entities, to sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to fault-tolerant routing

    Publication Year: 1992, Page(s):210 - 217
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    A theoretical study of the connectivity and fault tolerance of Cartesian product networks is presented. The theoretical results are used to synthesize provably correct adaptive fault-tolerant algorithms from ones written for the component networks. The theoretical foundations that relate the connectivity of a Cartesian product network, the connectivity of the component networks, and the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing self-stabilization with finite-state machine model

    Publication Year: 1992, Page(s):624 - 631
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    An approach to analyzing self-stabilization based on the finite-state machine model is presented. A finite-state machine is used to model the behavior of each node in a distributed system. when the self-stabilizing algorithms are applied. The approach is useful for analyzing the correctness of self-stabilizing algorithms and their time complexity. A self-stabilizing algorithm for finding maximal m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Garbage collection of a distributed heap

    Publication Year: 1992, Page(s):708 - 715
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A practical, fault-tolerant method for reclaiming inaccessible objects in a distributed heap is presented. The algorithm is general and does not require homogeneous components. It reclaims inaccessible objects in a timely fashion, including those that reside on inaccessible cycles. It allows each computer that contains parts of the heap to garbage collect independently according to its storage req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers

    Publication Year: 1992, Page(s):118 - 125
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Practical and efficient implementations of barrier synchronization for wormhole-routed hypercube multicomputers are presented. Both broadcast and multicast barrier synchronization are considered. For systems that do not support hardware broadcast or multicast, a software U-cube tree is proposed. This method generalizes to n-dimensional meshes. Performance measurements for several barrier ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to migrate processes in distributed computing systems-a Markov team approach

    Publication Year: 1992, Page(s):354 - 361
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    A process migration mechanism offers a means to exploit the performance reserves present in networks of workstations used as personal computers by allowing migration of processes from overloaded to underused processors. Several distributed operating systems provide such a facility, the benefits of its use depending on the specification of a proper process migration policy. An analytical model, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On deriving distributed programs from formal specifications of functional requirements and architectural constraints

    Publication Year: 1992, Page(s):494 - 501
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A method for formal derivation of distributed programs is presented. The approach uses programwide assertions to formulate safety and progress properties of computations. Assertions are used to state functional requirements of the program as well as structural and behavioral constraints imposed by the choice of underlying architecture. The significance of this latter feature is that it offers a si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On conformance in the context of open systems

    Publication Year: 1992, Page(s):236 - 243
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Conformance is one of the key notions in the context of open systems and therefore must be precisely defined. Existing formalizations define conformance independently of the environment into which the open system will be embedded. It is argued that it is, in general, not adequate to guarantee conformance in an intuitive sense. Conformance should relate the visible behavior defined by two specifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A highly adaptive media access protocol for dual bus metropolitan area networks

    Publication Year: 1992, Page(s):186 - 193
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A protocol for dual bus networks that does not show the disadvantages inherent in the IEEE 802.6 standard for metropolitan area networks is proposed. The protocol obtains a fair distribution of bandwidth after a time equal to one round-trip delay and allows a full utilization of the available bandwidth. The protocol is derived from a fair and waste-free bandwidth allocation scheme. The features of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process-channelagent-process model of asynchronous distributed communication

    Publication Year: 1992, Page(s):4 - 11
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A simple model of asynchronous distributed communication, the process-to-channelagent-to-process (PCP) model, is presented. This model is used as a framework for presenting channel grammars that specify channel behavior. The PCP model, in conjunction with channel grammars, provides a versatile and succinct mechanism for specifying and comparing different types of channels, as well as fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed concurrency control with limited wait-depth

    Publication Year: 1992, Page(s):160 - 167
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Distributed wait-depth-limited (DWDL) concurrency control, a locking-based method that limits the wait-depth of blocked transactions to one, which assures that deadlocks are resolved as part of regular transaction processing is described. The performance of DWDL is compared with that of distributed two-phase locking (2PL) and the wound-wait concurrency control method through a detailed simulated. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed constraint satisfaction for formalizing distributed problem solving

    Publication Year: 1992, Page(s):614 - 621
    Cited by:  Papers (56)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditiona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization and concurrency measures for distributed computations

    Publication Year: 1992, Page(s):700 - 707
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Several qualitative measures that quantify the degree of concurrency in a distributed computation are presented. The measures characterize the synchronization constraints inherent in a distributed computation and are independent of the underlying system running the computation. The measures are defined by two well defined abstractions, called cone and cylinder, to which simple measures can be asso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Huffman trees as a basis for a dynamic mutual exclusion algorithm for distributed systems

    Publication Year: 1992, Page(s):126 - 133
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    A distributed mutual exclusion algorithm based on Huffmann trees is described. A request message is passed from a leaf node all the way to the root, signaling that a node is allowed to enter the critical section. Fault tolerance is achieved by forming the Huffman tree dynamically. It is shown that the approach has broad applications in distributed systems where nodes are often organized as a logic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of the join the shortest queue (JSQ) policy

    Publication Year: 1992, Page(s):362 - 366
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    An analytical method is developed to analyze the performance of the join the shortest queue (JSQ) policy for systems with N identical queues, N⩾2. No simulation result is used to refine the analytical model. A birth-death Markov process is used to model the evolution of the total number of jobs in the system. An iterative procedure is developed to estimate the average service... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An architecture of a threaded many-to-many remote procedure call

    Publication Year: 1992, Page(s):504 - 511
    Cited by:  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The client-agent-server architecture, which serves as a flexible mechanism for many-to-many remote procedure calls, is discussed. The architecture provides a transparent view of the server to a client. The client accesses the server group through the agent while retaining only an abstract view of the server. The call primitives for the client, agent groups, hook construction and primitives (hooks ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic characterization of algebraic protocol specifications

    Publication Year: 1992, Page(s):260 - 268
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A generative model for extending algebraic protocol specifications with probabilities is presented. The approach associates a simple probabilistic characterization with each algebraic operator occurrence in a behavior expression. The result is a compact notation in which the assignment of probabilities is more straightforward than with transition-based models. It is shown that an equivalent state ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient data interface for heterogeneous distributed environments

    Publication Year: 1992, Page(s):390 - 397
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A multi-language-based data interface system for heterogeneous distributed processing is introduced. A prototyped environment based on this system is discussed, and an evaluation of the prototyped system is presented. It is shown that by keeping the syntax of the specification language flexible and close to existing high-level languages, a user can learn the interface language quickly. Semanticall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the reliability of name resolution mechanism in distributed operating systems

    Publication Year: 1992, Page(s):589 - 596
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A way to improve the reliability of the name resolution mechanism in distributed operating systems is proposed. It is shown that the name resolution mechanism can be made highly reliable by achieving a high degree of reliability of the name resolution operation for a limited number of pairs. To take care of the changing reliability needs of a particular user for different objects with the passage ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data base recovery in shared disks and client-server architectures

    Publication Year: 1992, Page(s):310 - 317
    Cited by:  Papers (3)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Solutions to the problem of performing recovery correctly in shared-disks (SD) and client-server (CS) architectures are presented. In SD, all the disks containing the data bases are shared among multiple instances of the database management system (DBMS). In CS, the server manages the disk version of the data base. The clients, after obtaining database pages from the server, cache them in their bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast models and routing algorithms for high speed multi-service networks

    Publication Year: 1992, Page(s):194 - 201
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    The abstraction of tree structured communication channels used in wide-area packet multicasting are generalized by introducing the notions of acyclic graph and two user specifiable attributes, data directionality and transport quality of service. The abstraction is useful for multiservice networks in which applications have diverse transport requirements such as variable data rates and unidirectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient protocol for voting in distributed systems

    Publication Year: 1992, Page(s):640 - 647
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    A voting protocol that can reduce the communication costs in distributed systems significantly is proposed. The technique arranges nodes in small intersecting groups, such that a site, in absence of failures, needs to communicate only with members of its group to collect the quorum. A method for constructing such logical groups is presented. It is shown that the message overhead of any operation i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.