By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Dec. 1999

Filter Results

Displaying Results 1 - 11 of 11
  • Author index

    Publication Year: 1999, Page(s):1333 - 1337
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • Subect index

    Publication Year: 1999, Page(s):1337 - 1344
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (575 KB)
    Freely Available from IEEE
  • A new self-routing multicast network

    Publication Year: 1999, Page(s):1299 - 1316
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    In this paper, we propose a design for a new self-routing multicast network which can realize arbitrary multicast assignments between its inputs and outputs without any blocking. The network design uses a recursive decomposition approach and is based on the binary radix sorting concept. All functional components of the network are reverse banyan networks. Specifically, the new multicast network is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic redistribution methods for block-cyclic decompositions

    Publication Year: 1999, Page(s):1201 - 1216
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3520 KB)

    This article presents various data redistribution methods for block-partitioned linear algebra algorithms operating on dense matrices that are distributed in a block-cyclic fashion. Because the algorithmic partitioning unit and the distribution blacking factor are most often chosen to be equal, severe alignment restrictions are induced on the operands, and optimal values with respect to performanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isomorphism of degree four Cayley graph and wrapped butterfly and their optimal permutation routing algorithm

    Publication Year: 1999, Page(s):1290 - 1298
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    In this paper, we first show that the degree four Cayley graph proposed in a paper appearing in the January 1996 issue of IEEE Transactions on Parallel and Distributed Systems is indeed isomorphic to the wrapped butterfly. The isomorphism was first reported by Muga and Wei in the proceedings of PDPTA '96. The isomorphism is shown by using an edge-preserving bijective mapping. Due to the isomorphis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal constructions for large objects

    Publication Year: 1999, Page(s):1317 - 1332
    Cited by:  Papers (12)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers to explicitly fragment large objects into smaller, more manageable pieces, paying particular attention to how s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for block-cyclic array redistribution between processor sets

    Publication Year: 1999, Page(s):1217 - 1240
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    Run-time array redistribution is necessary to enhance the performance of parallel programs on distributed memory supercomputers. In this paper, we present an efficient algorithm for array redistribution from cyclic(x) on P processors to cyclic(Kx) on Q processors. The algorithm reduces the overall time for communication by considering the data transfer, communication schedule, and index computatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel parsing algorithms for static dictionary compression

    Publication Year: 1999, Page(s):1241 - 1251
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    The data compression based on dictionary techniques works by replacing phrases in the input string with indexes into some dictionary. The dictionary can be static or dynamic. In static dictionary compression, the dictionary contains a predetermined fixed set of entries. In dynamic dictionary compression, the dictionary changes its entries during compression. We present parallel algorithms for two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-optimal gossip of large packets in noncombining 2D tori and meshes

    Publication Year: 1999, Page(s):1252 - 1261
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    The main results of this paper are algorithms for time-optimal gossip of large packets in noncombining full-duplex all-port 2-D tori and meshes of any size m×n. The gossip algorithms define the structure of broadcast trees and lock-step scheduling schemes for packets that make the broadcast trees time-are-disjoint. The gossip algorithm for tori is also buffer-optimal-it requires routers with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight bounds for prefetching and buffer management algorithms for parallel I/O systems

    Publication Year: 1999, Page(s):1262 - 1275
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The I/O performance of applications in multiple-disk systems can be improved by overlapping disk accesses. This requires the use of appropriate prefetching and buffer management algorithms that ensure the most useful blocks are accessed and retained in the buffer. In this paper, we answer several fundamental questions on prefetching and buffer management for distributed-buffer parallel I/O systems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcast-efficient protocols for mobile radio networks

    Publication Year: 1999, Page(s):1276 - 1289
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The main contribution of this work is to present elegant broadcast-efficient protocols for permutation routing, ranking, and sorting on single-hop Mobile Radio Networks with p stations and k radio channels, denoted by MRN(p,k). Clearly, any protocol performing these tasks on n items must perform n/k broadcast rounds because each item must be broadcast at least once. We begin ... 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