By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 5 • Date May 1996

Filter Results

Displaying Results 1 - 10 of 10
  • Efficient termination detection for loosely synchronous applications in multicomputers

    Publication Year: 1996, Page(s):537 - 544
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    We propose a simple algorithm which is based on edge-coloring of system graphs for termination detection of loosely synchronous computations. The proposed algorithm is fully symmetric in that all processors run syntactically identical code and can detect global termination at the same time. Under the 1-port communication model, the algorithm is optimal in terms of termination delay, the difference... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmark evaluation of the IBM SP2 for parallel signal processing

    Publication Year: 1996, Page(s):522 - 536
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1556 KB)

    This paper evaluates the IBM SP2 architecture, the AIX parallel programming environment, and the IBM message-passing library (MPL) through STAP (Space-Time Adaptive Processing) benchmark experiments. Only coarse-grain parallelism was exploited on the SP2 due to its high communication overhead. A new parallelization scheme is developed for programming message passing multicomputers. Parallel STAP b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors

    Publication Year: 1996, Page(s):506 - 521
    Cited by:  Papers (346)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1916 KB)

    In this paper, we propose a static scheduling algorithm for allocating task graphs to fully connected multiprocessors. We discuss six recently reported scheduling algorithms and show that they possess one drawback or the other which can lead to poor performance. The proposed algorithm, which is called the Dynamic Critical-Path (DCP) scheduling algorithm, is different from the previously proposed a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • All-to-all personalized communication in a wormhole-routed torus

    Publication Year: 1996, Page(s):498 - 505
    Cited by:  Papers (42)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding of complete binary trees into meshes with row-column routing

    Publication Year: 1996, Page(s):493 - 497
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    This paper considers the problem of embedding complete binary trees into meshes using the row-column routing and obtained the following results: a complete binary tree with 2p-1 nodes can be embedded (1) with link congestion one into a 9/8√(2p9/ 8√(2p) mesh when p is even and a √( 9/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A family of interconnection networks for nonuniform traffic

    Publication Year: 1996, Page(s):486 - 492
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    New networks, called GLO networks, are constructed by adding bus-like links to omega networks, providing additional capacity between cells on momentarily busy paths. Equivalent pin-count GLO and omega networks offered uniform and nonuniform traffic were simulated. GLO networks exhibited lower latency for nonuniform traffic and light to moderate uniform traffic View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A flexible bit-pattern associative router for interconnection networks

    Publication Year: 1996, Page(s):477 - 485
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    A programmable associative approach to execute implicit routing algorithms is presented. Algorithms are mapped onto a set of bit-patterns that are matched in parallel. We have studied and mapped a large number of routing algorithms for a wide range of interconnection network topologies. Here we report three cases that illustrate the capabilities of the router scheme. For the studied topologies, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On effective execution of nonuniform DOACROSS loops

    Publication Year: 1996, Page(s):463 - 476
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1280 KB)

    It is extremely difficult to parallelize DOACROSS loops with nonuniform loop-carried dependences. In this paper, we present a static scheduling scheme with an accompanying synchronization strategy that can execute such DOACROSS loops effectively and efficiently. Our approach uses one of the parallelization techniques called Dependence Uniformization, which finds a small set of uniform dependence v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modular systolic linearization of the Warshall-Floyd algorithm

    Publication Year: 1996, Page(s):449 - 455
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as fast as the fully-pipelined existing ones and, moreover, they need less cells View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • All nearest smaller values on the hypercube

    Publication Year: 1996, Page(s):456 - 462
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to find, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models but the running time of the best previous hypercube algorithm is optimal only when the number ... 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