[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.
  • 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.
  • 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.
  • Programming the twisted-cube architectures

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

    A network is proposed that preserves all of the properties of the hypercube, but has a diameter which is only about half of that of the hypercube. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message complexity of simple ring-based election algorithms-an empirical analysis

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

    Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the ra... 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.
  • Performance implications of design alternatives for remote procedure call stubs

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

    The authors take efficient kernel-level support as a given, and study the performance implications of design alternatives one level up-in the stubs, which insulate the client and server from details about network communication. These alternatives represent a collection of approaches to achieving standard remote procedure call of semantics. Consideration is given to the performance implications of ... 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.
  • 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.
  • Fault-tolerant distributed systems based on broadcast communication

    Publication Year: 1989, Page(s):129 - 134
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (540 KB)

    Distributed systems present problems of maintaining consistency of distributed data in the presence of faults. These problems are currently solved by agreement protocols that require many messages to be exchanged between processors with adverse effects on system performance. An approach is presented to the design of fault-tolerant distributed systems that avoids this message exchange, resulting in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of group testing to the file comparison problem

    Publication Year: 1989, Page(s):237 - 243
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (500 KB)

    The file comparison problem involves the detection of differences between two copies of the same file located at different sites in a distributed computing system. The file is assumed to be partitioned into n pages, and a signature (checksum) is available for each page. Some ideas from nonadaptive group testing are used to obtain a solution to this problem for the case of arbitrary d<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QuickSilver support for access to data in large, geographically dispersed systems

    Publication Year: 1989, Page(s):28 - 35
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (708 KB)

    QuickSilver is a distributed operating system that is intended for large, geographically dispersed systems. The authors describe how clients and data servers interact in the QuickSilver system to access distributed data in the context of large, geographically dispersed systems in which there are many different kinds of data servers. An interface is defined that provides a uniform way for clients a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to verification of communication in distributed computing system software

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

    An approach is presented for verifying the communication among modules in distributed computing system software. This approach is based on the inductive assertion method. The inference rules used in this approach are derived for verifying the partial correctness of communicating sequential modules. In this approach, the virtual circuits are used for synchronous message-passing. The advantage of th... 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.
  • Adaptive load sharing in heterogeneous systems

    Publication Year: 1989, Page(s):298 - 306
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (672 KB)

    The performance characteristics of simple load-sharing algorithms are studied for heterogeneous distributed systems. It is assumed that non-negligible delays are encountered in transforming jobs from one node to another and in gathering remote state information. The effects of these delays on the performance of two algorithms called Forward and Reverse are analyzed. Queuing theoretic models are fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linking consistency with object/thread semantics: an approach to robust computation

    Publication Year: 1989, Page(s):121 - 128
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (724 KB)

    An object/thread based paradigm is presented that links data consistency with object/thread semantics. The paradigm can be used to achieve a wide range of consistency semantics from strict atomic transactions to standard process semantics. The paradigm supports three types of data consistency. Object programmers indicate the type of consistency desired on a per-operation basis, and the system perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting termination of distributed computations by external agents

    Publication Year: 1989, Page(s):79 - 84
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    An algorithm is presented that defects for termination of distributed computations by an auxiliary controlling agent. The algorithm assigns a weight W, 0<W⩽1, to each active process and to each message in transit. The algorithm maintains that the sum of all the weights related to the computation is equal to one. The controlling agent terminates the algorithm if its weight ... 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.
  • 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.
  • The design of a high-performance file server

    Publication Year: 1989, Page(s):22 - 27
    Cited by:  Papers (6)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (444 KB)

    The Bullet server is a file server that outperforms traditional file servers by more than a factor of three. It achieves high throughput and low delay by a software design radically different from that of file servers currently in use. Whereas files are normally stored as a sequence of disk blocks, each Bullet server file is stored contiguously, both on disk and in the server's random access memor... 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.
  • Performance of a decentralized knowledge base system

    Publication Year: 1989, Page(s):343 - 352
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 KB)

    The binary predicate execution model (BPEM) is a computational model that combines logic programming, semantic nets, and message-driven computation into a paradigm for the construction of highly parallel knowledge-base systems. Simulation results are presented that demonstrate the ability of BPM to exploit effectively the resources of a loosely coupled computer network consisting of large numbers ... 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.
  • A probabilistic approach to distributed clock synchronization

    Publication Year: 1989, Page(s):288 - 296
    Cited by:  Papers (22)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (700 KB)

    A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays. The method can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms. The method can be used to improve the precision of both internal and external synchronization algorithms. The approach is p... View full abstract»

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