Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

[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.
  • 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.
  • Intelligent routers

    Publication Year: 1989, Page(s):371 - 376
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The authors describe a mechanism known as intelligent routers that provides a means to implement distributed applications in a heterogeneous environment. A router is a process that may explicitly request to migrate to another machine so it can avail itself of that machine's capabilities. The router environment supports the migration despite differences in the computer hardware, operating systems, ... 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.
  • Some graph partitioning problems and algorithms related to routing in large computer networks

    Publication Year: 1989, Page(s):362 - 370
    Cited by:  Papers (3)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    The problem of partitioning a large computer network into clusters in order to reduce the amount of network resources consumed by the routing algorithm is addressed. The clustering problem is formulated as a general graph partitioning problem. It is shown that the problem of partitioning a graph into a minimum number of clusters with unit weight vertices and a given weight bound on the cluster siz... 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 (7)  |  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.
  • A protocol for timed atomic commitment

    Publication Year: 1989, Page(s):199 - 206
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A model and correctness criteria for timed atomic commitment (TAC) are presented which require the processes to be functionally consistent, but allow the outcome to include an exceptional state, indicating that timing constraints have been violated. Correct TAC behavior is defined by presenting an abstract description of the processes involved in the commitment and minimal correctness criteria for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message ordering in a multicast environment

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

    Three ordering properties are characterized, namely, single-source, multiple-source, and multiple-group ordering, and their solutions are discussed. The multiple-group ordering property, which guarantees that two messages destined to two processes are delivered in the same relative order, even if they originate at different sources and are addressed to different multicast groups, is concentrated o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A flexible algorithm for replicated directory management

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

    A replicated directory management algorithm is presented that supports full location-transparency by allowing migration and reconfiguration at the granularity of individual names. Initially, all names in a directory (including names not yet in use) are controlled by the same set of sites, but control over any individual name (or range of names) can be migrated, e.g. to the set of sites that contro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low cost algorithms for message delivery in dynamic multicast groups

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

    Heuristics for constructing low-cost multicast spanning trees in a dynamic environment are investigated. Two heuristic algorithms are developed that update the multicast tree incrementally as the membership changes and reduce the total bandwidth required for sending data and control messages. The broadcast tree based algorithm makes use of a tree structure in the network, and the other algorithm j... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CONCERT: a high-level-language approach to heterogeneous distributed systems

    Publication Year: 1989, Page(s):162 - 171
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Concert, a high-level-language approach to programming heterogeneous distributed systems, is described. The Concert model introduces a small set of language extensions into conventional procedural languages. These language extensions support a cooperative peer process model which addresses in the distributed environment the same issues addressed by language semantics in the conventional environmen... 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.
  • 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.
  • Static allocation of periodic tasks with precedence constraints in distributed real-time systems

    Publication Year: 1989, Page(s):190 - 198
    Cited by:  Papers (37)  |  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.
  • 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.
  • 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.
  • 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.
  • Reliable distributed sorting through the application-oriented fault tolerance paradigm

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

    The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message-optimal incremental snapshots

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

    The problem of obtaining a global state or snapshot of a distributed processing system is considered. A message-efficient protocol is presented for obtaining incremental snapshots. First, worst-case lower bounds on the number of messages used by any protocol that solves the incremental snapshot problem are given, and then a protocol that is message-efficient is provided. This protocol obtains a sn... 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.
  • 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.
  • 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.
  • Efficient algorithms for resource allocation in distributed and parallel query processing environments

    Publication Year: 1989, Page(s):316 - 323
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Several effective algorithms are presented for the optimal allocation of computer resources in a proposed stream-oriented parallel-processing scheme for database operations. These algorithms can be utilized to obtain the optimal allocation of memory resources for every type of query in sequential-processing environments, parallel-processing environments with shared-memory multiprocessors, and dist... 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.