By Topic

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date 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
  • 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.
  • 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.
  • Implementation of process migration in Amoeba

    Publication Year: 1994, Page(s):194 - 201
    Cited by:  Papers (12)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    The design of a process migration mechanism for the Amoeba distributed operating system is described. The primary motivation for this implementation is to carry out experimental and realistic studies of load balancing algorithms for a distributed operating system. Our aim has been the implementation of a mechanism which is general, efficient and fully transparent and which is reliable in the prese... 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.
  • A real-time scheduling framework for packet-switched networks

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

    This paper develops a unified framework for reasoning about timing correctness of packet-switched networks. The unification is in the form of a set of consistent scheduling models for a variety of network architectures and protocols. The unification is important as it allows heterogeneous network types to be analyzed using a consistent methodology and facilitates scheduling over multihop networks ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring distributed algorithms for mobile hosts

    Publication Year: 1994, Page(s):21 - 28
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    Distributed algorithms have hitherto been designed for networks with static hosts. A mobile host (MH) can connect to the network from different locations at different times. This paper presents an operational system model for explicitly incorporating the effects of host mobility and proposes a general principle for structuring efficient distributed algorithms in this model. This principle is used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subtask deadline assignment for complex distributed soft real-time tasks

    Publication Year: 1994, Page(s):172 - 181
    Cited by:  Papers (16)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Compared to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overlo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing movie control, access and management-from a formal description to a working multimedia system

    Publication Year: 1994, Page(s):276 - 283
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    In this paper we describe the tool-supported specification and implementation of a multimedia communication protocol on parallel hardware. MCAM is an application layer protocol for movie control, access and management. We specify the full MCAM protocol together with ISO presentation and session layers in Estelle. Using a code generator, we derive parallel C++ code from the specification. The code ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effects of mobility on reliable transport protocols

    Publication Year: 1994, Page(s):12 - 20
    Cited by:  Papers (39)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    We explore the effects of host motion on the performance of active transport-level connections. Motion causes increased delays and packet losses while the network learns how to route data to a host's new location. Transport protocols interpret these delays and losses as signs of network congestion. They consequently throttle their transmissions, further degrading performance. We quantify this degr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validating timing constraints in multiprocessor and distributed real-time systems

    Publication Year: 1994, Page(s):162 - 171
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors is likely to achieve better performance. However, analytical and efficient validation methods to determine whether all the timing constraints are met do not exist for systems using modern dynamic scheduling strategies, and exhaustive simulation and testing are unreliable and expensive. This paper describ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Submission of transactions from mobile workstations in a cooperative multidatabase processing environment

    Publication Year: 1994, Page(s):372 - 379
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    In a multidatabase environment with mobile computers involved, the nature of computing is such that the user may not wait for the submitted global transaction to complete before disconnecting from the network. In this paper, a basic architectural framework to support transaction management in multidatabase systems is proposed and discussed. A simple message and queuing facility is suggested which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic synchronization in distributed shared memory

    Publication Year: 1994, Page(s):345 - 354
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Introduces optimistic lock synchronization using the group write consistency (GWC) model. GWC guarantees strict ordering of all shared writes in a processor group. In optimistic synchronization, if a lock-requesting processor can assume that the lock is free, execution of mutually exclusive code starts immediately. A wrong assumption results in rollback. Shared variable updates remain in the group... 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.
  • Real-time support of continuous and variable bit rate traffic on an ATM network

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

    There is growing interest in using switched network technology such as asynchronous transfer mode (ATM) to support both continuous bit rate multimedia data and variable bit rate burst traffic for distributed computing. Most previous work and studies have focused only on the real-time support imposed by the isochronous requirements of the video or audio sources. This paper reports the results of ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable and robust internetwork routing for mobile hosts

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

    This paper describes a new protocol for transparently routing packets to mobile hosts operating in a large internetwork. The protocol, called the Mobile Host Routing Protocol (MHRP), allows any host to become mobile at any time, yet there is no penalty for a host being “mobile capable”, since the protocol automatically uses only the standard internetwork routing mechanisms and adds no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical-path-based message logging for incremental replay of message-passing programs

    Publication Year: 1994, Page(s):404 - 413
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Debugging long-running, nondeterministic message-passing parallel programs requires incremental replay, the ability to exactly replay selected parts of an execution. To support incremental replay, we must log enough messages and checkpoint processes often enough to allow any requested replay to complete quickly. We present an adaptive tracing strategy to keep the message-logging overhead down. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concert/C: supporting distributed programming with language extensions and a portable multiprotocol runtime

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

    We describe the design and implementation of the Concert/C compiler and runtime. We describe solutions to the problems of (1) how to extend a language without compromising the use of legacy source and object code and tools, (2) how to extract language-neutral interface information from native language type declarations, (3) how to make function pointers into first-class values transmissable over a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • 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.
  • Improved algorithms for partitioning tree and linear task graphs on shared memory architecture

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

    In parallel and distributed computing, the overall system performance is significantly influenced by how a task graph representing an application is mapped onto a specific multiprocessor topology. In this paper, algorithms with improved performance are proposed to map tree and linear task graphs onto shared memory multiprocessing architectures. Specifically, the task graphs are partitioned with ou... 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.
  • Distributed coin tossing

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

    This paper presents algorithms for distributed coin tossing. Distributed coin tossing furnishes a symmetrical way to break the symmetry in a distributed system. They allow the conflicts arising from competing remote sites to be overcome in a fair (equiprobable) manner: any site has an equal chance of being selected. It as also shown how these algorithms may be used to obtain a total order between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A group structuring mechanism for a distributed object-oriented language

    Publication Year: 1994, Page(s):312 - 319
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Describes a structuring mechanism for grouping objects in a distributed object-oriented language. A group structuring mechanism provides a single flexible method for managing distributed applications that involve complicated communication protocols and sophisticated structure. We have added such a mechanism to the Emerald distributed object-oriented language and its run-time system. Our group stru... View full abstract»

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