By Topic

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
  • 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.
  • 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.
  • Management of updates in the enhanced client-server DBMS

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

    The client-server DBMS model has emerged as the main paradigm in database computing. The enhanced client-server architecture takes advantage of all the available client resources including their disk managers. Clients can cache server data into their own disk units if data are part of their operational space. However, when updates occur at the server, some of the client data managers may need to n... 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.
  • 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.
  • 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.
  • A group structuring mechanism for a distributed object-oriented language

    Publication Year: 1994, Page(s):312 - 319
    Cited by:  Papers (1)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • A binding protocol for distributed shared objects

    Publication Year: 1994, Page(s):134 - 141
    Cited by:  Papers (3)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A number of actions, collectively known as binding, prepare a reference for invocation of its target: locating the target, setting up a connection, checking access rights and concurrency control state, type-checking, instantiating a proxy, etc. Existing languages or operating systems support only a single binding policy, that cannot be tailored to object-specific semantics for the management of di... 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.
  • 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.
  • Message complexity of the tree quorum algorithm for distributed mutual exclusion

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

    The tree quorum algorithm (TQA), which logically organizes the sites in a system into a tree, is an efficient and fault-tolerant solution for distributed mutual exclusion. Quorum size can be reduced to log N in the best case of TQA. In this paper, message complexity of TQA is analyzed. Moreover, it is shown that the ratio of message complexity to quorum size converges to 1/p, where p is the probab... 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.
  • 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.
  • A high performance and reliable distributed file facility

    Publication Year: 1994, Page(s):116 - 123
    Cited by:  Papers (4)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    In this paper we demonstrate that the typical problem of loss in performance due to disk I/O can be efficiently dealt with by using separate strategies for the storage of file data and for the data structures required for file management. Furthermore, to make the design very reliable, stable storage is provided. The design of the disk service allows the contents of a file to be distributed among m... 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.
  • A general approach to trace-checking in distributed computing systems

    Publication Year: 1994, Page(s):396 - 403
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The problem of checking the correctness of distributed computations arises when debugging distributed algorithms, and more generally when testing protocols or distributed applications. For that purpose, one describes the expected behavior (or suspected errors) by a global property: for example, a predicate on process variables, or the set of admissible orderings on observable events. The problem i... 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.
  • A network architecture for reliable process group communication

    Publication Year: 1994, Page(s):66 - 73
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Many applications in distributed systems consist of a set of processes over multiple network nodes. Traditionally, the communication to a set of processes or a process group has been implemented by sending unicast messages to each member of the group causing unnecessary network traffic. In this paper, we present the design and implementation of the Process Group Management Protocol (PGMP) which pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linguistic support for controlling protocol execution

    Publication Year: 1994, Page(s):581 - 588
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Implementing efficient communication protocols is an important task in building distributed systems, but is complicated by the difficulties of dealing with complex multi-thread interactions and timing-related bugs. The paper describes Cicero, a set of language constructs designed to alleviate these difficulties. Cicero uses the notion of event patterns (C. V Ravishankar and R. Finkel, 1989) to hel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging distributed programs through the detection of simultaneous events

    Publication Year: 1994, Page(s):634 - 641
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Event based debuggers for distributed systems automatically detect occurrences of user specified events. During debugging it is not always possible to break-point a computation in a state that reflects an event occurrence. Thus, to avoid unnecessary break-points we must develop techniques that determine, prior to the initiation of a breakpoint, whether an event occurrence will be captured by the b... View full abstract»

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