[1991] Proceedings. 11th International Conference on Distributed Computing Systems

20-24 May 1991

Filter Results

Displaying Results 1 - 25 of 74
  • 11th International Conference on Distributed Computing Systems (Cat. No.91CH2996-7)

    Publication Year: 1991, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Supporting resource discovery among public Internet archives using a spectrum of information quality

    Publication Year: 1991, Page(s):82 - 89
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Wide area networks offer access to an increasing number and variety of resources. Yet, it is difficult to locate resources of interest, because of the scale and decentralized nature of the environment. The authors are interested in supporting a global confederation of loosely cooperating systems and users that share far more resources than can be completely organized. Therefore, mechanisms are nee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance optimization of integrated network control schemes in packet-switched networks

    Publication Year: 1991, Page(s):36 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Integrated schemes of routing, flow control, and congestion control in packet-switched networks are investigated for performance optimization. After the control parameters and objective function are introduced, an efficient method is derived to compute the gradient vector and Hessian matrix of such an objective function. The method, used with a general nonlinear programming strategy, solves this n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of three token ring protocols for real-time communications

    Publication Year: 1991, Page(s):308 - 317
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    When developing distributed scheduling algorithms such as communication protocols, issues in achieving optimal policy and minimizing overhead must be addressed. This problem is examined in the context of a specific distributed system-the token ring communication network. Three token ring protocols are considered which are representative of many existing ones in the sense that they incorporate mess... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic reconfiguration in an object-based programming language with distributed shared data

    Publication Year: 1991, Page(s):73 - 80
    Cited by:  Papers (9)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    An approach to dynamic reconfiguration in online distributed applications based on a data sharing model is presented. The data sharing model consists of facets, objects, and processes, with facets as the unit of sharing. The primary contribution of this work is the addition of important special cases of dynamic reconfiguration, without resorting to general dynamic allocation. A metaphor consistent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ASTRA-an asynchronous remote procedure call facility

    Publication Year: 1991, Page(s):172 - 179
    Cited by:  Papers (10)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A transport-independent asynchronous RPC (remote procedure call) mechanism (ASTRA) that combines the advantages of both RPC and message-passing IPC (interprocess communication) has been designed and implemented. ASTRA calls do not block the caller (client) and the replies can be received as and when they are needed, thus allowing the client execution to proceed locally in parallel with the server ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximations of the mean resequencing waiting time in M/GI/c systems

    Publication Year: 1991, Page(s):28 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The problem of obtaining approximate formulas for mean resequencing waiting times of M/GI/c queueing systems is considered. Two assumptions, commonly used in the study of M/GI/c systems, to derive the formulas are adopted. The formulas are quite accurate and the accuracy increases as c becomes larger. The relative differences between simulation results and the ones calc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time communication in multi-hop networks

    Publication Year: 1991, Page(s):300 - 307
    Cited by:  Papers (60)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A scheme is developed for providing predictable interprocess communication in real-time systems with (partially connected) point-to-point interconnection networks, which provides guarantees on the maximum delivery time for messages. This scheme is based on the concept of a real-time channel, a unidirectional connection between source and destination. A real-time channel has parameters which descri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlapping window algorithm for computing GVT in Time Warp

    Publication Year: 1991, Page(s):534 - 541
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    Techniques are proposed for computing a global virtual time (GVT), which is the minimum local virtual time of processes in Time Warp. The algorithm computes a conservative estimate of GVT using an approach which is considerably simpler than previous algorithms for computing GVT. This algorithm does not require a global synchronization of processors. An inherent problem is GVT computation relates t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-based approach to implementing distributed concurrency control

    Publication Year: 1991, Page(s):65 - 72
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Distributed concurrency control has been implemented by representing in-progress transactions as simulated objects, called transaction objects, that use normal message passing facilities. The implementation of an optimistic mechanism has been completed using transaction objects and a two-phase locking mechanism has been designed. The tradeoffs made and lessons learned, dealing with transactions bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggressive transmissions over redundant paths

    Publication Year: 1991, Page(s):198 - 207
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Fault-tolerant computer systems have redundant paths connecting their components. Given these paths, it is possible to use aggressive techniques to reduce the average value and variability of the response time for critical messages. One technique is to send a copy of a packet over an alternate path before it is known if the first copy failed or was delayed. A second technique is to split a single ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed algorithms for leader election in complete networks

    Publication Year: 1991, Page(s):472 - 479
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    An efficient protocol for leader election in an asynchronous complete network is presented. The time complexity of the protocol is better than the currently known protocols for this problem. A message optimal protocol is presented that requires O(N/log N) time, where N is the number of nodes in the network. Also given is family of protocols with message and time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BNB self-routing permutation network

    Publication Year: 1991, Page(s):574 - 581
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A self-routing permutation network capable of routing all n factorial permutations of its n inputs to its n outputs is presented. The network implements the binary radix sorting on the structure of the generalized baseline network, a modified model of the original baseline network. The network has O(N log 3 N) hardware complexity an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated design, simulation, and verification of real-time systems

    Publication Year: 1991, Page(s):164 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The goal of this research is to develop a design methodology that allows performance characteristics of a system to be monitored through all stages of its development, from initial design to system deployment. The use of partially implemented performance specifications (PIPS) as the design paradigm for real-time systems is proposed. A PIPS model is a partially implemented system where some system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous process migration by recompilation

    Publication Year: 1991, Page(s):18 - 25
    Cited by:  Papers (27)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    An approach to heterogeneous process migration that involves building a machine-independent migration program that specifies the current code and data state of the process to be migrated is described. When this program is compiled and executed on the target machine, it will first reconstruct the process's state and then continue the normal execution of the now-migrated process. The principal advan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rectifying corrupted files in distributed file systems

    Publication Year: 1991, Page(s):446 - 453
    Cited by:  Papers (3)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A probabilistic comparison algorithm is presented which requires O(f log n) bits to be transmitted to identify the corrupt pages in a file (where n is the number of pages and f is the maximum number of pages that could be corrupted), which improves on previous results on the growth of communicated bits as functions of both n and of f. If both c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic clock synchronization in large distributed systems

    Publication Year: 1991, Page(s):290 - 297
    Cited by:  Papers (6)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local clock. The algorithm does not require master/slave clocks and reduces the number of messages needed. As a result it is suitable for use in large distributed systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid partitioning for particle-in-cell simulation on shared memory systems

    Publication Year: 1991, Page(s):526 - 533
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The authors explore parallel processing issues, such as relationships between speedup and problem partitioning schemes, and problem size and time duration of each iteration for PIC (particle in cell) method on different multiprocessors. A partitioning scheme, hybrid partitioning, is introduced. Hybrid partitioning has evolved out of two general approaches to PIC problem decomposition on multiproce... View full abstract»

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

    Publication Year: 1991, Page(s):54 - 64
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    A language has been developed for queries which serves as an extension of the browsing model of hypertext systems. The query language and data model fit naturally into a distributed environment. A simple and efficient method is discussed for processing distributed queries in this language. Results of experiments run on a distributed data server using this algorithm are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical modeling of availability in distributed systems

    Publication Year: 1991, Page(s):190 - 197
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    A two-level hierarchical model is proposed to analyze the availability of distributed systems as perceived by their users. At the higher level (user level), the availability of the tasks (processes) is analyzed in terms of the availability of the system components. At the lower level (component level), detailed Markov models are developed to analyze the component availabilities. These models take ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group communication in the Amoeba distributed operating system

    Publication Year: 1991, Page(s):222 - 230
    Cited by:  Papers (85)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Primitives for broadcast communication that have been integrated with the Amoeba distributed operating system are introduced. The semantics of the broadcast primitives are simple and easy to understand, but are still powerful. The proposed primitives, for example, guarantee global ordering of broadcast messages. The proposed primitives are also efficient: a reliable broadcast can be done in just s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Electing leaders based upon performance: the delay model

    Publication Year: 1991, Page(s):464 - 471
    Cited by:  Papers (7)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    In a distributed system an algorithm used to select a distinguished node or leader in the system is known as a leader election algorithm. Leader election algorithms are examined that attempt to locate the leader at a good node (from a performance standpoint) in the system. In the preference-based approaches examined, each node in the system uses locally available information to vote for the variou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing on generalized hypercube and mesh multiprocessors with LAL

    Publication Year: 1991, Page(s):402 - 409
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A typical nearest neighbor balancing strategy, called LAL (local average load), in which the workload of a processor is averaged among its nearest neighbors at discrete time steps is investigated. The underlying systems considered are multiprocessor systems interconnected by generalized hypercube (GHC), mesh and loop structures. It is assumed that the amount of computation tasks arriving at or fin... View full abstract»

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

    Publication Year: 1991, Page(s):336 - 343
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The justification, design, and performance of the Stealth distributed scheduler is discussed. The goal of Stealth is to exploit the unused computing capacity of a workstation-based distributed system (WDS) without undermining the predictability in quality of service that a WDS provides to workstation owners. It is shown that the liberal approach taken by the Stealth distributed scheduler is a prom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic reconfiguration of distributed programs

    Publication Year: 1991, Page(s):560 - 571
    Cited by:  Papers (22)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    A general framework is developed for reconfiguring applications dynamically, where developers may alter the application without loss of service. After presenting the overall framework within which reconfiguration is possible, a description is given of the formal approach for programmers to capture the state of a process abstractly. An environment to support experimentation with dynamic reconfigura... View full abstract»

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