By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec 1994

Filter Results

Displaying Results 1 - 10 of 10
  • Performance evaluation of scheduling precedence-constrained computations on message-passing systems

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

    Using knowledge on computation, communication, and multiprocessor topology, a class of global priority-based scheduling heuristics, called generalized list scheduling (GLS) is proposed. Task-priority is defined as the completion time of the task following backward scheduling the computation over the multiprocessor by using the best local heuristic. GLS scheduling consists of using the task-priorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks

    Publication Year: 1994, Page(s):1233 - 1251
    Cited by:  Papers (40)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    This paper consists of two parts. In the first part, two new algorithms for deadlock- and livelock-free wormhole routing in the torus network are presented. The first algorithm, called Channels, is for the n-dimensional torus network. This technique is fully-adaptive minimal, that is, all paths with a minimal number of hops from source to destination are available for routing, and needs only five ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index transformation algorithms in a linear algebra framework

    Publication Year: 1994, Page(s):1302 - 1309
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    We present a linear algebraic formulation for a class of index transformations such as Gray code encoding and decoding, matrix transpose, bit reversal, vector reversal, shuffles, and other index or dimension permutations. This formulation unifies, simplifies, and can be used to derive algorithms for hypercube multiprocessors. We show how all the widely known properties of Gray codes, and some not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance model for multilayer neural networks in linear arrays

    Publication Year: 1994, Page(s):1322 - 1328
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    An analytical model is presented for assessing the performance of multilayer neural networks implemented in linear arrays. Metrics to assess latency, throughput rate, and computational and input-output bandwidth are developed. These metrics demonstrate a rich and complex interaction between the performance of the hardware and the number and relative dimensions of the layers in a network. Practical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unicast-based multicast communication in wormhole-routed networks

    Publication Year: 1994, Page(s):1252 - 1265
    Cited by:  Papers (133)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operationally enhanced folded hypercubes

    Publication Year: 1994, Page(s):1310 - 1316
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Recently, several variations of the hypercube have been proposed to enhance its performance and reliability. The folded hypercube is one of these variations, in which an extra link is added to each node providing a direct connection to the node located farthest from it. In this paper, we propose a new operation mode of the folded hypercube to enhance its performance and fault-tolerance. There are ... View full abstract»

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

    Publication Year: 1994, Page(s):1329 - 1334
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    On vector supercomputers, vector register processors share a global highly interleaved memory. In order to optimize memory throughput, a single-instruction, multiple-data (SIMD) synchronization mode may be used on vector sections. We present an interleaved parallel scheme (IPS). Using IPS ensures an equitable distribution of elements on a highly interleaved memory for a wide range of vector stride... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and run-time algorithms for all-to-many personalized communication on permutation networks

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

    With the advent of new routing methods, the distance that a message is sent is becoming relatively less and less important. Thus, assuming no link contention, permutation seems to be an efficient collective communication primitive. In this paper, we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. We discuss several algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal NODUP all-to-all broadcast schemes in distributed computing systems

    Publication Year: 1994, Page(s):1275 - 1285
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    Broadcast, referring to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcast means the process by which every node broadcasts its certain piece of information to all other nodes. In this paper, we first develop the optimal al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of robust distributed load sharing strategies

    Publication Year: 1994, Page(s):1286 - 1301
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB)

    In this paper, we examine a set of load sharing strategies that are robust to the unreliable state information that is often present in a distributed database system. In this environment, sites must solve the problem of how alternative sites should be selected to process incoming transactions, given that the information on which the decision is based exhibits varying degrees of obsolescence. A set... 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