14th International Conference on Distributed Computing Systems

21-24 June 1994

Filter Results

Displaying Results 1 - 25 of 75
  • 14th International Conference on Distributed Computing Systems

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Using message semantics to reduce rollback in optimistic message logging recovery schemes

    Publication Year: 1994, Page(s):227 - 234
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Recovery from failures can be achieved through asynchronous checkpointing and optimistic message logging. These schemes have low overheads during failure-free operations. Central to these protocols is the determination of a maximal consistent global state, which is recoverable. Message semantics is not exploited in most existing recovery protocols to determine the recoverable state. We propose to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative systems configuration in CSDL

    Publication Year: 1994, Page(s):304 - 311
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    The aim of a cooperative system is to coordinate and support group activities. CSDL (Cooperative Systems Design Language) is an experimental language designed to support the development of cooperative systems from specification to implementation. In CSDL a system is defined as a collection of reusable entities implementing floor control disciplines and shared workspaces. A cooperative system may b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance evaluation of a distributed eigenvalue solver on a workstation cluster

    Publication Year: 1994, Page(s):608 - 615
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Clusters of high-performance workstations are emerging as promising platforms for parallel scientific computing. The paper describes an eigenvalue solver for symmetric tridiagonal matrices, as implemented on a cluster of workstations using two different interprocess communication packages, PVM and P4. The algorithm is based on the split-merge technique, which uses Laguerre's iteration and exploits... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic snooping in a fault-tolerant distributed shared memory

    Publication Year: 1994, Page(s):218 - 226
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Distributed shared memory (DSM) allows multicomputer systems with no physically shared memory to be programmed using a shared memory paradigm. However, as the number of nodes in a system increases the probability of a failure that can corrupt the DSM increases. This paper presents a fault-tolerant DSM (FTDSM) algorithm that can tolerate single node failures. Each page in the DSM is assigned a snoo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replica placement in a dynamic network

    Publication Year: 1994, Page(s):528 - 535
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    We study the problem of placement of replicas of a database (or a shared resource) in a dynamic network. We develop a set of protocols that maintain a path from each site to its nearest replica such that the cost of accessing the nearest replica is below a certain threshold. The protocols determine the number of replicas needed and the sites where these replicas must be placed. This is useful in r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group communication in distributed multimedia systems

    Publication Year: 1994, Page(s):294 - 301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    This paper presents AlphaDeltaPhi (ADP) group communication as a method of defining and conducting multi-process end-to-end connection level management in distributed multimedia systems. α represents the reliability, Δ the end-to-end delay and Φ is the synchronization interval for a group connection. In contrast to other group communication paradigms, an ADP-group is a related set ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint satisfaction as a basis for designing nonmasking fault-tolerance

    Publication Year: 1994, Page(s):424 - 431
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    We present a method for the design of nonmasking fault-tolerant programs. In our method, a set of constraints is associated with each program. Each of these constraints is continually satisfied under the execution of program actions, as long as faults do not occur. Whenever some of the constraints are violated, due to certain faults, all constraints are eventually reestablished by subsequent execu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming systems for LAN distributed computing

    Publication Year: 1994, Page(s):600 - 607
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The goal of the paper is to describe run time efficiency of distributed computing environments. Six tools: PVM, P4, ANSA, SR, Strand, and Linda were chosen and investigated because they represent different approaches to distributed programming systems construction. The experimental results of communication tests and processor farm model efficiency are presented and discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transaction support for an ANSA-based platform

    Publication Year: 1994, Page(s):209 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    This article considers the problems of ensuring reliability in distributed cooperative systems through the transaction methodology. From the analysis of several transaction models, it is argued that the diversity of requirements in the distributed environment demands a novel approach. The transaction model proposed aims at providing the required flexibility. In this model, applications have more c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The automatic positioning of objects in COOL V2

    Publication Year: 1994, Page(s):518 - 525
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    We discuss an automatic positioning mechanism for objects in a distributed system for loosely coupled applications. The goal is to achieve an equilibrium positioning that reduces global communications cost, where global means over a significant period. We consider a dynamic model based on the observation of effective interaction between customers and servers, taking into account their configuratio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using simple diffusion to synchronize the clocks in a distributed system

    Publication Year: 1994, Page(s):484 - 491
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Simple diffusion consists in propagating some data or computation to every unit in a network by spreading it from one unit to its neighbors, which in their turn spread it to the neighbors until every unit is reached. Simple diffusion is easy to implement, scalable, robust with respect to omission faults, and privileges local communication (i.e., uses only links whose cost is the lowest in terms of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPIDER: flexible and efficient communication support for point-to-point distributed systems

    Publication Year: 1994, Page(s):574 - 580
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    SPIDER is a network adapter that provides scalable communication support for point-to-point distributed systems. The device exports an efficient interface to the host processor, provides transparent support for dependable, time-constrained communication, and handles packet routing and switching. The communication support provided by SPIDER exploits concurrency between the independent data channels... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(NM(M+1/)) distributed algorithm for the k-out of-M resources allocation problem

    Publication Year: 1994, Page(s):81 - 88
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    This paper presents a permission-based algorithm to solve the problem of M identical resources shared among N processes in a distributed system. We prove that the number of messages exchanged necessary for a process to acquire k resources is O(NM(M+1)/). This result has been obtained (i) investigating the concept of arbiter of conflicting processes and (ii) extending conditions that per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable architecture for reliable distributed multimedia applications

    Publication Year: 1994, Page(s):284 - 293
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    We propose a communication software architecture designed to support distributed multimedia applications. We show that this architecture is scalable, and can provide high availability of the communication services View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using perturbation tracking to compensate for intrusion in message-passing systems

    Publication Year: 1994, Page(s):414 - 421
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Execution monitoring plays a central role in most software development tools for parallel and distributed computer systems. However, such monitoring may induce delays that corrupt event timing. If this corruption can be quantified, it may be possible to determine the intrusion-free behavior. In this paper, we describe an algorithm that, given a safe timed Petri net model of the monitored software,... View full abstract»

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

    Publication Year: 1994, Page(s):320 - 325
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A unified computational model called GroupSPACE is presented for groupware applications of repetitive collaborative tasks in computer supported cooperative work (CSCW). GroupSPACE is a generalisation of the concept of workspace. It is inherently a distributed multimedia environment that provides specialised elementary composition and synchronisation operations on multimedia objects placed into thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Units of computation in fault-tolerant distributed systems

    Publication Year: 1994, Page(s):626 - 633
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We develop a framework that helps in developing understanding of a fault-tolerant distributed system and so helps in designing such systems. We define a unit of computation in such systems, referred to as a molecule, that has a well defined interface with other molecules, i.e. has minimal dependence on other molecules. The smallest such unit-an indivisible molecule-is termed as an atom. We show th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient fully adaptive wormhole routing in n-dimensional meshes

    Publication Year: 1994, Page(s):589 - 596
    Cited by:  Papers (30)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed. The routing algorithm provides full adaptivity at a cost of one additional virtual channel per physical channel irrespective of the number of dimensions of the network. The algorithm is based on dividing the network graph into two acyclic graphs that contain all of the physical channels in the system. Vir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing data alignment for data parallel programs

    Publication Year: 1994, Page(s):336 - 344
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Data decomposition across processors is critical to the performance of data parallel programs on distributed-memory machines. The data decomposition problem involves data alignment and data distribution. This paper addresses the data alignment phase, which can be classified into slope alignment and offset alignment. We propose a data reference graph (DRG) model, based on which a slope alignment he... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient global event predicate detection

    Publication Year: 1994, Page(s):642 - 649
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Detection of global event predicates is an important issue for distributed systems, particularly for debugging and monitoring of such systems. The paper defines event normal form (ENF) event predicates, and two online algorithms to detect the first occurrence of such predicates. These algorithms differ in the technique used to match concurrent groups of events. The first builds and searches a tree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causal broadcasting and consistency of distributed shared data

    Publication Year: 1994, Page(s):40 - 47
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    The paper develops a generalized model to capture the interactions between the ordering of messages exchanged across various entities of a distributed application and the consistency requirements on a shared data across these entities. The model is based on causal broadcasting of data access messages that allows messages to be ordered at all entities as per the constraints specified by the applica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Content routing in a network of WAIS servers

    Publication Year: 1994, Page(s):124 - 132
    Cited by:  Papers (2)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Locating and accessing information in a large distributed system is a difficult problem of growing importance. This paper reports on our experience building and using a prototype system for transparent, user-guided associative access to the contents of a large, distributed set of WAIS servers. Our system is based on content routing, an architecture that makes use of content labels for locating and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smart remote procedure calls: transparent treatment of remote pointers

    Publication Year: 1994, Page(s):142 - 151
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    Remote procedure call (RPC) systems have been proven to be a practical basis for building distributed applications. The RPC technique abstracts a typical communication pattern to an ordinary procedure call. Compared with an ordinary procedure call, however, the conventional RPC technique has one evident restriction; pointers (addresses) cannot be passed to remote procedures without the explicit an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming for mobile robot control: agent-based approach

    Publication Year: 1994, Page(s):202 - 208
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Some issues concerning agent-based systems and parallel programming are discussed. A practical problem of designing a mobile robot for educational purposes using an IBM Series/1 EDX is considered, and as a solution, a multiagent control system is designed and implemented using the EDX multitasking system. A discussion concerning the notion of agents and an agent society is also provided View full abstract»

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