By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • Jul 1998

Filter Results

Displaying Results 1 - 8 of 8
  • Interprocedural partial redundancy elimination with application to distributed memory compilation

    Publication Year: 1998, Page(s):609 - 625
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redundant code elimination. In this paper, we address the problem of performing this optimization interprocedurally. We present an Interprocedural Partial Redundancy Elimination (IPRE) scheme based upon a new, concise, full pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding torus on the star graph

    Publication Year: 1998, Page(s):650 - 663
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion is bound by a small constant (≈2) with an increase in expansion cost. For a second routing scheme, the congestion is O(n), for an n-star, with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault diagnosis in a Benes interconnection network

    Publication Year: 1998, Page(s):700 - 703
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Benes network, being a back-to-back connection of two Baseline networks, the method for fault diagnosis for the class of nonredundant networks, as elucidated in our previous work, can be directly mapped on the two nonredundant networks. The individual results from these two networks can be combined to construct a comprehensive algorithm for the Benes network to diagnose single fault View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling algorithms for parallel Gaussian elimination with communication costs

    Publication Year: 1998, Page(s):679 - 686
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    We consider a graph theoretical model and study a parallel implementation of the well-known Gaussian elimination method on parallel distributed memory architectures, where the communication delay for the transmission of an elementary data is higher than the computation time of an elementary instruction. We propose and analyze two low-complexity algorithms for scheduling the tasks of the parallel G... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general theory for deadlock avoidance in wormhole-routed networks

    Publication Year: 1998, Page(s):626 - 638
    Cited by:  Papers (42)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Most machines of the last generation of distributed memory parallel computers possess specific routers which are used to exchange messages between nonneighboring nodes in the network. Among the several technologies, wormhole routing is usually preferred because it allows low channel-setup time and reduces the dependency between latency and internode distance. However, wormhole routing is very susc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory for total exchange in multidimensional interconnection networks

    Publication Year: 1998, Page(s):639 - 649
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Total exchange (or multiscattering) is one of the important collective communication problems in multiprocessor interconnection networks. It involves the dissemination of distinct messages from every node to every other node. We present a novel theory for solving the problem in any multidimensional (cartesian product) network. These networks have been adopted as cost-effective interconnection stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for relational coarsest partition problems

    Publication Year: 1998, Page(s):687 - 699
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP in which its associated label transition system is assumed to have m transitions and n states. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A priority-driven flow control mechanism for real-time traffic in multiprocessor networks

    Publication Year: 1998, Page(s):664 - 678
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    Real-time applications when mapped to distributed memory multiprocessors produce periodic messages with an associated deadline and priority. Real-time messages may be hard or soft deadline. Real-time extensions to wormhole routing (WR) with multiple virtual channels (VCs) and priority-based physical link arbitration and VC allocation have been proposed in the literature. With a fixed number of VCs... 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