IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Nov 2000

Filter Results

Displaying Results 1 - 6 of 6
  • A residue number system on reconfigurable mesh with applications to prefix sums and approximate string matching

    Publication Year: 2000, Page(s):1186 - 1199
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Several new number representations based on a residue number system are presented which use the smallest prime numbers as moduli and are suited for parallel computations on a reconfigurable mesh architecture. The bit model of linear reconfigurable mesh with exclusive write and unit-time delay for broadcasting on a subbus is assumed. It is shown how to convert in O(1) time any integer, ranging betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance metrics for embedded parallel pipelines

    Publication Year: 2000, Page(s):1164 - 1185
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A statistical approach to performance prediction is applied to a system development methodology for pipelines comprised of independent parallel stages. The methodology is aimed at distributed memory machines employing medium-grained parallelization. The target applications are continuous-flow embedded systems. The use of order statistics on this type of system is compared to previous practical usa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic task scheduling using online optimization

    Publication Year: 2000, Page(s):1151 - 1163
    Cited by:  Papers (20)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Algorithms for scheduling independent tasks on to the processors of a multiprocessor system must trade-off processor load balance, memory locality, and scheduling overhead. Most existing algorithms, however, do not adequately balance these conflicting factors. This paper introduces the self-adjusting dynamic scheduling (SADS) class of algorithms that use a unified cost model to explicitly account ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental design of scalable interconnection networks using basic building blocks

    Publication Year: 2000, Page(s):1126 - 1140
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    In this paper, we present an incremental design of scalable interconnection networks in multicomputer systems using basic building blocks. Both network topologies and routing algorithms are considered. We use wormhole-routed small-scale 2D meshes as basic building blocks. The minimum requirement to expand these networks is a single building block. This implies that the network does not have to mai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data locality exploitation in the decomposition of regular domain problems

    Publication Year: 2000, Page(s):1141 - 1150
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    The aim of this paper is to study the effect of local memory hierarchy and communication network exploitation on message sending and the influence of this effect on the decomposition of regular applications. In particular, we have considered two different parallel computers, a Cray T3E-900 and an SGI Origin 2000. In both systems, the bandwidth reduction due to non-unit-stride memory access is quit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified symbolic evaluation framework for parallelizing compilers

    Publication Year: 2000, Page(s):1105 - 1125
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The quality of many optimizations and analyses of parallelizing compilers depends significantly on the ability to evaluate symbolic expressions and on the amount of information available about program variables at arbitrary program points. In this paper, we describe an effective and unified symbolic evaluation framework that statically determines the values of variables and symbolic expressions, a... 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.

Full Aims & Scope

Meet Our Editors

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