By Topic

Proceedings.,10th International Conference on Distributed Computing Systems

May 28 1990-June 1 1990

Filter Results

Displaying Results 1 - 25 of 70
  • Proceedings. The 10th International Conference on Distributed Computing Systems (Cat. No.90CH2878-7)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • A constructive approach to the design of distributed systems

    Publication Year: 1990, Page(s):580 - 587
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    A constructive design approach to distributed systems is described. The approach is illustrated by a model airport shuttle system, which is implemented in an environment for distributed programming called Conic. The main principles on which the constructive approach is based are those of explicit system structure and context-independent components. Structure is explicitly described and preserved d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal routing in the de Bruijn networks

    Publication Year: 1990, Page(s):537 - 544
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The problem of optimal routing in an interconnection network, called the de Bruijn network, where the sites are linked in the form of a de Bruijn graph, is considered. The distance functions for both the undirected and directed de Bruijn graphs are provided. The optimal routing problem is then reduced to that of pattern matching. Morris and Pratt's (1970) failure function and Weiner's (1973) prefi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of communication resource allocation in a distributed system

    Publication Year: 1990, Page(s):530 - 536
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The authors introduce two techniques for allocating and managing buffers in support of distributed system operation and evaluate the resulting system behavior. For this evaluation a methodology that permits the development of an analytic model is introduced. With the help of this model, it becomes possible to fine-tune the buffer allocation policies in realistic system configurations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a broadcast star local area network with collision avoidance

    Publication Year: 1990, Page(s):522 - 529
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The performance of a broadcast star network is analyzed, under the assumption of synchronous operation of a network. An exact analysis for a broadcast star network with an infinite station population, an exact analysis for a small network with a finite station population, and an approximate analysis for a large network with a finite station population are presented. In synchronous operation, the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of the backtrack-to-the-origin-and retry routing for hypercycle-based interconnection networks

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

    Hypercycles, a class of multidimensional graphs that are generalizations of the n-cube are presented. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection strategy. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of different size graphs. These graphs can be used in the desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time synchronization protocols for shared memory multiprocessors

    Publication Year: 1990, Page(s):116 - 123
    Cited by:  Papers (68)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    A priority-based synchronization protocol that explicitly uses shared-memory primitives is defined and analyzed. A solution that has been proposed for bounding and minimizing synchronization delays in real-time systems is briefly reviewed. The waiting times introduced by synchronization requirements in multiple-processor environments are identified, and a set of goals for priority-based multiproce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Allocation and scheduling of complex periodic tasks

    Publication Year: 1990, Page(s):108 - 115
    Cited by:  Papers (83)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    A static algorithm for allocating and scheduling components of complex periodic tasks across sites in distributed systems is discussed. Besides dealing with the periodicity constraints (which have been the sole concern of many previous algorithms), this algorithm handles precedence, communication, and fault-tolerance requirements of subtasks of the tasks. The algorithm determines the allocation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed processing of multimedia information

    Publication Year: 1990, Page(s):588 - 597
    Cited by:  Papers (2)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    Requirements for distributed processing of multimedia information are summarized and compared with recent efforts at standardization. An approach toward an integrated information and communication model, which can be viewed as a special form of a model for open distributed applications, is outlined. Additionally, synchronization aspects of isochronous and anisochronous communication are outlined. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regeneration-based multiversion dynamic voting scheme for replicated database systems

    Publication Year: 1990, Page(s):370 - 377
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    In replicated database systems, a replication control protocol is needed to ensure one-copy serializability. The author incorporates the concept of a regeneration into the missing-partition dynamic voting scheme to design a replication control protocol. Like the original missing-partition dynamic voting scheme, this protocol supports an inexpensive read operation which accesses one copy, rather th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and identification of events for debugging and performance monitoring of distributed multiprocessor systems

    Publication Year: 1990, Page(s):476 - 483
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The design of a debugging and performance analysis system that includes a specification language for process-level events and hardware for nonintrusive identification of these events during the execution of parallel and distributed application for a nonshared memory system is presented. The design is based on a formal event/action model and a layered architecture model that have been previously pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional voting: a general method for implementing synchronization in distributed systems

    Publication Year: 1990, Page(s):362 - 369
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A concept called multidimensional voting, in which the vote and quorum assignments are k-dimensional vectors of nonnegative integers and each dimension is independent of the others, is introduced. Multidimensional voting is more powerful than traditional weighted voting because it is equivalent to the general method for achieving synchronization in distributed systems which is based on co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing objects on action paths

    Publication Year: 1990, Page(s):572 - 579
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The author presents a comprehensive routing system for dispatching an object between action stops, finding the principals (on the basis of functional information), notifying them in turn when their action is required, and potentially relocating the routed object to their nodes. Additional mechanisms for nagging principles who forget to act on the object, reporting progress (or lack thereof) to oth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing host load, network load, and latency in a distributed shared memory

    Publication Year: 1990, Page(s):468 - 475
    Cited by:  Papers (13)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Changes made to a distributed shared memory that runs of Sun workstations under SunOS 4.0 operating systems, called Mether, are outlined. Protocols developed to use Mether and that minimize host load, network load, and latency are discussed. The changes to Mether involve exposing an inconsistent store to the applications and making access to the consistent and inconsistent versions very convenient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving high availability in a replicated file system by dynamically ordering transactions

    Publication Year: 1990, Page(s):432 - 439
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    A pessimistic consistency-control algorithm is presented. The principle of the algorithm is to order transactions dynamically in the global serialization graph of the system. This order is built by associating numbers with transactions in such a way that these numbers decrease along any path in the graph. Transaction numbers correspond to an arbitrary ordering of replicated objects. The model of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-based congestion avoidance and control scheme for packet switched networks

    Publication Year: 1990, Page(s):390 - 397
    Cited by:  Papers (5)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A congestion avoidance and control scheme that monitors the incoming traffic to each destination and provides rate-based feedback information to the sources of bursty traffic so that sources of traffic can adjust their packet rates to match the network capacity is described. The congestion avoidance mechanism at nodes on the periphery of the network controls incoming traffic so that it does not ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint

    Publication Year: 1990, Page(s):494 - 501
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The problem of finding an optimal assignment of task modules with a precedence relationship in a distributed computing system is considered. The objective of task assignment is to minimize the task turnaround time. The problem is known to be NP-complete for more than three processors. To solve the problem, a well-known state-space reduction technique, branch-and-bound-with-underestimates, is appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a hierarchically interconnected multiprocessor

    Publication Year: 1990, Page(s):352 - 359
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    A queuing model of a parallel processor with an interconnection network incorporating a hierarchy of paths is developed and analyzed. The model captures the behavior of the processors, the interconnection network, and the storage modules. The network considered includes fast paths that operate in the absence of contention and alternate paths with contention resolution. The network overall performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Petri net reduction to support Ada-tasking deadlock detection

    Publication Year: 1990, Page(s):96 - 103
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The application of Petri net reduction to Ada-tasking deadlock detection is investigated. Net reduction can ease reachability analysis by reducing the size of the net while preserving relevant properties. By combining Petri net theory and knowledge of Ada-tasking semantics some specific efficient reduction rules are derived for Petri net models of Ada-tasking. A method by which a useful descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overview of disaster recovery for transaction processing systems

    Publication Year: 1990, Page(s):286 - 293
    Cited by:  Papers (4)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    An overview is given of the major issues involved in maintaining an up-to-date backup copy of a database, kept at a remote site. A method is presented for performing this task without impairing the performance at the primary site. The method is scalable, and it is particularly suitable for multiprocessor systems. The mechanism is relatively straightforward and can be implemented using well-known c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent analysis of structures on shared memory machines

    Publication Year: 1990, Page(s):338 - 343
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A practical solution to the structural analysis problem in a parallel processing environment is investigated through the use of the notion of cheap concurrency and the concept of thread. Portions of a structural analysis code implemented in C are parallelized using the encore parallel threads on an encore multimax multiprocessor computer. The issues of racing condition, synchronization, and mappin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal static load balancing of multi-class jobs in a distributed computer system

    Publication Year: 1990, Page(s):562 - 569
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    This model is an extension of the Tantawi and Towsley (1985) single-job-class model as applied to a multiple-job-class model. Some properties of the optimal solution are shown. On the basis of these properties, a straightforward and efficient algorithm for optimal load balancing of multiclass jobs is derived. The performance of this algorithm is compared with that of two other well-known algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On replay detection in distributed systems

    Publication Year: 1990, Page(s):188 - 195
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Various approaches to the problem of replay detection in distributed systems are briefly reviewed. An approach based on combining a variable-size time-window mechanism with a challenge mechanism is proposed. This approach has the following properties: (1) it does not depend on clock synchronization, (2) it allows the setting of a minimum server's memory-buffer size in a way that ensures acceptance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-level programming

    Publication Year: 1990, Page(s):458 - 465
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The use of a declarative language, called Dura, designed to support application-level programming is illustrated by distributed avionics system. The authors show how the language is used to describe the application, its components and structure; how the run-time executive provides support for fault-tolerance by reconfiguration of the application; and how an interactive interface to the executive s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Disk cache performance for distributed systems

    Publication Year: 1990, Page(s):212 - 219
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The influence of client and server cache sizes and the number of clients on caching performance is studied through trace-driven simulation. The results indicate that the locality of reference in disk block reference patterns allows relatively small caches to reduce significantly the number of disk accesses required. File server cache performance is significantly different from client cache perform... View full abstract»

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