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
  • On programming with view synchrony

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

    View synchrony has been proposed as a programming paradigm for developing reliable distributed applications. The paradigm is particularly attractive when the underlying computing system is asynchronous and prone to complex failure scenarios including partitions. View synchrony encourages a programming style where groups of processes cooperate closely in order to maintain some form of shared state ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sentries for the execution of concurrent programs

    Publication Year: 1996, Page(s):11 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    The sentry of a concurrent program P is a program that executes concurrently with P, periodically takes snapshots of P, and issues a warning if it detects that some snapshot does not satisfy a predefined predicate. The sentry is unique among snapshot-taking systems in its low-overhead. First, the shared storage between the observed program P and the sentry is linear in the number of P variables th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant file transmission by information dispersal algorithm in rotator graphs

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

    A directed graph G=(V, E) is called the n-rotator graph if V={a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/|a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/ is a permutation of 1, 2, /spl middot//spl middot//spl middot/, n} and E={(a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/, b/sub 1/b/sub 2//spl middot//spl middot//spl middot/b/sub n/) I for some 2/spl ... 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 (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1218 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.
  • Synchronization protocols in distributed real-time systems

    Publication Year: 1996, Page(s):38 - 45
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (953 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.
  • Monotone response-time derivation for distributed execution of rule-based programs

    Publication Year: 1996, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (878 KB)

    A key index of the performance of a rule-based program used in real-time monitoring and control is its response time. We first extend the definition of response time of an EQL rule-based program for distributed computation. To reduce the response time through distributed computation, we decompose an EQL program into disjoint modules. We then describe a tool which computes the response-times of fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time scheduling using compact task graphs

    Publication Year: 1996, Page(s):55 - 62
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    The generation of a real-time schedule from a task precedence graph is complex and time consuming. In order to improve the efficiency of generating schedules, we propose a scheduling algorithm based upon the compact task graph (CTG) representation. In addition to precedence constraints, a CTG explicitly expresses the potential for interleaving the execution of tasks on a single processor and overl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance value of shared network caches in clustered multiprocessor workstations

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

    This paper evaluates the benefit of adding a shared cache to the network interface as a means of improving the performance of networked workstations configured as a distributed shared memory multiprocessor. A cache on the network interface offers the potential benefits of retaining evicted processor cache lines, providing implicit prefetching, and increasing intra-cluster sharing. Using simulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting a flexible parallel programming model on a network of workstations

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

    We introduce a shared memory software prototype system for executing programs with nested parallelism on a network of workstations. This programming model exhibits a very convenient and natural programming style and provides functionality similar to a subset of Compositional C++. Such programming model is especially suitable for computations whose complexity and parallelism emerges only during the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for customizing coherence protocols of distributed file caches

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

    In cooperative applications such as group CAD and group software development systems, multiple processes communicate with each other by sharing complex data structures consisting of nested structures and pointers. Although the sharing of complex data structures in the distributed environment is achieved through the technology of distributed shared memory, a single cache coherence protocol cannot e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relative importance of concurrent writers and weak consistency models

    Publication Year: 1996, Page(s):91 - 98
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB)

    This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based on single- and multiple-writer versions of a lazy release consistent (LRC) protocol, and a single-writer sequentially consistent protocol, all implemented in the CVM software distributed shared memory system. We find that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-overhead recovery technique using quasi-synchronous checkpointing

    Publication Year: 1996, Page(s):100 - 107
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (941 KB)

    In this paper, we propose a quasi-synchronous checkpointing algorithm and a low-overhead recovery algorithm based on it. The checkpointing algorithm preserves process autonomy by allowing them to take checkpoints asynchronously and uses communication-induced checkpoint coordination for the progression of the recovery line which helps bound rollback propagation during a recovery. Thus, it has the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to recover efficiently and asynchronously when optimism fails

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

    We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts-a fault-tolerant vector clock to maintain causality information in spite of failures, and a history mechanism to detect orphan states and obsolete messages. These two mechanisms together with checkpointing and message-logging are used to restore the syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of recoverable distributed shared memory by logging writes

    Publication Year: 1996, Page(s):116 - 123
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (831 KB)

    Distributed shared memory, by avoiding the programming complexities of message passing, has become a convenient model to work with. But the benefits given by these systems can possibly be achieved only if the whole system behaves like a failure-free system. Many algorithms that have been proposed for implementing a reliable DSM require the processes to take check points whenever there is a data tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meeting delay requirements in computer networks with wormhole routing

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

    We study high performance networks with wormhole routing and investigate their performance in terms of meeting message delay constraints. Traditional system uses unregulated greedy transmission control. This may result in unfairness of network access and unbounded packet blocking time, making it very difficult to efficiently support real-time applications. To overcome this problem, we propose a re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiplexing statistical real-time channels in a multi-access network

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

    Given the client's traffic-generation characteristics and performance requirements, we propose a real-time communication scheme that provides delivery delay guarantees in a multiaccess local-area network (LAN). This scheme (i) reduces the link capacity that needs to be reserved to an average level as compared to the worst-case level required for deterministic performance guarantees, and (ii) prese... 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:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1002 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.
  • 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 (764 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.
  • 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 (872 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.
  • Reliable communication in cube-based multicomputers using safety vectors

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

    Reliable communication in cube-based multicomputers (including disconnected ones) using the safety vector concept is studied in this paper. In the proposed approach each node in a cube-based multicomputer of dimension n is associated with a safety vector of n binary numbers which is an approximated measure of the number and distribution of faults in the neighborhood. The safety vector of each node... 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 (5)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1273 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.
  • Communication compilation for unreliable networks

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

    Parallel programs running on top of generic protocols (e.g. TCP) in a cluster of workstations often do not perform or scale as well as one would expect. One reason for this is that both the performance and scalability of parallel applications are highly dependent on the speed of communication, yet the generic protocols used to guarantee reliable message delivery add unnecessary overhead which degr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using projection aggregations to support scalability in distributed simulation

    Publication Year: 1996, Page(s):196 - 206
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1271 KB)

    Distributed interactive simulation systems are growing to include well over 100,000 dynamic entities for applications such as multiplayer video games, military and industrial training, and collaborative engineering. In these applications, each host receives updates (such as position and orientation) from remote entities, models and renders the scene, and performs other tasks such as collision dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic scheduling strategies for shared-memory multiprocessors

    Publication Year: 1996, Page(s):208 - 215
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (877 KB)

    Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, a static scheduling strategy can produce an assignment of tasks to processors that ideally balances the load among the processors while minimizing the run-time scheduling overhead and the average memory referencing delay.... View full abstract»

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