By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov 1995

Filter Results

Displaying Results 1 - 9 of 9
  • Routing in modular fault-tolerant multiprocessor systems

    Publication Year: 1995, Page(s):1206 - 1220
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1476 KB)

    In this paper, we consider a class of modular multiprocessor architectures in which spares are added to each module to cover for faulty nodes within that module, thus forming a fault-tolerant basic block (FTBB). In contrast to reconfiguration techniques that preserve the physical adjacency between active nodes in the system, our goal is to preserve the logical adjacency between active nodes by mea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicoloring of grid-structured PDE solvers on shared-memory multiprocessors

    Publication Year: 1995, Page(s):1195 - 1205
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    In order to execute a parallel PDE (partial differential equation) solver on a shared-memory multiprocessor, we have to avoid memory conflicts in accessing multidimensional data grids. A new multicoloring technique is proposed for speeding sparse matrix operations. The new technique enables parallel access of grid-structured data elements in the shared memory without causing conflicts. The colorin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance considerations of shared virtual memory machines

    Publication Year: 1995, Page(s):1185 - 1194
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as traditional speedup, efficiency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, we show that the difference between the generalized speedup and the traditional speedup lies in the defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive fault-tolerant routing algorithm for hypercube multicomputers

    Publication Year: 1995, Page(s):1147 - 1152
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    This paper presents a partially adaptive fault-tolerant routing algorithm for hypercube multicomputers. The algorithm is tolerant to n-1 link and/or node faults for an n-cube. It makes routing decisions adaptively based on local failure information only. It is simple to implement and needs a very small message overhead. A comparison between the algorithm and a popular previous work is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient placement of parity and data to tolerate two disk failures in disk array systems

    Publication Year: 1995, Page(s):1177 - 1184
    Cited by:  Papers (21)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    In this paper, we deal with the data/parity placement problem which is described as follows: how to place data and parity evenly across disks in order to tolerate two disk failures, given the number of disks N and the redundancy rate p which represents the amount of disk spaces to store parity information. To begin with, we transform the data/parity placement problem into the problem of constructi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FDDI-M: a scheme to double FDDI's ability of supporting synchronous traffic

    Publication Year: 1995, Page(s):1125 - 1131
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Synchronous messages are usually generated periodically and each of them is required to be transmitted before the generation of the next message. Due to the inherent deficiency in its medium access control (MAC) protocol, an FDDI token ring can use at most one half of its ring bandwidth to transmit such synchronous traffic. This deficiency greatly reduces the FDDI's capability of supporting multim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Annealed embeddings of communication patterns in an interconnection cached network

    Publication Year: 1995, Page(s):1153 - 1167
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1472 KB)

    The communication needs of many parallel applications exhibit what we call switching locality. In such applications, each computation entity (process, thread, etc.) tends to restrict its communication to a small set of other entities. The physical location or proximity of these entities can be arbitrary, as long as the communication degree is small. The Interconnection Cached Network (ICN) is a re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact convergence of a parallel textured algorithm for data network optimal routing problems

    Publication Year: 1995, Page(s):1132 - 1146
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    In our earlier paper (1991), a textured decomposition based algorithm is developed to solve the optimal routing problem in data networks; a few examples were used to illustrate the speedup advantage and the convergence conditions for the textured algorithm to converge to a global minimum. The speedup advantage is investigated in Huang et al. (1993). However, the theoretical foundation is not provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hot-potato algorithms for permutation routing

    Publication Year: 1995, Page(s):1168 - 1176
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    We develop a methodology for the design of hot-potato algorithms for routing permutations. The basic idea is to convert existing store-and-forward routing algorithms to hot-potato algorithms. Using it, we obtain the following complexity bounds for permutation routing: n×n Mesh: 7n+o(n) steps; 2n hypercube: O(n2) steps; n×n Torus: 4n+o(n) steps. The algorithm for t... 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