By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 1 • Date Jan 1994

Filter Results

Displaying Results 1 - 11 of 11
  • A comparative study of topological properties of hypercubes and star graphs

    Publication Year: 1994, Page(s):31 - 38
    Cited by:  Papers (66)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    Undertakes a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, the authors determine necessary and sufficient conditions for shortest path routing and characterize ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incomplete star: an incrementally scalable network based on the star graph

    Publication Year: 1994, Page(s):97 - 102
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Introduces a new interconnection network for massively parallel systems called the incomplete star graph. The authors describe unique ways of interconnecting and labeling the nodes and routing point-to-point communications within this network. In addition, they provide an analysis of a special class of incomplete star graph called C n-1 graph and obtain the diameter and average distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voting as the optimal static pessimistic scheme for managing replicated data

    Publication Year: 1994, Page(s):64 - 73
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. We demonstrate that voting schemes, a very small subset of static pessimistic schemes, are optimal for fully connected networks with negligible link failure rates, ... View full abstract»

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

    Publication Year: 1994, Page(s):102 - 109
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 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 short, critical messages. One technique is to send a copy of a packet over an alternate path before it is known whether the first copy failed or was delayed. A second technique is to spl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of pipelined channels on k-ary n-cube networks

    Publication Year: 1994, Page(s):2 - 16
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1372 KB)

    In a pipelined-channel interconnection network, multiple bits may be simultaneously in flight on a single wire. This allows the cycle time of the network to be independent of the wire lengths, significantly affecting the network design trade-offs. This paper investigates the design and performance of pipelined channel k-ary n-cube networks, with particular emphasis on the choice of dimensionality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reaching approximate agreement with mixed-mode faults

    Publication Year: 1994, Page(s):53 - 63
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    In a fault-tolerant distributed system, different non-faulty processes may arrive at different values for a given system parameter. To resolve this disagreement, processes must exchange and vote upon their respective local values. Faulty processes may attempt to inhibit agreement by acting in a malicious or “Byzantine” manner. Approximate agreement defines one form of agreement in whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly reliable symmetric networks

    Publication Year: 1994, Page(s):94 - 97
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    We generalize directed loop networks to loop-symmetric networks in which there are N nodes and in which each node has in-degree and out-degree k, subject to the condition that 2k does not exceed N. We show that by proper selection of links one can obtain generalized loop networks with optimal or close to optimal diameter and connectivity. The optimized diameter is less than k[N... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of a parallel branch-and-bound algorithm on a class of multiprocessors

    Publication Year: 1994, Page(s):74 - 86
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1188 KB)

    We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decompo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal strategy for comparing file copies

    Publication Year: 1994, Page(s):87 - 93
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    We study the problem of identifying corrupted pages between two remotely located copies of a file in a distributed system. An efficient deterministic algorithm is presented to identify up to any given number of differing pages. The algorithm requires a single exchange of messages and is based on the structure of the Reed-Solomon code. In order to identify up to f corrupted pages, 2f signatures are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hierarchical hypercube: a new interconnection topology for massively parallel systems

    Publication Year: 1994, Page(s):17 - 30
    Cited by:  Papers (31)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    Interconnection networks play a crucial role in the performance of parallel systems. This paper introduces a new interconnection topology that is called the hierarchical hypercube (HHC). This topology is suitable for massively parallel systems with thousands of processors. An appealing property of this network is the low number of connections per processor, which enhances the VLSI design and fabri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access graphs: a model for investigating memory consistency

    Publication Year: 1994, Page(s):39 - 52
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1304 KB)

    Computer architectures supporting shared memory continue to increase in complexity as designers seek to improve memory performance. This is especially true of proposals for massively parallel systems with distributed, yet shared, memory. The need to maintain a reasonably simple memory model for programmers, in spite of enhancements like caches and access pipelining, is responsible for many of the ... View full abstract»

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

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology