By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 9 • Date Sep 1993

Filter Results

Displaying Results 1 - 8 of 8
  • Load balancing requirements in parallel implementations of image feature extraction tasks

    Publication Year: 1993, Page(s):994 - 1013
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1664 KB)

    Load balancing requirements in parallel image analysis are considered and results on the performance of parallel implementations of two image feature extraction tasks on the Connection Machine and the iPSC/2 hypercube are reported and discussed. A load redistribution algorithm, which makes use of parallel prefix operations and one-to-one permutations among the processors, is described and has been... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategies for dynamic load balancing on highly parallel computers

    Publication Year: 1993, Page(s):979 - 993
    Cited by:  Papers (126)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1428 KB)

    Dynamic load balancing strategies for minimizing the execution time of single applications running in parallel on multicomputer systems are discussed. Dynamic load balancing (DLB) is essential for the efficient use of highly parallel systems when solving non-uniform problems with unpredictable load estimates. With the evolution of more highly parallel systems, centralized DLB approaches which make... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program structuring for effective parallel portability

    Publication Year: 1993, Page(s):1041 - 1059
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1660 KB)

    The tension between software development costs and efficiency is especially high when considering parallel programs intended to run on a variety of architectures. In the domain of shared memory architectures and explicitly parallel programs, the authors have addressed this problem by defining a programming structure that eases the development of effectively portable programs. On each target multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hyper-deBruijn networks: scalable versatile architecture

    Publication Year: 1993, Page(s):962 - 978
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1348 KB)

    Both Hypercube and deBruijn networks possess desirable properties. It should be understood, though, that some of the attractive features of one are not found in the other. The architecture proposed in this paper is a combination of these architectures, providing some of the desirable properties of both the networks such as admitting many computationally important networks, flexibility in terms of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making compaction-based parallelization affordable

    Publication Year: 1993, Page(s):1014 - 1029
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    Compaction-based parallelization suffers from long compile time and large code size because of its inherent code explosion problem. If software pipelining is performed for loop parallelization along with compaction, as in the authors' compiler, the code explosion problem becomes more serious. The authors propose the software lookahead heuristic for use in software pipelining, which allows inter-ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loop coalescing and scheduling for barrier MIMD architectures

    Publication Year: 1993, Page(s):1060 - 1064
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Barrier MIMD's are asynchronous multiple instruction stream, multiple data stream architectures capable of parallel execution of variable execution time instructions and arbitrary control flow (e.g., while loops and calls); however, they differ from conventional MIMD's in that the need for run-time synchronization is significantly reduced. The authors consider the problem of scheduling nested loop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of parallel copying garbage collection on a shared-memory multiprocessor

    Publication Year: 1993, Page(s):1030 - 1040
    Cited by:  Papers (6)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during garbage collection. An implementation of the algorithm within a concurrent logic programming system, VPIM, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language portability across shared memory multiprocessors

    Publication Year: 1993, Page(s):1064 - 1072
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Explains why the Force parallel programming language has been easily portable between eight different shared memory multiprocessors. The authors show how a two-layer macro processor allows them to hide machine dependencies and to build machine-independent high-level language constructs. The importance of packaging low-level synchronization operations is demonstrated by a proof of mutual exclusion ... 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