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.

Proceedings of 16th International Conference on Distributed Computing Systems

27-30 May 1996

Filter Results

Displaying Results 1 - 25 of 89
  • Proceedings of 16th International Conference on Distributed Computing Systems

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • A snapshot algorithm for distributed mobile systems

    Publication Year: 1996, Page(s):734 - 743
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    This paper considers distributed algorithms for distributed mobile systems. Many distributed algorithms have been designed for distributed systems consisting of static computers only. But most of them cannot be directly applied to mobile systems. This paper proposes a model of mobile systems. Management of movements of mobile hosts is abstracted in our model to simplify design of algorithms for mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach for constructing mobile applications using service proxies

    Publication Year: 1996, Page(s):726 - 733
    Cited by:  Papers (20)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    In this paper, we propose software architecture using a notion of service proxies, that is a new framework for constructing applications in mobile computing environment. Our framework especially takes into account applications accessing services on Internet such as WWW browsers and MBONE conference tools. In our framework, an application is partitioned into two pieces, one piece runs on a mobile c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new token passing distributed mutual exclusion algorithm

    Publication Year: 1996, Page(s):717 - 724
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel simulation of mesh routing algorithms

    Publication Year: 1996, Page(s):158 - 165
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Performance of a network depends primarily on the network topology, switching mechanism, flow control protocol and the underlying routing algorithm. While many routing algorithms have been proposed recently for direct networks, there is no time efficient technique to evaluate and compare all of them. A conventional routing algorithm simulation of a network on a uniprocessor takes unacceptably larg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant clock synchronization of large multicomputers via multistep interactive convergence

    Publication Year: 1996, Page(s):249 - 258
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    We present a fault-tolerant algorithm that internally synchronizes clocks in multicomputer systems employing not completely connected networks (NCCNs). The algorithm is referred to as multistep interactive convergence, and is locally implemented in each node by a time sewer process (TSP). The algorithm proceeds in rounds, and bases its operation on a logical mapping of the system's TSPs into an m-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Totally ordered multicast in large-scale systems

    Publication Year: 1996, Page(s):503 - 510
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Totally ordered multicast protocols have proved to be extremely useful in supporting fault-tolerant distributed applications. This paper compares the performance of the two main classes of protocols providing total order in large-scale systems (token-site and symmetric protocols) and proposes a new dynamic hybrid protocol that, when applied to systems where the topology/traffic patterns are not kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation-based evaluation of a disk I/O subsystem for a massively parallel computer: JUMP-1

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

    JUMP-1 is a distributed shared-memory massively parallel computer and is composed of multiple clusters of inter-connected network called RDT (Recursive Diagonal Torus). Each cluster in JUMP-1 consists of 4 element processors, secondary cache memories, and 2 MBP (Memory Based Processor) for high-speed synchronization and communication among clusters. The I/O subsystem is connected to a cluster via ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lock-based self-stabilizing distributed mutual exclusion algorithms

    Publication Year: 1996, Page(s):708 - 716
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    In 1974, Dijkstra introduced the notion of self-stabilization and presented a token circulation distributed mutual exclusion (DMX) protocol as the first self-stabilizing (SS) algorithm. Since then, many variations of SS DMX algorithms have been presented. Most, if not all, of these algorithms impose stronger assumptions on their execution environments than those provided by common distributed syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization protocols in distributed real-time systems

    Publication Year: 1996, Page(s):38 - 45
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    In many distributed real-time systems, the workload can be modeled as a set of periodic tasks, each of which consists of a chain of subtasks executing on different processors. Synchronization protocols are used to govern the release of subtasks so that the precedence constraints among subtasks are satisfied and the schedulability of the resultant system is analyzable. Tasks have different worst-ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined routing and scheduling of concurrent communication traffic in hypercube multicomputers

    Publication Year: 1996, Page(s):150 - 157
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    We propose and evaluate low-complexity, low-overhead schemes for distributed message scheduling and routing in binary hypercube multicomputers equipped with a hardware communication adapter at each node. The goal is to optimize the network performance not only for steady traffic flow, but also for concurrent bursty traffic. We comparatively evaluate the performance of different scheduling-coding c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-dimensional locks with on-line allocation schemes

    Publication Year: 1996, Page(s):241 - 248
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Synchronization is inherent to parallel computing and comprises many aspects. One aspect is the access control to shared data, especially important in MIMD shared-memory architectures. Several locking mechanisms have been proposed to perform this task. Most of these schemes rely on very little hardware support, such as atomic read-modify-write operations. Today, the amount of hardware required to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of a distributed single address space operating system

    Publication Year: 1996, Page(s):494 - 501
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    In this paper we present an evaluation of Angel, a single address space operating system, originally designed in 1992, which has been developed over the past few years. The purpose of this work was to examine how we could simplify the kernel and service structure using the single address space as the enabling technology. We believe that in so doing, we could achieve far better performance and simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparison of process migration with remote process creation mechanisms in RHODOS

    Publication Year: 1996, Page(s):554 - 561
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    We claim that both remote process creation and process migration are efficient mechanisms to be used in the improvement or development of high performance computer systems. In particular we demonstrate that the claims made by some researchers that process migration is too heavy to be used to support dynamic load balancing are unsubstantiated. We support our claim by presenting these two mechanisms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language support for long-lived concurrent activities

    Publication Year: 1996, Page(s):698 - 705
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Providing a general purpose programming environment that supports the definition of, and exercises control over, the flow of execution of long-running activities is highly beneficial for a variety of client/server distributed data-intensive applications. In this paper, we present a Transaction-Oriented Work-Flow Environment (TOWE) for the programming of long-lived activities through a set of class... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group routing without group routing tables

    Publication Year: 1996, Page(s):344 - 351
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of processes is constructed in the network, ensuring each group member is included in the tree. To build this tree, the group routing protocol relies upon the unicast routing tables of each process. Thus, group routing is a compos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atomic recovery units: failure atomicity for logical disks

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

    Atomic recovery units (ARUs) are a mechanism that allows several logical disk operations to be executed as a single atomic unit with respect to failures. For example, ARUs can be used during file creation to update several pieces of file meta-data atomically. ARUs simplify systems, as they isolate issues of atomicity within the logical disk system, ARUs are designed as part of the Logical Disk (LD... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating routing and resource reservation mechanisms in real-time multicast protocols

    Publication Year: 1996, Page(s):141 - 148
    Cited by:  Papers (1)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Multimedia applications must incorporate real-time task processing over networks. In most cases, there are many receivers for each data stream. Thus, a multicast resource reservation protocol for ensuring timing constraints over the network is required. In this paper, a real-time multicast protocol, called RtMP (Real-time Multicast Protocol) is presented. RtMP provides flexible connection establis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware supports for efficient barrier synchronization on 2-D mesh networks

    Publication Year: 1996, Page(s):233 - 240
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    In this paper, we consider a hardware scheme for supporting barrier synchronization on scalable systems with a 2D mesh network. Our design takes into account of the program execution path in such systems-from programming interfaces down to routers. The hardware router design will be based on the MPI-1 standard. A distributed algorithm is proposed to construct a collective synchronization tree (CS ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A wait-free algorithm for optimistic programming: HOPE realized

    Publication Year: 1996, Page(s):484 - 493
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    Optimism is a powerful technique for avoiding latency by increasing concurrency. Optimistically assuming the results of one computation allows other computations to execute in parallel, even when they depend on the assumed result. Optimistic techniques can particularly benefit distributed systems because of the critical impact of communications latency. This paper reviews HOPE: our model of optimi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semi-automated verification method for communication protocols modeled as 2-ECFSMs

    Publication Year: 1996, Page(s):290 - 297
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Previously, we proposed a verification method via invariants for communication protocol modeled as 2-ECPSMs. In the proposed method, a human verifier describes an invariant of a given protocol in a disjunctive normal form, and a verification system shows safety or liveness based on the invariant. The tedious work on describing invariant formulae is the most significant shortcoming of the proposed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exception handling and resolution in distributed object-oriented systems

    Publication Year: 1996, Page(s):545 - 552
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    We address the problem of how to handle exceptions in distributed object-oriented systems. In a distributed computing environment exceptions may be raised simultaneously and thus need to be treated in a coordinated manner. We take two kinds of concurrency into account: 1) several objects are designed collectively and invoked concurrently to achieve a global goal, and 2) concurrent objects or objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing the cost for non-blocking in atomic commitment

    Publication Year: 1996, Page(s):692 - 697
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The cost for non-blocking implies however (1) a high number of messages and communication steps required to reach commit, and (2) a complicated termination protocol needed in the case of failure suspicions. In this paper, we present a non-blocking ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specializing object-oriented RPC for functionality and performance

    Publication Year: 1996, Page(s):175 - 187
    Cited by:  Papers (4)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    Remote procedure call (RPC) integrates distributed processing with conventional programming languages. However traditional RPC lacks support for forms of communication such as datagrams, multicast, and streams that fall outside the strict request-response model. Emerging applications such as Distributed Interactive Simulation (DIS) and Internet video require scalable, reliable, and efficient commu... View full abstract»

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