By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov 1996

Filter Results

Displaying Results 1 - 6 of 6
  • Achieving full parallelism using multidimensional retiming

    Publication Year: 1996, Page(s):1150 - 1163
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1700 KB)

    Most scientific and digital signal processing (DSP) applications are recursive or iterative. Transformation techniques are usually applied to get optimal execution rates in parallel and/or pipeline systems. The retiming technique is a common and valuable transformation tool in one-dimensional problems, when loops are represented by data flow graphs (DFGs). In this paper, uniform nested loops are m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition abstraction in parallel rule languages

    Publication Year: 1996, Page(s):1164 - 1184
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2120 KB)

    Decomposition abstraction is the process of organizing and specifying decomposition strategies for the exploitation of parallelism available in an application. In this paper we develop and evaluate declarative primitives for rule-based programs that expand opportunities for parallel execution. These primitives make explicit, implicit relations among the data and similarly among the rules. The sema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPIFFI-a scalable parallel file system for the Intel Paragon

    Publication Year: 1996, Page(s):1185 - 1200
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1720 KB)

    This paper presents the design and performance of SPIFFI, a scalable high-performance parallel file system intended for use by extremely I/O intensive applications including “Grand Challenge” scientific applications and multimedia systems. This paper contains experimental results from a SPIFFI prototype on a 64 node/64 disk Intel Paragon. The results show that SPIFFI provides high perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of memory contention on dynamic scheduling on NUMA multiprocessors

    Publication Year: 1996, Page(s):1201 - 1214
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1484 KB)

    Self-scheduling is a method for task scheduling in parallel programs, in which each processor acquires a new block of tasks for execution whenever it becomes idle. To get the best performance, the block size must be chosen to balance the scheduling overhead against the load imbalance. To determine the best block size, a better understanding of the role of load imbalance in self-scheduling performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for resource-constrained rate-optimal software pipelining

    Publication Year: 1996, Page(s):1133 - 1149
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1684 KB)

    The rapid advances in high-performance computer architecture and compilation techniques provide both challenges and opportunities to exploit the rich solution space of software pipelined loop schedules. In this paper, we develop a framework to construct a software pipelined loop schedule which runs on the given architecture (with a fixed number of processor resources) at the maximum possible itera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and dynamic evaluation of data dependence analysis techniques

    Publication Year: 1996, Page(s):1121 - 1132
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1332 KB)

    Data dependence analysis techniques are the main component of today's trategies for automatic detection of parallelism. Parallelism detection strategies are being incorporated in commercial compilers with increasing frequency because of the widespread use of processors capable of exploiting instruction-level parallelism and the growing importance of multiprocessors. An assessment of the accuracy o... 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