By Topic

Distributed Computing Systems, 1989., 9th International Conference on

Date 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.
  • 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.
  • Analysis of communicating processes for non-progress

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

    The problem of testing two processes (specified as finite-state machines) communicating asynchronously with each other using send and receive commands over a set of message types is considered for two forms of nonprogress: deadlock and unspecified reception. Since the nonprogress problem is undecidable, a dataflow approach is used to obtain sufficient conditions under which the two processes are f... 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.
  • 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.
  • 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.
  • 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.
  • Message ordering in a multicast environment

    Publication Year: 1989, Page(s):354 - 361
    Cited by:  Papers (27)  |  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.
  • 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.
  • 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.
  • Generating a fault tolerant global clock in a high speed distributed system

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

    A technique is described for constructing a fault-tolerant global clock in a point-to-point distributed system with an arbitrary topology, which constitutes a wide-area network. It is assumed that the network is constructed of optical links with very high transmission rates. The approach used is to generate a global clock from the ensemble of the local transmission clocks, and not to synchronize t... 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 (21)  |  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.
  • A flexible algorithm for replicated directory management

    Publication Year: 1989, Page(s):456 - 464
    Cited by:  Papers (2)  |  Patents (35)
    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.
  • 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.
  • 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.
  • A high performance virtual token-passing multiple-access method for multiple-bus local networks

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

    A new integrated demand-assignment multiple-access (DAMA) method for multiple-bus local networks (MBLNs) is proposed and evaluated. The performance of this method is shown to be superior to independent token-passing as well as to previously proposed integrated access schemes. V-STIA, a virtual token-passing extension of a modified explicit token-passing scheme called single-token integrated access... 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 (11)  |  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.
  • 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.
  • Distributed diagnosis of Byzantine processors and links

    Publication Year: 1989, Page(s):562 - 569
    Cited by:  Papers (5)
    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.
  • A protocol for timed atomic commitment

    Publication Year: 1989, Page(s):199 - 206
    Cited by:  Papers (6)
    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.
  • 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 shared dataspace model of concurrency-language and programming implications

    Publication Year: 1989, Page(s):270 - 279
    Cited by:  Papers (6)
    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.
  • Static allocation of periodic tasks with precedence constraints in distributed real-time systems

    Publication Year: 1989, Page(s):190 - 198
    Cited by:  Papers (36)  |  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.
  • Transparent distributed object management under completely decentralized control

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

    An experimental distributed system based on an integrated system design was built that incorporates user-level or environmental application requirements into the design issues of the distributed operating system Dragon Slayer. The key for making use of the Dragon Slayer services, in supporting applications requesting a high amount of reliability under completely decentralized control, is the defin... View full abstract»

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