[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 epistemic logic based synthesis of communication services and protocols

    Publication Year: 1992, Page(s):674 - 681
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The advantages of an initial specification based on the knowledge properties of the service users and service providers for specifying the communication mechanisms of a layer is discussed. This particular way of proceeding with specification causes the designer to express pertinent high level properties that enable the designer to rationally infer a complete specification of the mechanistic attrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a finite projective plane with a duality for decentralized consensus protocols

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

    An efficient communication structure based on a finite projective plane with a duality is presented. The communication structure halves the number messages required in two rounds as compared to a communication structure based on a finite projective plane. It is shown that a finite projective plane with a duality can be constructed from a difference set, and that the communication structure present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Leveraged computing: a task distribution protocol

    Publication Year: 1992, Page(s):563 - 570
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A protocol for controlling a client-server interaction that can exploit underutilized local-area-network (LAN)-based computing resources is discussed. A queuing simulation is used to assess the impact of three sizes of task chunk and two variations of task mix within those chunks in two different LAN environments. The practicality of the protocol in an executive information system or decision supp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general method to define quorums

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

    Composition, a general method for constructing quorum sets, coteries, and bicoteries, is discussed. It is shown that composition provides a natural method for constructing quorum structures in an arbitrary network or even in a collection of interconnected networks, and that the resulting structures, called composite structures, can be efficiently evaluated. In particular, an efficient method for d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MCP: a protocol for coordination and temporal synchronization in multimedia collaborative applications

    Publication Year: 1992, Page(s):606 - 613
    Cited by:  Papers (40)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The multiflow conversation protocol (MCP), which provides two communication abstractions is discussed. MCP provides a token-based mechanism for concurrency control among participants of a multipoint connection and includes a communication abstraction called a multiflow conversation. A conversation may consist of one or more connections, and MCP enforces temporal synchronization in the delivery of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blending hierarchical and attribute-based file naming

    Publication Year: 1992, Page(s):572 - 580
    Cited by:  Papers (7)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    A framework that treats hierarchical naming as a special case of attribute-based naming with constant rules is discussed. The framework allows the construction of a name-spaces-blending hierarchy with characteristics of flat attribute-based systems and provides a comprehensive mechanism for combining these name spaces in flexible ways to build up large distributed structures. The feasibility of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatic test sequence generation for extended finite state machines

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

    A test suite generation method is proposed for conformance testing of communication protocols to solve the problem of generating test sequences for protocol specification models that have memories. A program verification technique called axiomatic semantics, is used to test protocols specified by extended finite state machines (EFSMs). While an EFSM is verified by the technique, observable events ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal coteries for rings and related networks

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

    Although finding an optimal coterie for a general graph G is computationally intractable, it is shown that it can be easily found if G is a ring. Since the solution is already known when G is a complete graph, it is implied that an optimal coterie can be obtained if every biconnected component of G consists of a single edge, a ring, or a complete graph View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transaction model for multidatabase systems

    Publication Year: 1992, Page(s):56 - 63
    Cited by:  Papers (54)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    A transaction model for multidatabase system (MDBS) applications in which global subtransactions may be either compensatable or retriable is presented. In this model compensation and retrying are used for recovery purposes. However, since such executions may no longer consist of atomic transactions, a correctness criterion that ensures that transactions see consistent database states is necessary.... 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.
  • Net level aggregation using nonlinear optimization for the solution of hierarchical generalized stochastic Petri nets

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

    An approach to the hierarchical evaluation of large generalized stochastic Petri net performance models of computer and communication systems is presented. In this method, complex submodels are replaced by substitute nets of lower complexity which bear the same delay time distribution of tokens. An optimum substitute net is found, using nonlinear optimization and matching the delay time distributi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication structures and paradigms for distributed conferencing applications

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

    Communication paradigms and structures for workstation software supporting distributed conferencing applications is discussed. The communication system supports an abstraction of event clusters in which the various events generated by an application activity are bundled into one composite event. The communication and synchronization requirements for implementing the event cluster framework are ide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteeing synchronous message deadlines with the timed token protocol

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

    The problem of guaranteeing synchronous message deadlines in token ring networks in which the timed token medium access control protocol is used is discussed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test result analysis and diagnostics for finite state machines

    Publication Year: 1992, Page(s):244 - 251
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    An algorithm that localizes the faulty transition in a deterministic finite state machine (FSM) once the fault has been detected is presented. The diagnostic algorithm generates, if necessary, additional diagnostic test cases which depend on the observed symptom and which permit the location of the detected fault. The algorithm guarantees the diagnosis of any single fault in an FSM. An application... 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.
  • 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.
  • RAID organization and performance

    Publication Year: 1992, Page(s):318 - 325
    Cited by:  Papers (17)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    A disk array architecture that generalizes the RAID (redundant arrays of inexpensive disks) level V data organization while providing excellent storage utilization, response times, and fault tolerance is discussed. A key feature of the approach is that reliability groups can contain several check data disks beyond the single parity disk. RAID response times for fault-free and failure recovery oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time lock-based concurrency control in distributed database systems

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

    In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. Real-time database transaction scheduling requires the development of efficient concurrency control protocols that try to maximize the number of transactions satisfying their real-time constraints. Several distributed, lock-based, real-time, concurrency con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Token allocation in distributed systems

    Publication Year: 1992, Page(s):64 - 71
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Allocation and reallocation techniques for resources in a distributed database (DDB) system are discussed. An abstract model of the DDB, which partitions data among a set of nodes in a network, is presented. Initial resource allocation and demand driven borrowing policies are investigated using the model. It is shown that a single token borrowing policy which attempts to correct the greatest waste... 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
    Cited by:  Papers (1)
    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.
  • Exploiting iteration-level parallelism in dataflow programs

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

    An approach to extracting iteration-level parallelism from dataflow programs is presented. The method exploits the single-assignment principle, which guarantees that any data value has exactly one producer. To minimize interprocessor communication, the code is modified so that, at run time, each producer executes on the processor that holds the corresponding data. Overhead resulting from possibly ... 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.
  • 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.
  • End-to-end scheduling to meet deadlines in distributed systems

    Publication Year: 1992, Page(s):452 - 459
    Cited by:  Papers (35)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Algorithms for scheduling a class of systems in which all the tasks execute on different processors in turn in the same order are described. This end-to-end scheduling problem is known as the flow-shop problem. Two cases in which the problem is tractable are presented, and a heuristic for the NP-hard general case is evaluated. The traditional flow-shop model is generalized in two directions. First... View full abstract»

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