By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • Date Jul 1996

Filter Results

Displaying Results 1 - 8 of 8
  • A unified framework for optimizing communication in data-parallel programs

    Publication Year: 1996, Page(s):689 - 704
    Cited by:  Papers (23)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1676 KB)

    This paper presents a framework, based on global array data-flow analysis, to reduce communication costs in a program being compiled for a distributed memory machine. We introduce available section descriptor, a novel representation of communication involving array sections. This representation allows us to apply techniques for partial redundancy elimination to obtain powerful communication optimi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localizing failures in distributed synchronization

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

    The fault-tolerance of distributed algorithms is investigated in asynchronous message passing systems with undetectable process failures. Two specific synchronization problems are considered, the dining philosophers problem and the binary committee coordination problem. The abstraction of a bounded doorway is introduced as a general mechanism for achieving individual progress and good failure loca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel asynchronous team algorithms: convergence and performance analysis

    Publication Year: 1996, Page(s):677 - 688
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1100 KB)

    This paper formalizes a general technique to combine different methods in the solution of large systems of nonlinear equations using parallel asynchronous implementations on distributed-memory multiprocessor systems. Such combinations of methods, referred to as team algorithms, are evaluated as a way of obtaining desirable properties of different methods and a sufficient condition for their conver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic analysis and simulation performance of incomplete hypercubes

    Publication Year: 1996, Page(s):740 - 754
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB)

    The incomplete hypercube with arbitrary nodes provides far better incremental flexibility than the complete hypercube, whose size is restricted to exactly a power of 2. After faults arise in a complete hypercube system, it is desirable to reconfigure the system so as to retain as many healthy nodes as possible, often leading to an incomplete hypercube of arbitrary size. In this paper, the highest ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A subsystem-oriented performance analysis methodology for shared-bus multiprocessors

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

    A methodology, called Subsystem Access Time (SAT) modeling, is proposed for the performance modeling and analysis of shared-bus multiprocessors. The methodology is subsystem-oriented because it is based on a Subsystem Access Time Per Instruction (SATPI) concept, in which we treat major components other than processors (e.g., off-chip cache, bus, memory, I/O) as subsystems and model for each of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of load sharing in HARTS with consideration of its communication activities

    Publication Year: 1996, Page(s):724 - 739
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1520 KB)

    We rigorously analyze load sharing (LS) in a distributed real-time system, called HARTS (Hexagonal Architecture for Real-Time Systems), while considering LS-related communication activities, such as task transfers and state-change broadcasts. First, we give an overview of the general distributed real-time LS approach described previously, and then adapt it to HARTS by exploiting the topological pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing distributed event predicate detection algorithms

    Publication Year: 1996, Page(s):673 - 676
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    Recently published algorithms for matching concurrent sets of events have the problem of unbounded message queue growth if events arrive in an undesirable order. This paper presents some algorithms that mitigate this problem by examining events waiting to be processed and removing those that cannot be part of a concurrent set View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balanced spanning trees in complete and incomplete star graphs

    Publication Year: 1996, Page(s):717 - 723
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Efficiently solving the personalized broadcast problem in an interconnection network typically relies on finding an appropriate spanning tree in the network. In this paper, we show how to construct in a complete star graph an asymptotically balanced spanning tree, and in an incomplete star graph a near-balanced spanning tree. In both cases, the tree is shown to have the minimum height. In the lite... 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