By Topic

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date 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
    Save to Project icon | Request Permissions | 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
    Save to Project icon | Request Permissions | PDF file iconPDF (80 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 1995
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB)  
    Freely Available from IEEE
  • Comparing kernel-space and user-space communication protocols on Amoeba

    Publication Year: 1995 , Page(s): 238 - 245
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (896 KB)  

    Most distributed systems contain protocols for reliable communication, which are implemented either in the microkernel or in user space. In the latter case, the microkernel provides only low-level, unreliable primitives and the higher-level protocols are implemented as a library in user space. This approach is more flexible but potentially less efficient. We study the impact on performance of this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed deadlock detection algorithm

    Publication Year: 1995 , Page(s): 169 - 178
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1056 KB)  

    We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only detect the cycles in which the initiator is directly involved. Our algorithm is a reduced version of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant external clock synchronization

    Publication Year: 1995 , Page(s): 70 - 77
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (676 KB)  

    We address the problem of how to integrate fault-tolerant internal and external clock synchronization. We propose a new algorithm which provides both external and internal clock synchronization for as long as no more than F reference time servers out of a total of 2F+1 are faulty. When the number of faulty reference time servers exceeds F, the algorithm degrades to a fault-tolerant internal clock ... 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 (7)
    Save to Project icon | Request Permissions | 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.
  • 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 (2)
    Save to Project icon | Request Permissions | 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.
  • A fast distributed modular algorithm for resource allocation

    Publication Year: 1995 , Page(s): 161 - 168
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | 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 pipeline scheduling: end-to-end analysis of heterogeneous, multi-resource real-time systems

    Publication Year: 1995 , Page(s): 204 - 211
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (668 KB)  

    This paper presents an hierarchical end-to-end analysis technique that decomposes the very complex heterogeneous multi-resource scheduling problem into a set of single resource scheduling problems with well defined interactions. We define heterogeneity both in resource types, e.g., CPU, and in scheduling policies, e.g., rate-monotonic scheduling. This analysis technique is one phase of our systems... 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)
    Save to Project icon | Request Permissions | 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.
  • Adaptive placement of method executions within a customizable distributed object-based runtime system: design, implementation and performance

    Publication Year: 1995 , Page(s): 279 - 286
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (832 KB)  

    This paper presents the design and implementation of a mechanism aimed at enhancing the performance of distributed object-based applications. This goal as achieved by means of a new algorithm implementing placement of method executions that adapts to processors' load and to objects' characteristics, the latter allowing to approximate the cost of methods' remote execution. The behavior of the propo... 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)
    Save to Project icon | Request Permissions | 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.
  • Guaranteeing end-to-end deadlines in ATM networks

    Publication Year: 1995 , Page(s): 60 - 68
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (876 KB)  

    We address the issue of guaranteeing the end-to-end deadlines of hard real-time connections in an ATM network. In an ATM network, a set of hard real-time connections can be admitted only if the end-to-end delays of cells belonging to individual connections are not more than their deadlines. We systematically decompose an ATM network into constant delay and variable delay servers to facilitate the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Server recovery using naturally replicated state: a case study

    Publication Year: 1995 , Page(s): 213 - 220
    Cited by:  Papers (1)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (712 KB)  

    This paper describes design and preliminary measurements of a file server recovery scheme that uses naturally replicated state among clients. This scheme, implemented in the Calypso file system, is truly transparent to the user and avoids the overhead of explicit replication. A three-phase protocol reconstructs the server state either on a backup node (if disks are multi-ported) or on the rebooted... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining consistency of data in mobile distributed environments

    Publication Year: 1995 , Page(s): 404 - 413
    Cited by:  Papers (39)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1088 KB)  

    To deal with the frequent, foreseeable and variable disconnections that occur in a mobile environment, we introduce a flexible, two-level consistency model. Semantically related or closely located data are grouped together to form a cluster. While all data inside a cluster are mutually consistent, degrees of inconsistency are allowed among data at different clusters. To take advantage of the predi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for global optimization of message passing communication on unreliable networks

    Publication Year: 1995 , Page(s): 246 - 253
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (660 KB)  

    In this paper, we present techniques to improve the performance of parallel and distributed applications running on distributed systems built with unreliable local-area networks. The optimizations tailor the message passing system used by the application to the communication pattern exhibited by the application. The optimizations are global and application dependent since communication patterns va... 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)
    Save to Project icon | Request Permissions | 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.
  • Software tool evaluation methodology

    Publication Year: 1995 , Page(s): 3 - 10
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (756 KB)  

    The recent development of parallel and distributed computing software has introduced a variety of software tools that support several programming paradigms and languages. This variety of tools makes the selection of the best tool to run a given class of applications on a parallel or distributed system a non-trivial task that requires some investigation. We expect tool evaluation to receive more at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed implementation of multi-rendezvous in LOTOS using the orthogonal communication structure in Linda

    Publication Year: 1995 , Page(s): 518 - 525
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (676 KB)  

    We argue that the programming simplicity and message passing complexity of implementing LOTOS multi-rendezvous largely depends on the underlying communication structure. The programming simplicity and low complexity of our algorithm are due to our viewing the multi-rendezvous problem as a distributed mutual exclusion problem. Using the parallel programming environment of Linda, we present an effic... 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
    Save to Project icon | Request Permissions | 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.
  • Mapping concurrently-communicating modules onto mesh multicomputers equipped with virtual channels

    Publication Year: 1995 , Page(s): 493 - 500
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (592 KB)  

    It is difficult to define and evaluate a meaningful performance metric when many packets are generated and exchanged concurrently in mesh-connected multicomputers equipped with wormhole switching and virtual channels. Thus, an approximate metric/cost function must be chosen so that when, task modules are mapped by optimizing this function, the actual performance of the mapping is also optimized. S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating visualization support into distributed computing systems

    Publication Year: 1995 , Page(s): 19 - 26
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (800 KB)  

    Visualization and animation tools may become extremely important aids in the understanding, verification, and performance tuning of parallel computations. Presently, however, the use of visualization has had only a limited use for enhancing parallel computation. We hypothesize that one of the primary reasons for the limited use of visualization tools in parallel program development is the difficul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed table-driven route selection scheme for establishing real-time video channels

    Publication Year: 1995 , Page(s): 52 - 59
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (748 KB)  

    To guarantee the delivery of real-time messages before their deadline, a real-time connection or channel must be established before the transmission of any real-time messages. During this channel-establishment phase, one must first select a route between the source and destination of this channel and then reserve sufficient resources along this route so that the worst-case end-to-end delay over th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new protocol for bandwidth regulation of real-time traffic classes in internetworks

    Publication Year: 1995 , Page(s): 44 - 51
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (844 KB)  

    A novel bandwidth regulation mechanism is proposed which improves the ability of a packet-switching network to cope with multiple real-time and non-real-time traffic classes. The mechanism achieves regulation of link bandwidth at two levels. At the first level, bandwidth is dynamically regulated between different traffic classes. The concept of `inter-class regulation' is introduced which enforces... View full abstract»

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