By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 9 • Date Sep 1998

Filter Results

Displaying Results 1 - 8 of 8
  • On exploiting task duplication in parallel program scheduling

    Publication Year: 1998, Page(s):872 - 892
    Cited by:  Papers (128)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executing on different processors exchange data. Given a task graph, duplication-based scheduling can mitigate this overhead by allocating some of the tasks redundantly on more than one processor. In this paper, we focus on the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scaling simulation of the fusing-restricted reconfigurable mesh

    Publication Year: 1998, Page(s):861 - 871
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    This paper deals with the ability of a model to adapt algorithm instances of different sizes to run on a given model size without significant loss of efficiency. The overhead in simulating a step of a large instance of the model on a smaller instance can quantify this ability. A reconfigurable mesh (R-Mesh) can use its bus structure as a computational resource, presenting an obstacle to efficientl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosability of the Mobius cubes

    Publication Year: 1998, Page(s):923 - 928
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    The recently introduced interconnection networks, the Mobius cubes, are hypercube variants that have some better properties than hypercubes. The n-dimensional Mobius cube Mn is a regular graph with 2n nodes and n2n-1 edges. The diameter of Mn is about one half that of the n-dimensional hypercube Q n and the average number of steps between node... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for scheduling jobs in hypercube systems

    Publication Year: 1998, Page(s):856 - 860
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    In this paper, we consider the problem of nonpreemptively scheduling independent jobs so as to minimize overall finish time on an m-dimensional hypercube system. This problem is NP-hard. We propose a polynomial time approximation algorithm and prove that the absolute performance ratio of the algorithm does not exceed 1.875. This is the first algorithm achieving an absolute performance ratio less t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The offset cube: a three-dimensional multicomputer network topology using through-wafer optics

    Publication Year: 1998, Page(s):893 - 908
    Cited by:  Papers (6)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Three-dimensional packaging technologies are critical for enabling ultra-compact, massively parallel processors (MPPs) for embedded applications. Through-water optical interconnect has been proposed as a useful technology for building ultra-compact MPPs since it provides a simplified mechanism for interconnecting stacked multichip substrates. This paper presents the offset cube, a new network topo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized routing, selection, and sorting on the OTIS-mesh

    Publication Year: 1998, Page(s):833 - 840
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh. The diameter of an N2-processor OTIS-Mesh is 4√N-3. We present an algorithm for routing any partial pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access control and signatures via quorum secret sharing

    Publication Year: 1998, Page(s):909 - 922
    Cited by:  Papers (13)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. We propose a separation between access servers, which are protected and trustworthy, but may be outdated, and the data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new parallel and distributed shortest path algorithm for hierarchically clustered data networks

    Publication Year: 1998, Page(s):841 - 855
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This paper presents new efficient shortest path algorithms to solve single origin shortest path problems (SOSP problems) and multiple origins shortest path problems (MOSP problems) for hierarchically clustered data networks. To solve an SOSP problem for a network with n nodes, the distributed version of our algorithm reaches the time complexity of O(log(n)), which is less than the time complexity ... 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