By Topic

Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on

Date 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 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 (720 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.
  • Supporting a flexible parallel programming model on a network of workstations

    Publication Year: 1996, Page(s):75 - 82
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 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.
  • 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.
  • Query execution strategies for missing data in distributed heterogeneous object databases

    Publication Year: 1996, Page(s):466 - 473
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The problem of missing data arises in the distributed heterogeneous object databases because of the missing attribute conflict and the existence of null values. A set of algorithms are provided in this paper for query processing when the predicates in global queries involve missing data. For providing more informative answers to the users, the maybe results due to missing data are presented in add... 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 (1080 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.
  • 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.
  • Differential evaluation of continual queries

    Publication Year: 1996, Page(s):458 - 465
    Cited by:  Papers (3)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    We define continual queries as a useful tool for monitoring of updated information. Continual queries are standing queries that monitor the source data and notify the users whenever new data matches the query. In addition to periodic refresh, continual queries include Epsilon Transaction concepts to allow users to specify query refresh based on the magnitude of updates. To support efficient proces... 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 (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 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.
  • 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 (680 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.
  • 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.
  • An extended network scheduling model

    Publication Year: 1996, Page(s):753 - 759
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    In real-time communication, the rate monotonic scheduling has received much attention as a basis for scheduling messages in a local area network. Schedulability analysis in such a network has been addressed by some researchers. However, the existing analysis only take independent messages into account. In this paper we extend the analysis to accommodate a specific type of inter-dependent messages:... 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 (752 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.
  • 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.
  • Scaling heterogeneous databases and the design of Disco

    Publication Year: 1996, Page(s):449 - 457
    Cited by:  Papers (34)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Access to large numbers of data sources introduces new problems for users of heterogeneous distributed databases. End users and application programmers must deal with unavailable data sources. Database administrators must deal with incorporating new sources into the model. Database implementers must deal with the translation of queries between query languages and schemas. The Distributed Informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aster: a framework for sound customization of distributed runtime systems

    Publication Year: 1996, Page(s):586 - 593
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    This paper introduces the Aster distributed configuration-based-programming system that is aimed at easing the development of emerging distributed applications having quality of service requirements. Our approach is based on high-level customization: given the specification of application requirements using the Aster interconnection language, a distributed runtime system, customized for meeting th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured design of communication protocols

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

    We propose a compositional technique to design multifunction protocols. The technique involves first designing the protocols performing the various functions separately and then combining them using a set of constraints. The constraints are used to specify the interactions between the component protocols. The interactions, for example, specify when a function has to be performed and whether two fu... 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 (744 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.
  • Dynamic resource migration for multiparty real-time communication

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

    With long-lived multi-party connections, resource allocation subsystems in distributed real-time systems or communication networks must be aware of dynamically changing network load in order to reduce call-blocking probabilities. We describe a distributed mechanism to dynamically reallocate (“migrate”) resources without adversely affecting the performance that established connections r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conservative garbage collection on distributed shared memory systems

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

    In this paper we present the design and implementation of a conservative garbage collection algorithm for distributed shared memory (DSM) applications that use weakly-typed languages like C or C++, and evaluate its performance. In the absence of language support to identify references, our algorithm constructed a conservative approximation of the set of cross-node references based on local informa... 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 (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 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.
  • On programming with view synchrony

    Publication Year: 1996, Page(s):3 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 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.
  • 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 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.