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
  • An object-based distributed computing environment based on a reflective architecture

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

    This paper presents an object-based distributed computing environment based on a reflective architecture for industrial large-scale distributed systems. This distributed computing environment uses a compiler-based reflection technique to realize industrial distributed systems with standard workstations. A multiple-world model is also presented, in which a distributed system consists of hierarchica... 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.
  • 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.
  • A thread-based interface for collective communication on ATM networks

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

    This paper presents the results of an investigation of collective communication operations for distributed computing across asynchronous transfer mode (ATM) networks. Several collective operations have been implemented and studied on a three-switch ATM network testbed at Michigan State University. The methods use virtual topologies constructed from ATM virtual channels. A particular type of virtua... 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)
    Request permission for commercial reuse | 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.
  • “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.
  • A new protocol for bandwidth regulation of real-time traffic classes in internetworks

    Publication Year: 1995, Page(s):44 - 51
    Cited by:  Patents (3)
    Request permission for commercial reuse | 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.
  • Parallel processing on networks of workstations: a fault-tolerant, high performance approach

    Publication Year: 1995, Page(s):467 - 474
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    One of the most sought after software innovation of this decade is the construction of systems using off-the-shelf-workstations that actually deliver and even surpass, the power and reliability of supercomputers. Using completely novel techniques: eager scheduling, evasive memory layouts and dispersed data management it is possible to build an execution environment for parallel programs on worksta... 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)
    Request permission for commercial reuse | 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.
  • 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 Computing in 2010"

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "Intelligent Agents in Distributed Systems"

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting transaction semantics in multidatabase systems

    Publication Year: 1995, Page(s):101 - 109
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    Serializability is the traditionally accepted notion of correctness in most database systems. However, in a multidatabase system (MDBS) environment, where a number of pre-existing and autonomous database systems are integrated, requiring serializability could adversely affect the performance of the system. To enhance performance, one of the options is to relax the serializability requirement, and ... 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 (35)
    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.
  • Write caching in distributed file systems

    Publication Year: 1995, Page(s):457 - 466
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    Disk caches are employed in distributed file systems to avoid network accesses at clients and to compensate for the speed differential between main memory and disk at file servers. Because of concerns about volatility, however, write requests have typically not benefitted from the presence of caches. Instead, they have been processed with some sort of write-through or periodic write-back approach ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing kernel-space and user-space communication protocols on Amoeba

    Publication Year: 1995, Page(s):238 - 245
    Cited by:  Papers (6)
    Request permission for commercial reuse | 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.
  • Guaranteeing end-to-end deadlines in ATM networks

    Publication Year: 1995, Page(s):60 - 68
    Cited by:  Papers (26)
    Request permission for commercial reuse | 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.
  • A distributed K-mutual exclusion algorithm

    Publication Year: 1995, Page(s):153 - 160
    Cited by:  Papers (15)
    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 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.
  • 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.
  • Specification of a secured multi-server MMS protocol

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

    We present a complete specification of a new architecture for the Manufacturing Message Specification (MMS) protocol. This architecture is based on a client/multi-server model adopted by the MMS standard. A client invokes a service request that implies the cooperation of many servers to execute the requested service and satisfies the client demand. This architecture permits the definition of distr... 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.