By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec. 1998

Filter Results

Displaying Results 1 - 10 of 10
  • 1998 Index IEEE Transactions on Parallel And Distributed Systems - Author Index

    Publication Year: 1998, Page(s):1269 - 1273
    Request permission for commercial reuse | PDF file iconPDF (116 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 1998, Page(s):1273 - 1280
    Request permission for commercial reuse | PDF file iconPDF (801 KB)
    Freely Available from IEEE
  • An O((log log n)2) time algorithm to compute the convex hull of sorted points on reconfigurable meshes

    Publication Year: 1998, Page(s):1167 - 1179
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The problem of computing the convex hull of a set of n sorted points in the plane is one of the fundamental tasks in image processing, pattern recognition, cellular network design, and robotics, among many others. Somewhat surprisingly, in spite of a great deal of effort, the best previously known algorithm to solve this problem on a reconfigurable mesh of size √n×√n was running ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal parallel algorithms for finding proximate points, with applications

    Publication Year: 1998, Page(s):1153 - 1166
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Consider a set P of points in the plane sorted by the x-coordinate. A point p in P is said to be a proximate point if there exists a point q on the x-axis such that p is the closest point to q over all points in P. The proximate point problem is to determine all the proximate points in P. Our main contribution is to propose optimal parallel algorithms for solving instances of size n of the proxima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On coordinated checkpointing in distributed systems

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

    Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers from high overhead associated with the checkpointing process. Two approaches are used to reduce the overhead: first is to minimize the number of synchronization messages and the number of checkpoints, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic-cubes: a new family of interconnection networks of even fixed-degrees

    Publication Year: 1998, Page(s):1253 - 1268
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to four. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear and symbolic data dependence testing

    Publication Year: 1998, Page(s):1180 - 1194
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    One of the most crucial qualities of an optimizing compiler is its ability to detect when different data references access the same storage location. Such references are said to be data-dependent and they impose constraints on the amount of program modifications the compiler can apply for improving the program's performance. For parallelizing compilers, the most important program constructs to inv... View full abstract»

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

    Publication Year: 1998, Page(s):1226 - 1236
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    In this paper, we develop algorithms for some basic operations-broadcast, window broadcast, prefix sum, data sum, rank, shift, data accumulation, consecutive sum, adjacent sum, concentrate, distribute, generalize, sorting, random access read and write-on the OTIS-Mesh model. These operations are useful in the development of efficient algorithms for numerous applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multistep interactive convergence: an efficient approach to the fault-tolerant clock synchronization of large multicomputers

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

    We present a new approach for fault-tolerant internal clock synchronization in multicomputer systems employing not completely connected networks (NCCNs). The approach is referred to as multistep interactive convergence and is locally implemented in each multicomputer node by a time server process (TSP). We describe a specific algorithm that uses multistep interactive convergence and bases its oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for high availability of a distributed-parallel storage system

    Publication Year: 1998, Page(s):1237 - 1252
    Cited by:  Papers (16)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    We have developed a distributed parallel storage system that employs the aggregate bandwidth of multiple data servers connected by a high-speed wide-area network to achieve scalability and high data throughput. This paper studies different schemes to enhance the reliability and availability of such network-based distributed storage systems. The general approach of this paper employs “erasure... 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