By Topic

[1989] Proceedings. The 9th International Conference on Distributed Computing Systems

5-9 June 1989

Filter Results

Displaying Results 1 - 25 of 73
  • 9th International Conference on Distributed Computing Systems (Cat. No.89CH2706-0

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Securely replicating authentication services

    Publication Year: 1989, Page(s):85 - 91
    Cited by:  Papers (8)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (527 KB)

    A framework for designing a type of distributed authentication protocol is given, whose security and availability are higher compared to those of centralized ones. It uses the technique of secret sharing and introduces a cross checksum scheme to achieve secure replication. Fewer than a certain number of malicious servers cannot damage security except by causing denial of service, and this only hap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed diagnosis of Byzantine processors and links

    Publication Year: 1989, Page(s):562 - 569
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The problem of correctly identifying the faulty processors and links in a distributed system where faulty behavior is unrestricted (Byzantine) is examined. A very general class of algorithms called evidence-based diagnosis algorithms is proposed that encompasses all past approaches to the diagnosis problem. An algorithm is presented which is proven optimal in this class. It is further shown that, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing location independent invocation

    Publication Year: 1989, Page(s):550 - 559
    Cited by:  Papers (6)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A brief overview is presented of work on building a highly distributed office application based on mobile objects. The authors explain the techniques used to find the target of an invocation and describe how the technique is implemented. Location-independent invocation (LII) is presented as a conceptual service that is independent of any particular application, operating system, or programming lan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A randomized technique for remote file comparison

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

    A technique for file comparison is presented that is based in a set of signatures that are selected by a randomized algorithm. The sites performing the comparison agree on this randomized set of signatures before any comparison takes place. This technique proves to be very competitive with previously published algorithms. It has an advantage over previous techniques in that one can set up the algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HPC/VORX: a local area multicomputer system

    Publication Year: 1989, Page(s):542 - 549
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A system is described that combines the major strengths of local area networks and multicomputers, namely resource sharing over geographically significant distances and small communication latencies. The result is a new architecture called a local area multicomputer (LAM). The system that is described attempts to solve the seemingly incompatible needs of the two application domains by utilizing a ... View full abstract»

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

    Publication Year: 1989, Page(s):474 - 480
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    A scheme to replicate transactions is described. The scheme allows a k-replicated transaction to survive (k-1) failures. No coordination among the k replicas is needed until one of them reaches the end and proceeds to abort the others. Consequently, the scheme avoids the overhead and delay caused by failure detection reconfiguration, and synchronization during the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic information-structure mutual exclusion algorithm for distributed systems

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

    A dynamic information-structure mutual-exclusion algorithm is presented for distributed systems whose information structure evolves with time as sites learn about the state of the system through messages. It is shown that the algorithm achieves mutual exclusion and is free from starvation. Unlike Maekawa-type algorithms, the proposed algorithm is not prone to deadlocks. This is because its informa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A shared dataspace model of concurrency-language and programming implications

    Publication Year: 1989, Page(s):270 - 279
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    A language paradigm called shared dataspace is defined that causes computations to be performed using an anonymous, content-addressable communication medium acted upon by atomic transactions. To probe the essence of this paradigm, a relatively simple shared dataspace language called Swarm is defined. An overview is presented of the Swarm language. A formal operational model for the language is giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transparent concurrent execution of mutually exclusive alternatives

    Publication Year: 1989, Page(s):44 - 52
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The task of concurrently computing alternative solutions to a problem where only one of the solutions is needed is examined. In this case the rule for selecting between the solutions is faster first, where the first successful alternative is selected. For problems where the required execution time is unpredictable, this method shows substantial execution time performance increases over other metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing and evaluating algorithms for replicated data concurrency control

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

    Many algorithms for replicated data concurrency control are based on voting methods. Techniques are developed for optimizing the assignment of votes in an environment where intersite communications costs are nonuniform and individual site reliabilities vary. These techniques apply to all algorithms that are based on voting. Availability is considered as a realistic measure of reliability, and so i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized evaluation of associative and commutative functions

    Publication Year: 1989, Page(s):9 - 11
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A family of distributed algorithms for decentralized evaluation of associative and commutative functions is presented. It is shown that if N is the member of processes which cooperate to evaluate such a function, then for each positive integer c⩽1 there is an algorithm in the family that carries out the computation in c rounds of message exchange and requires a total... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerance in a very large database system: a strawman analysis

    Publication Year: 1989, Page(s):227 - 236
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    A simple model is used to study the effect of fault-tolerance techniques and system design on system availability. A generic multiprocessor architecture is used that can be configured in different ways to study the effect of system architectures. Important parameters studied are different system architectures and hardware fault-tolerance techniques, mean time to failure of basic components, databa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Ring: a distributed architecture and protocol for local area distributed processing

    Publication Year: 1989, Page(s):534 - 541
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    A ring-based media access control protocol and architecture, Fast Ring, which combines the best features of the token ring and contention ring, is proposed. For this protocol, a free token circulates on the ring when the ring is idle. A ready station can transmit either by capturing the token or sensing the ring idle. The protocol works in such a way that the ready node which captures the free tok... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time-out based resilient token transfer algorithm for mutual exclusion in computer networks

    Publication Year: 1989, Page(s):386 - 393
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Two algorithms, control token transfer algorithm (CTTA) and regenerate, are proposed to realize mutual exclusion in a computer network environment using a resilient circulating token. The algorithm CTTA uses a message called token to transfer the privilege of entering a critical region among the participating sites. The algorithm regenerate checks whether the token is lost during system failures, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The reliability of regeneration-based replica control protocols

    Publication Year: 1989, Page(s):465 - 473
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Several strategies for replica maintenance are considered, and the benefits of each are analyzed. Formulas describing the reliability of the replicated data object are presented, and closed-form solutions are given for the tractable cases. Numerical solutions, validated by simulation results, are used to analyze the tradeoffs between reliability and storage cost. With estimates of the mean times t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Missing-partition dynamic voting scheme for replicated database systems

    Publication Year: 1989, Page(s):579 - 586
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A replication control protocol utilizing dynamic voting is presented for ensuring database correctness so that the system behaves like a one-copy database to the users. The protocol dynamically adjusts vote assignment of data items in response to failures and recoveries, thus maintaining higher data availability than static voting schemes in the event of network partitioning. Unlike existing dynam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling of the modified mesh-connected parallel computer

    Publication Year: 1989, Page(s):490 - 497
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A message-passing computer architecture called the modified mesh-connected parallel computer (MMCPC) is proposed and studied. The MMCPC is designed to be general-purpose parallel architecture suitable for wafer-scale integration. Generalized stochastic Petri nets (GSPNs) are used to model the behavior of the MMCPC. The GSPN performance modeling results show a need for a new processing element (PE)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous regions: a framework for the consistent monitoring of distributed systems

    Publication Year: 1989, Page(s):61 - 68
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A technique is presented by which state information can be organized into unified, consistent representations of the system state through the creation of simultaneous regions. This method provides a general, yet efficient means of establishing the simultaneous relationship necessary for the monitoring and recognition of event occurrences. The types of events for which a computation can be monitore... View full abstract»

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

    Publication Year: 1989, Page(s):246 - 253
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Solutions are presented for both complete and incomplete hypercube initialization problems. Current hypercube computers require that the node number and link numbers be hard-wired into each processor and link. The author introduces algorithms for determining node and link numbers on the fly whenever the system is power up. This makes it possible to exchange or replace nodes without the need of man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive transaction routing in a heterogeneous database environment

    Publication Year: 1989, Page(s):406 - 413
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The issue of transaction routing in a heterogeneous database environment is examined where transaction characteristics like reference locality implies that certain processing systems can be identified as being, in general, more suitable than others for a given transaction class. Routing which ignores these distinctions in an attempt to balance system load can degrade system performance. An adaptiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A toolkit for automated support of Ada tasking analysis

    Publication Year: 1989, Page(s):595 - 602
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    A discussion is presented of research on the development of a toolkit that supports general static analysis using a Petri net framework for Ada tasking. The toolkit integrates some custom and general-purpose tools. The custom tools were defined and implemented specifically for research in Ada tasking analysis; the general-purpose tools are Petri net tools developed to support arbitrary Petri-net-b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to hypercube network analysis

    Publication Year: 1989, Page(s):263 - 268
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A bit-positional notation is proposed for representing the interconnection topology of a hypercube. This approach greatly helps in the analysis of basic properties of a hypercube network. Some systematic procedures are derived to expand binary trees and map them into higher-dimensional hypercubes. The authors show that an n-cube network can be enhanced by adding at most 2n-2 di... View full abstract»

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

    Publication Year: 1989, Page(s):611 - 618
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A technique is presented by which a centralized service facility in a distributed system can honor client requests in the global order in which those requests were made. Unlike traditional approaches to this problem, the server provides immediate service to its clients. Immediate service requires that, upon receipt of a request which is the oldest unserved message, the server must grant the servic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant extensions of complete multipartite networks

    Publication Year: 1989, Page(s):143 - 150
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The authors studied the design of a fault-tolerant extension for a graph G which can survive at most m node failures, and which contains the minimum number of nodes and the fewest possible edges when the nonredundant graph (G) is a complete multipartite graph. After developing a characterization for m-fault-tolerant extensions and for optimal m-fault-to... View full abstract»

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