Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

[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
  • Load balancing on generalized hypercube and mesh multiprocessors with LAL

    Publication Year: 1991, Page(s):402 - 409
    Cited by:  Papers (8)  |  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.
  • Processor allocation vs. job scheduling on hypercube computers

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

    The roles of processor allocation and job scheduling in achieving good performance on hypercube computers are compared. It is shown that the choice of job scheduling discipline has a dramatic effect on performance. A family of scheduling disciplines, called Scan, with particular performance advantages is proposed. Furthermore, it is shown that if Scan scheduling is used, the choice of processor al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling wormhole routing in a hypercube

    Publication Year: 1991, Page(s):386 - 393
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging and performance monitoring for distributed systems: problems and prospects

    Publication Year: 1991, Page(s):378 - 383
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    This paper discusses the following: effective instrumentation as the key to effective monitoring; distributed monitoring systems as a basis for general purpose distributed multiprocessors; problems and prospects; performance monitoring, fact and fancy; and software aspects View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast group membership management in high speed wide area networks

    Publication Year: 1991, Page(s):231 - 238
    Cited by:  Papers (3)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    An application for multicast service for high-speed WANs (wide area networks) which is capable of exploiting multicast hardware is described. Modularity and low cost area achieved by assigning to distinct components the separate problems of (1) naming groups, (2) finding group members in a network, (3) configuring multicast hardware, and (4) delivering multicast messages in sequence. The overall o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed garbage collection of active objects

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

    Distributed automatic garbage collection of objects possessing their own thread of control is discussed. The relevance of garbage collection and concurrent objects to distributed applications is briefly discussed, and the specific model of concurrent objects used is explained. The collector comprises a collection of independent local collectors, one per node, loosely coupled to a distributed globa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection and exploitation of file working sets

    Publication Year: 1991, Page(s):2 - 9
    Cited by:  Papers (16)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The work habits of many individuals yield file access patterns that are quite pronounced and can be regarded as defining working sets of files used for particular applications. A client management technique for detecting these patterns and then exploiting them to successfully prefetch files from servers is described. Trace-driven simulations show the technique substantially increases file cache hi... 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 (82)  |  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.
  • DRISP: a versatile scheme for distributed fault-tolerant queues

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

    A versatile scheme for implementing fault-tolerant queues in a distributed system is proposed. Based on the combination of two simple concepts, by distributing replications of a queue and conducting intelligent-sequential probe (DRISP), the backbone of this work is unsophisticated, yet powerful. A description is presented of the protocols for handling a replicated and distributed queue, which is d... 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.
  • A token based distributed mutual exclusion algorithm based on quorum agreements

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

    A token-based mutual exclusion algorithm is presented which uses data structures similar to coteries, called quorum agreements. The performance of the algorithm depends on the quorum agreements used. When a good quorum agreement is used, the overall performance of the algorithm compares favorably with the performance of other mutual exclusion algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparisons of buffer coherency policies

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

    A comparison is made of four buffer coherency policies: check on access, check on access with periodic notification, selective notification, and broadcast invalidation. These policies differ in their basic approaches on how and when the invalidated granules are identified, and hence, achieve different tradeoffs between buffer hits and overhead of notifications. Analytic models are developed to eva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super Star: a new optimally fault tolerant network architecture

    Publication Year: 1991, Page(s):590 - 597
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    An interconnection topology that can be used to design communication architecture for distributed systems with an arbitrary number of computing nodes is proposed. The design is based on a novel generalization of the concept of star graphs. The proposed topology is shown to be incrementally extensible in steps of 1, optimally fault tolerant, and its diameter is sublogarithmic in the number of nodes 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.
  • Performance analysis of DQDB behaviour with priority levels

    Publication Year: 1991, Page(s):44 - 51
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The bandwidth balancing method (BBM) introduced into the latest versions of the DQDB protocol is discussed. An extended analysis is presented of the behavior of the protocol with the BBM incorporated, assuming that more than one priority level is active in the network. The results are oriented towards evaluation of the effect the BBM has on access delay and bandwidth sharing in overload conditions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A DAG-based algorithm for distributed mutual exclusion

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

    A token-based distributed mutual exclusion algorithm is presented. The algorithm assumes a fully connected, reliable physical network and a directed acyclic graph (DAG) structured logical network. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes. Using the best topology, the algorithm attains comparable performance to a central... 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.
  • Flexible, fault-tolerant routing criteria for circuit-switched hypercubes

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

    A set of routing criteria is proposed for circuit-switched hypercubes that exploit the flexibility provided by the hypercube. The routing criteria are provably deadlock-free and route messages along shortest paths. The number of shortest paths allowed by the routing criteria is more than one for most source-destination pairs. It is shown that the flexibility provided by the routing criteria can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using tracing to direct our reasoning about distributed programs

    Publication Year: 1991, Page(s):552 - 559
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Two principles are proposed for proving and tracing distributed programs: it is necessary to assert in proofs only what can be readily traced, and trace just what can be asserted in the proofs. A proof system and tracing strategy are described for CSP programs based on these principles, using vector time and control variables, not auxiliary variables, to represent control state, and stressing loca... 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.
  • 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.
  • 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.
  • Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms

    Publication Year: 1991, Page(s):344 - 352
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The problem of using the idle cycles of a number of high-performance workstations, interconnected by a high-speed network, for solving computationally intensive tasks is discussed. The classes of distributed applications examined require some form of synchronization among the sub-tasks, hence the need for coscheduling to guarantee that sub-tasks start at the same time and execute at the same pace ... 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.