By Topic

Distributed Computing Systems, 1991., 11th International Conference on

Date 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
  • A model of naming for fine-grained service specification in distributed systems

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

    A syntax-oriented model for naming feature-based specification of services is provided. The model allows a service to evolve or reconfigure in functionality by adding and removing features and still coexist with its previous versions. The model's two aspects are examined. With this model for specifying services, name server functions may be factorized from service specific functions and implemente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting problem dynamics through result sharing in dataflow environments

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

    The notion of CPRS (concurrent processing which result sharing) graph decomposition is presented which is based on problem dynamics, and the validity of the CPRS scheme in a dataflow environment is explored. A dynamic dataflow architecture to execute programs under the new model of computation, called the CPRS architecture, is presented. An analytical modeling, based on a closed queueing network m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical factors in NUMA memory management

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

    The authors identify and incorporate the critical factors that influence nonuniform memory access (NUMA) memory management into their performance metrics. Using trace-driven simulations, it is shown that under certain conditions no replication is better than replication. It is also concluded that the effectiveness of replication depends on: (1) the ratio of access times to remote and local memory,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • Reliable broadcast protocol for selectively partially ordering PDUs (SPO protocol)

    Publication Year: 1991, Page(s):239 - 246
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Methods to provide reliable broadcast communication for multiple entities in distributed systems by using unreliable broadcast communication services are discussed. In real distributed applications, each entity sends every PDU (protocol data unit) to only the subset, rather than all the entities, and each entity receives only PDUs destined to it from some entity in the same order as they were sent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nectar CAB: a high-speed network processor

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

    Nectar is a high-speed fiber-optic network developed as a network backplane to support distributed and heterogeneous computing. A distinguishing component of the Nectar network is a highly programmable network processor called the communication accelerator board (CAB). The Nectar CAB has a flexible architecture, where almost all interactions between the network and the host are programmable. This ... 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.
  • CLIDE: a distributed, symbolic programming system based on large-grained persistent objects

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

    Clouds LISP distributed environments (CLIDE) is a distributed, persistent object-based symbolic programming system being implemented on the Clouds distributed operating system. LISP environment instances are stored as large-grained persistent objects, enabling users on many machines to share the contents of these environments through interenvironment evaluations. CLIDE provides a comprehensive res... 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.
  • A transfer policy for global scheduling algorithms to schedule tasks with deadlines

    Publication Year: 1991, Page(s):248 - 255
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    The authors present a load index to characterize the system state that is more conducive to apply preventive and corrective measures, and a transfer policy which takes preventive measures by doing anticipatory task transfers in addition to corrective measures. Key features of this transfer policy are: (1) it is general and can be used in conjunction with a broad range of existing location policies... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regeneration with virtual copies for replicated databases

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

    The consistency control problem for replicated data in a distributed computing system (DCS) is considered. An algorithm is proposed to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The algorithm combines the advantages of voting-based algorithms and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical approach for parallel optimization with application to VLSI placement

    Publication Year: 1991, Page(s):518 - 525
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    A massively parallel optimization approach based on simple neighborhood search techniques was developed and applied to the problem of VLSI cell placement. Statistical models are developed to analyze the performance of the approach in general, and to derive statistical bounds on the quality of obtainable results. The results of these analyses suggest a simple framework for approximate solution of d... 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.
  • A dynamic load balancing policy with a central job dispatcher (LBC)

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

    A dynamic load balancing policy with a central job dispatcher, called the LBC policy, is proposed for distributed systems. The design of this policy is motivated by the operation of a single-queue-multi-server queuing system. The average job response time of this policy is the same as that of a single-queue-multi-server system which is the best achievable performance when the communication delay i... 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.
  • A randomized voting algorithm

    Publication Year: 1991, Page(s):412 - 419
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems (for instance, the traveling salesman problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed processor level fault diagnosis of multiple processor systems

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

    A distributed processor level fault diagnosis algorithm is proposed where every processor will come up with its own conclusion about the status of other processors and also the links connecting it to its neighboring processors. Performance is improved by considering a dynamic testing strategy where each processor is assigned a small number of processors to test it, ideally two. Then, when some pro... 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 (2)
    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.
  • 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.
  • 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.
  • 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.
  • The hyper-deBruijn multiprocessor networks

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

    Hypercube and deBruijn networks each possess certain desirable properties. The architecture proposed is a combination of the hypercube and deBruijn architectures. Thus, it provides flexibility in terms of connections per node and the level of fault-tolerance. The graph structure allows a direct decomposition of the network into VLSI building blocks. These networks possess logarithmic diameter, opt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing and programming causal distributed shared memory

    Publication Year: 1991, Page(s):274 - 281
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A simple owner protocol for implementing a causal distributed shared memory (DSM) is presented, and it is argued that this implementation is more efficient than comparable coherent DSM implementations. Moreover, it is shown that writing programs for causal memory is no more difficult than writing programs for atomic shared memory View full abstract»

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