By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 2 • Date Feb. 2000

Filter Results

Displaying Results 1 - 7 of 7
  • The PROMPT real-time commit protocol

    Publication Year: 2000, Page(s):160 - 181
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (933 KB)

    We investigate the performance implications of providing transaction atomicity for firm-deadline real-time applications, operating on distributed data. Using a detailed simulation model, the real-time performance of a representative set of classical transaction commit protocols is evaluated. The experimental results show that data distribution has a significant influence on real-time performance a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tighter layouts of the cube-connected cycles

    Publication Year: 2000, Page(s):182 - 191
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    F.P. Preparata and J. Vuillemin (1981) proposed the cube-connected cycles (CCC) and its compact layout. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we “unfold” the cycles in the CCC, the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image processing on the OTIS-mesh optoelectronic computer

    Publication Year: 2000, Page(s):97 - 109
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    We develop algorithms for histogramming, histogram modification, Hough transform, and image shrinking and expanding on an OTIS-mesh optoelectronic computer. Our algorithm for the Hough transform is based upon a mesh algorithm for the Hough transform which is also developed in this paper. This new mesh algorithm improves upon the previous mesh Hough transform algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel construction of multidimensional binary search trees

    Publication Year: 2000, Page(s):136 - 148
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of spatial data. The data structure is useful in several applications including graph partitioning, hierarchical applications such as molecular dynamics and n-body simulations, and databases. In this paper, we study efficient parallel construction of k-d trees on coarse-grai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing

    Publication Year: 2000, Page(s):110 - 118
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bidirectional network containing n-nodes and m-links which uses O(m) messages and which can be completed in O(n) time. Using the ear decomposition, we obtain the following results for a distributed network: 1) The distributed ear decomposition algorithm can be used to test biconnectivity,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels

    Publication Year: 2000, Page(s):149 - 159
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The minimal routing problem in mesh-connected multicomputers with faulty blocks is studied. Two-dimensional meshes are used to illustrate the approach. A sufficient condition for minimal routing in 2D meshes with faulty blocks is proposed. Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based on the concept of an extended safety level, which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiler and run-time support for exploiting regularity within irregular applications

    Publication Year: 2000, Page(s):119 - 135
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4776 KB)

    This paper starts from a well-known idea, that structure in irregular problems improves sequential performance, and tries to show that the same structure can also be exploited for parallelization of irregular problems on a distributed-memory multicomputer. In particular, we extend a well-known parallelization technique called run-time compilation to use structure information that is explicit on th... 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