[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.
  • Collecting unused processing capacity: an analysis of transient distributed systems

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

    Distributed systems having large numbers of idle computers and workstations are analyzed using a very simple model of a distributed program (a fixed amount of work) to see how the use of transient processors affects the program's service time. The probability density of the length of time it takes to finish a fixed amount of work is determined. An equation is given for the main result for an M... 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 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.
  • 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 k<... 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.
  • 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.
  • Static allocation of periodic tasks with precedence constraints in distributed real-time systems

    Publication Year: 1989, Page(s):190 - 198
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Using two branch-and-bound (B&B) algorithms, an optimal solution is proposed to the problem of allocating (or assigning with the subsequent scheduling considered) periodic tasks to a set of heterogeneous processing nodes (PNs) of a distributed real-time system. The allocation objective is to minimize the maximum normalized task response time, called the system hazard, subject to precedence con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of concurrent pools

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

    Performance considerations affecting the design of a mechanism that preserves locality and avoids high-latency remote references called the concurrent pools data structure are explored. The effectiveness of three different implementations of concurrent pools is evaluated. Experiments performed on a BBN Butterfly multiprocessor under a variety of workloads shown that the three implementations perfo... 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.
  • Capacity testing a HYPERchannel-based local area network

    Publication Year: 1989, Page(s):448 - 454
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Using a hardware monitor, the capacity of a mature (over 10 years old), heavily loaded (5 Cray supercomputers, 3 Ethernet gateways, 13 terminal concentrators, 5000 terminal, 40 node) two-trunk, HYPERchannel-based, high-data-rate local area network was tested. Results indicate that the current load could be intensified by 40% before the network reaches saturation. As the load approaches saturation,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Petri net models for the evaluation of fault-tolerant techniques in distributed systems

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

    Analytical models are presented that use Petri nets for fault-tolerant schemes used in distributed systems. These models are used in the quantitative evaluation and selection of good fault-tolerant schemes for specific system configurations. Several different fault-tolerant schemes that can be modeled using Petri nets are discussed in detail. These schemes include rollback recovery with checkpoint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of distributed shared memory algorithms

    Publication Year: 1989, Page(s):498 - 505
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Results obtained in a study of algorithms to implement a distributed-shared memory in a distributed (loosely coupled) environment are described. Distributed-shared memory is the implementation of shared memory across multiple nodes in a distributed system. This is accomplished using only the private memories of the nodes by controlling access to the pages of the shared memory and transferring data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying finite state real-time discrete event processes

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

    Decision procedures are presented for checking a small but useful class of properties for any finite-state system consisting of real-time discrete-event processes. A timed transition model (TTM) is used for representing real-time discrete-event processes, and real-time temporal logic (RTTL) is the assertion language in which the property to be verified is stated. The relationship of TTMs to other ... 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.
  • 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.
  • 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.
  • 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.
  • An environment for prototyping distributed applications

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

    An environment for prototyping distributed applications is described that supports different communication primitives with specified delays, and provides primitives to aid debugging and evaluation. The environment also supports heterogeneous computation in which processes can execute on different hardware. Different source languages can be used for coding different modules of the processes. The sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for minimum weight spanning trees based on echo algorithms

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

    A distributed algorithm based on echo algorithms is presented which constructs the minimum-weight spanning tree in a general undirected graph. In the worst case, the algorithm needs at most (2m +2(n-1) log (n/2)) messages and (2d log n) time, where d is the diameter of the network. In the best case, it needs only 2m messages and 2d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A service execution mechanism for a distributed environment

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

    A service execution mechanism is designed to provide users transparent access to computational services in a distributed environment. The central idea in this approach is that computations available to the user in a distributed system should be treated as services, where a service is a user-level computation that is offered by one or more machines. The identification of a service is separate from ... View full abstract»

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