By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 10 • Date Oct. 2003

Filter Results

Displaying Results 1 - 8 of 8
  • MVSS: an active storage architecture

    Publication Year: 2003, Page(s):993 - 1005
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB) | HTML iconHTML

    This paper presents MVSS, a storage system for active storage devices MVSS offers a single framework for supporting various services at the device level. It provides a flexible interface for associating services to a file through multiple views of the file Similar to views of a database in a multiview database system, views in MVSS are generated dynamically and are not stored on physical storage d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and scalable selection algorithms with applications to median filtering

    Publication Year: 2003, Page(s):983 - 992
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (745 KB) | HTML iconHTML

    The main contributions of this paper are in designing fast and scalable parallel algorithms for selection and median filtering. Based on the radix-ω representation of data and the prune-and-search approach, we first design a fast and scalable selection algorithm on the arrays with reconfigurable optical buses (AROB). To the authors' knowledge, this is the most time efficient algorithm yet pu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model

    Publication Year: 2003, Page(s):973 - 982
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (709 KB) | HTML iconHTML

    We develop a parallel algorithm for the 2D Euclidean distance transform (2D_EDT, for short) of a binary image of size N × N in O(1) time using N2+δ+ε CRCW processors and a parallel algorithm for the 3D Euclidean distance transform (3D_EDT, for short) of a binary image of size N × N × N in O(1) time using N3+δ+ε CRCW processors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Out-of-core divisible load processing

    Publication Year: 2003, Page(s):1048 - 1056
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (989 KB) | HTML iconHTML

    In this paper, we analyze processing divisible loads in systems with a memory hierarchy. Divisible loads are computations that can be divided into parts of arbitrary sizes and these parts can be independently processed in a distributed system. The problem is to partition the load so that the total processing time, including communications and computations, is the shortest possible. Earlier works i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed algorithm for detection of knots and cycles in a distributed graph

    Publication Year: 2003, Page(s):961 - 972
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB) | HTML iconHTML

    Knot detection in a distributed graph is an important problem and finds applications in deadlock detection in several areas such as store-and-forward networks, distributed simulation, and distributed database systems. This paper presents an efficient distributed algorithm to detect if a node is part of a knot in a distributed graph. The algorithm requires 2e messages and a delay of 2(d+1) message ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cost-effective implementation of multilevel tiling

    Publication Year: 2003, Page(s):1006 - 1020
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (707 KB) | HTML iconHTML

    This paper presents a new cost-effective algorithm to compute exact loop bounds when multilevel tiling is applied to a loop nest having affine functions as bounds (nonrectangular loop nest). Traditionally, exact loop bounds computation has not been performed because its complexity is doubly exponential on the number of loops in the multilevel tiled code and, therefore, for certain classes of loops... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient code generation technique for tiled iteration spaces

    Publication Year: 2003, Page(s):1021 - 1034
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB) | HTML iconHTML

    This paper presents a novel approach for the problem of generating tiled code for nested for-loops, transformed by a tiling transformation. Tiling or supernode transformation has been widely used to improve locality in multilevel memory hierarchies, as well as to efficiently execute loops onto parallel architectures. However, automatic code generation for tiled loops can be a very complex compiler... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localized Delaunay triangulation with application in ad hoc wireless networks

    Publication Year: 2003, Page(s):1035 - 1047
    Cited by:  Papers (95)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (938 KB) | HTML iconHTML

    Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RING) or Gabriel graph (GG) is used as such planar structure. However, it is well-known that the spanning ratios of these two graphs are not bounded by any constant (even for uniform randomly distributed points). Bose et al. (1999... 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