Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

[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
  • Distributed file allocation with consistency constraints

    Publication Year: 1992, Page(s):408 - 415
    Cited by:  Papers (11)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The resource allocation problem in distributed computing systems that have strict mutual consistency requirements is discussed. A model that incorporates the behavior of consistency control algorithms which ensure that mutual consistency of replicated data is preserved even when communication links of the computer network and/or computers on which the files reside fail is presented. The constraine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting a weak consistency to implement distributed tuple space

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

    Multiprotocol tuple space (MTS), a distributed implementation of tuple space, is discussed. Although tuple space provides primitives convenient for describing several types of communication and data sharing, its naive implementation in distributed environments is not efficient without special hardware. MTS is a replication-based implementation on conventional workstations and a network. It provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient decentralized consensus protocols in a distributed computing system

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

    Two classes of efficient decentralized consensus protocols for a distributed computing system consisting of an arbitrary number of nodes, one without an initiator and the other with an initiator, are described. It is shown that the protocol without an initiator can be systematically executed and completed in the minimal number of steps. The protocol with an initiator is divided into three phases: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type-specific coherence protocols for distributed shared memory

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

    The concept of a structured distributed shared memory in which memory units are objects is introduced. The coherence of object replicas is maintained by type-specific coherence protocols that are based on the semantics of operations on objects. The aim is to reduce message traffic and operation latency in many common situations. The protocols subsume traditional distributed shared memory protocols... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed, scalable, and static parallel arc consistency algorithms on private memory machines

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

    Several arc consistency algorithms for sequential and parallel processing computers are reviewed. Three distributed parallel arc consistency algorithms-DSPAC-1, DSPAC-2, and DSPAC-3-are introduced and compared with existing algorithms. Through actual machine experimentation the time required for the DSPAC algorithms was measured and compared with that for existing sequential algorithms. Results in... 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 (34)  |  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.
  • Sparse time versus dense time in distributed real-time systems

    Publication Year: 1992, Page(s):460 - 467
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The restriction of the significant event occurrences, i.e., the sending and receiving of messages in a distributed real-time system, to the lattice points of a globally synchronized space/time lattice are discussed. One dimension of this space/time lattice represents the progression of time, the other dimension denotes the computational processes in the system. It is shown that this additional con... 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 (35)  |  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.
  • An all-sharing load balancing protocol in distributed systems on the CSMA/CD local area network

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

    A protocol for dynamic load balancing in distributed systems on the CSMA/CD local area network is presented. Using the protocol, the workload is evenly distributed throughout the system when load-balancing activity is triggered, and effective load distribution is accomplished through transmission of load-balancing messages in a collision-free manner. Analytical and simulation results are presented... 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 (6)
    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.
  • Open CSCW systems: will ODP help?

    Publication Year: 1992, Page(s):547 - 554
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The need for open computer support for cooperative work (CSCW) systems is examined. Their requirements and impact on distributed systems are discussed. The Mocca project for developing an environment which will support open CSCW systems is described. It is shown that the open distributed systems (ODP) experience and approach can be a valuable tool in realizing open CSCW systems. Similarly, the ODP... 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.
  • Formal analysis of waiting times for distributed real-time processes

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

    An approach to automated timing analysis of distributed real-time programs is presented. The method is based on the static analysis of the task system and generation of global operation (GO) paths for which the timing analysis is applied. It is shown that a closed form solution algorithm is NP-complete. In order to more efficiently determine maximum waiting times for tasks sharing resources, even ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new communication tool: time dependent multimedia document

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

    Time dependent multimedia document (TDMD), a tool that supports human communication under distributed computing environments, is described. TDMD supports various types of communication media, including audio, video, text, graphics, and image. Multimedia presentation is formally defined, and it is shown that, TDMD can be represented uniquely as a tree structure. In the structure, hyperlink informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replication control for distributed real-time database systems

    Publication Year: 1992, Page(s):144 - 151
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    An algorithm that integrates real-time scheduling with replication control is presented. The algorithm adopts a token-based scheme for replication control and attempts to balance the urgency of real-time transactions with the conflict resolution policies. In addition, the algorithm employs epsilon-serializability (ESR), a correctness criterion that is less stringent than conventional one-copy seri... 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.
  • TQL: a tasking query language for concurrent program analysis

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

    A tasking query language (TQL) for aiding very general analysis of Ada tasking in a Petri-net-based environment is discussed. An important principle of TQL's design is that of hiding the formalism upon which the analysis framework is built. Instead, TQL defines a language by which queries of Ada interactions themselves can be expressed. Examples of TQL's capabilities are presented, and a sample an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comet: a toolkit for multiuser audio/video applications

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

    Comet, a UNIX/C++ toolkit for writing programs, such as teleconferencing systems and collaborative editors, that involve multiple users and use digital audio video, is described. Comet provides a simple programming interface: the application builds a graph of objects representing speakers and microphones, mixers, files, etc. Comet realizes the graph by creating and interconnecting processes and au... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Naming and addressing of objects without unique identifiers

    Publication Year: 1992, Page(s):581 - 588
    Cited by:  Papers (4)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The hierarchical naming scheme, a method for naming and addressing shared objects in large-scale distributed computer systems, is described. The scheme constructs global identifications (IDs) and addresses from locally unique ones. The IDs have relative representations that are translated if they are transmitted among naming contexts. This ensures uniqueness of IDs while preserving efficiency and ... 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.
  • Asynchronous unison

    Publication Year: 1992, Page(s):486 - 493
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Unbounded and bounded designs of asynchronous unison systems are discussed. It is shown that both systems are stabilizing in the sense that their steady state behaviors do not depend on their initial states. The systems can therefore tolerate memory and reconfiguration faults that may yield them in arbitrary states. It is also shown that unison systems are useful in designing multiphase systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive routing in mesh-connected networks

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

    It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduc... 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.