By Topic

Proceedings of 15th International Conference on Distributed Computing Systems

May 30 1995-June 2 1995

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings of 15th International Conference on Distributed Computing Systems

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (378 KB)
    Freely Available from IEEE
  • Future distributed embedded and real-time applications will be adaptive - meanings, challenges and research paradigms [panel session]

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

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • Characterizing and detecting the set of global states seen by all observers of a distributed computation

    Publication Year: 1995, Page(s):431 - 438
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A consistent observation of a given distributed computation is a sequence of global states that could be produced by executing that computation on a monoprocessor system. Therefore a distributed execution generally accepts several consistent observations. This paper concentrates on what all these observations have in common. An abstraction called common global state is defined. A necessary and suf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test sequence generation from formal specifications of distributed programs

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

    An abstract program is a formal specification that describes the valid behavior of a distributed program without describing particular implementation mechanisms that achieve this behavior. Valid behavior can be modeled as the possible sequences of events that may be observed of a conforming concrete implementation of the abstract program. In this paper, we address the problem of how to select even... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast distributed modular algorithm for resource allocation

    Publication Year: 1995, Page(s):161 - 168
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to system resources shared among many concurrent processes. Three different kinds of resource allocation problems with varying degrees of generality are considered: the dining philosophers problem, the drinking philosophers problem and the dynamic resource allocation problem. We present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed management by delegation

    Publication Year: 1995, Page(s):333 - 340
    Cited by:  Papers (78)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    This paper introduces a novel approach to distributed computing based on delegation-agents, and describes its applications to decentralize network management. Delegation agents are programs that can be dispatched to remote processes, dynamically linked and executed under local or remote control. Unlike scripted agents, delegation agent programs may be written in arbitrary languages, interpreted or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPI programming environment for IBM SP1/SP2

    Publication Year: 1995, Page(s):127 - 135
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    In this paper we discuss an implementation of the message passing interface standard (MPI) for the IBM Scalable Power PARALLEL 1 and 2 (SP1, SP2). Key to a reliable and efficient implementation of a message passing library on these machines is the careful design of a UNIX-Socket like layer in the user space with controlled access to the communication adapters and with adequate recovery and flow co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed algorithms for detecting conjunctive predicates

    Publication Year: 1995, Page(s):423 - 430
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    This paper discusses efficient distributed detection of global conjunctive predicates in a distributed program. Our methods correctly detect the first consistent cut in which the predicate is true, even if the predicate is unstable. Previous work in detection of such predicates is based on a centralized checker process. In this paper we introduce algorithms which distribute the computation and spa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probing and fault injection of protocol implementations

    Publication Year: 1995, Page(s):351 - 359
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    Ensuring that a distributed system with strict dependability constraints meets its prescribed specification is a growing challenge that confronts software developers and system engineers. This paper presents a technique for probing and fault injection of fault-tolerant distributed protocols. The proposed technique, called script-driven probing and fault injection, can be used for studying the beha... View full abstract»

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

    Publication Year: 1995, Page(s):153 - 160
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The paper presents simulation results for the proposed algorithm an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient optimal reconfiguration algorithm for FBRNs

    Publication Year: 1995, Page(s):325 - 332
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    We study a new network architecture called FBRN (FDDI-based reconfigurable network). An FBRN consists of multiple FDDI token rings and has the ability to reconfigure itself in the event of network faults. Thus, an FBRN has the potential to provide high available bandwidth even in the presence of numerous faults. Realization of this potential depends crucially on the choice of reconfiguration algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance impact of scheduling discipline on adaptive load sharing in homogeneous distributed systems

    Publication Year: 1995, Page(s):484 - 492
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    Load sharing is a technique to improve the performance of distributed systems by distributing the system workload from heavily loaded nodes, where service is poor, to lightly loaded nodes in the system. Previous studies have considered two adaptive load sharing policies: sender-initiated and receiver-initiated. In the sender-initiated policy, a heavily loaded node attempts to transfer work to a li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causal separators for large-scale multicast communication

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

    In recent years there has been a growing interest in developing communication systems that are able to deliver messages respecting potential causality. Unfortunately, causal delivery cannot be provided without costs: extra delays may be induced on message delivery or processes may be required to maintain and exchange records of causal relations. In this paper we present an extension to previous wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of resource lower bounds in real-time applications

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

    Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these requirements is a challenging problem. In this paper, we alleviate this problem by proposing a technique to determine a lower bound on the number of processors and resources required to meet the constraints of the applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed lock management for mobile transactions

    Publication Year: 1995, Page(s):118 - 125
    Cited by:  Papers (19)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    We present a new lock management scheme which allows a read unlock for an item to be executed at any copy site of that item; the site may be different from the copy site on which the read lock is set. The scheme utilizes the replicated copies of data items to reduce the message costs incurred by the mobility of the transaction host. We demonstrate this idea in an optimistic locking algorithm calle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Newtop: a fault-tolerant group communication protocol

    Publication Year: 1995, Page(s):296 - 306
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1100 KB)

    A general purpose group communication protocol suite called Newtop is described. It is assumed that processes can simultaneously belong to many groups, group size could be large, and processes could be communicating over the Internet. Asynchronous communication environment is therefore assumed where message transmission times cannot be accurately estimated, and the underlying network may well get ... View full abstract»

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

    Publication Year: 1995, Page(s):414 - 421
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    We present formal specifications of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide Web. In the presence of failures, concurrency, and distribution, clients performing queries may observe behavior that is inconsistent with the stringent semantic requirements of mathematical sets. For example, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “How are we going to pay for this? Fee-for-service in distributed systems-research and policy issues”

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

    With the increasing array of information and services being supported by distributed computing, we face a new challenge: How do we handle charges? Providers of information will want to receive “royalties”, providers of computing services will want to receive payment for use of the service, and providers of the network will want to receive payment for the transmission. At some point, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single connection emulation (SCE): an architecture for providing a reliable multicast transport service

    Publication Year: 1995, Page(s):144 - 151
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    We present a novel architecture for providing a reliable multicast transport service over existing protocol stacks. These protocol stacks ordinarily support reliable unicast transport layer connections over a network layer which is capable of providing an unreliable multicasting service. We propose the addition of a new single connection emulation (SCE) sublayer between the unicast transport layer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient task allocation scheme for two-dimensional mesh-connected systems

    Publication Year: 1995, Page(s):501 - 508
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Efficient allocation of proper size submeshes to incoming tasks in two-dimensional (2D) mesh-connected processors is very important for achieving the desired high performance. It also needs to guarantee the recognition of the free submeshes with minimum overhead. In this paper we present an efficient task allocation scheme for 2D meshes. By employing a new approach for searching the array, our sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective broadcast data distribution systems

    Publication Year: 1995, Page(s):317 - 324
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    This paper describes a two tier architecture for high speed data distribution. The architecture consists of a database interface network which distributes information from a central database to a number of servers, and a user interface network which distributes information from the servers to the user terminals. The database interface network uses the selective broadcast technique to distribute da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware for fast global operations on workstation cluster multicomputers

    Publication Year: 1995, Page(s):475 - 482
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    The results presented show that the addition of a secondary network with a wide-tree topology and one or more coordination processors (COPs) to a workstation cluster multicomputer can speed up synchronization, broadcasting, reduction, and several other important global operations by two or three orders of magnitude. The wide tree topology contributes to this by allowing a large number of nodes to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient failure discovery with limited authentication

    Publication Year: 1995, Page(s):78 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Solutions for agreement problems in distributed systems can generally be divided into two classes: authenticated protocols and non-authenticated protocols. Authenticated protocols make use of authenticated messages, i.e., the messages can be signed in a way that a signed message can be assigned unambiguously to the signer. Little has been said about how to achieve this kind of authentication; in s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time causal message ordering in multimedia systems

    Publication Year: 1995, Page(s):36 - 43
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    In multimedia systems, not only do messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites, but cause and effect relations must be maintained. Causal ordering allows the cause and effect relations of messages to be maintained. This paper presents an algorithm that insures that multimedia data with real-time deadlines are delivered to the applic... View full abstract»

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