By Topic

Parallel Processing, 1993. ICPP 1993. International Conference on

Date 16-20 Aug. 1993

Go

Filter Results

Displaying Results 1 - 25 of 59
  • 1993 International Conference on Parallel Processing - Cover

    Publication Year: 1993, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • 1993 International Conference on Parallel Processing - Title

    Publication Year: 1993, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • 1993 International Conference on Parallel Processing - Copyright

    Publication Year: 1993, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • 1993 International Conference on Parallel Processing - Table of contents

    Publication Year: 1993, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (644 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 1993, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • List of referees

    Publication Year: 1993, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (507 KB)
    Freely Available from IEEE
  • Space-Time Representation of Iterative Algorithms and the Design of Regular Processor Arrays

    Publication Year: 1993, Page(s):2 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB)

    A novel space-time representation of iterative algorithms, which can be expressed in nested loop form and may include non-constant dependencies is proposed and a systematic methodology for their mapping onto regular processor arrays is presented. In contrast to previous design methodologies, the execution time of any variable instance is explicitly expressed in the Dependence Graph, by the constru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Parallel Diagonal Dominant Algorithm

    Publication Year: 1993, Page(s):10 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (939 KB)

    The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors

    Publication Year: 1993, Page(s):18 - 22
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (345 KB)

    The concept of supernodes has been widely used in the design of algorithms for the solution of sparse linear systems of equations. This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors. A new algorithm that is communication efficient, has good load balance, and benefits significantly from supernodes is present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors

    Publication Year: 1993, Page(s):23 - 27
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB)

    Shared memory multiprocessors with cache require careful consideration of cache parameters while implementing an algorithm to obtain optimal performance. In this paper, we study the implementation of some existing FFT algorithms and analyze the number of cache misses based on the problem size, number of processors, cache size, and block size. We also propose a new FFT algorithm which minimizes the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of Hashing on Parallel and Vector Computers

    Publication Year: 1993, Page(s):29 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Parallel hashing is well-known in the folklore of parallel computing, but there has been a remarkable dearth of literature describing it in detail. Because many parallel algorithms such as histogramming, set intersection and dictionary lookup can make use of hashing as a core step, hashing is a fundamental parallel operation. This paper sheds light on the performance that may be achieved using par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Quadratic Forms: A Case Study in the Design of Scalable Algorithms

    Publication Year: 1993, Page(s):37 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1192 KB)

    Parallel implementations of the computationally intensive task of solving multiple quadratic forms (MQFs) have been examined. Coupled and uncoupled parallel methods are investigated, where coupling relates to the degree of interaction among the processors. Also, the impact of partitioning a large MQF problem into smaller non-interacting subtasks is studied. Trade-offs among the implementations fo ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-Parallel R-Tree Algorithms

    Publication Year: 1993, Page(s):47 - 50
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB)

    Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data (e.g., Bureau of the Census TIGER/Line files). Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM (Scan-And-Monotonic-mapping) model of parallel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Parallel Algorithms for Solution of Linear Parabolic PDEs

    Publication Year: 1993, Page(s):51 - 56
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB)

    In this paper, fast time- and space-parallel algorithms for solution of parabolic PDEs are developed. It is shown that the seemingly strictly serial time-stepping procedures for solution of problem can be completely decoupled. This is achieved by developing time-parallel algorithms which allow the solution for all time steps to be computed in parallel. The time-parallel algorithms have a highly de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing Connected Components and Some Related Applications on a Rap

    Publication Year: 1993, Page(s):57 - 64
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB)

    A reconfigurable array of processors (RAP) is a parallel processing system which has the ability to change dynamically the supported interconnection scheme during the execution of an algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding Grids, Hypercubes, and Trees in Arrangement Graphs

    Publication Year: 1993, Page(s):65 - 72
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1383 KB)

    The use of a new topology, called the arrangement graph, as a viable interconnection scheme for parallel and distributed systems, has been recently proposed and examined. The arrangement graphs represent a rich class of generalized star graphs with many attractive properties, In this paper we obtain (1) unit expansion embeddings of a variety of multi-dimensional grids, (2) dilation 1, 2, 3, and 4 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Embeddings of Rectangles into Optimal Squares

    Publication Year: 1993, Page(s):73 - 76
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Let G = h x w be a rectangular grid and H = s x s be the optimal sqaure grid for G, i.e., the least square grid which is no less than G in size. In this paper, an embedding scheme is presented for embedding G into H such that the dilation cost is at most 6. The significance of this result is that optimal expansion is always achieved, regardless of the aspect ratio of the rectangle, while keeping t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Articulation Points and Bridges of Permutation Graphs

    Publication Year: 1993, Page(s):77 - 81
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB)

    We show that articulation points and bridges of permutation graphs can be found in O(logn) time using O(n/logn) processors on an EREW PRAM. The algorithms are optimal with respect to the time-processor product. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Recognition Using Fractals

    Publication Year: 1993, Page(s):82 - 89
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2013 KB)

    We present a novel algorithm for the automatic recognition and classification of fractally-encoded images. The algorithm can recognise images from a fractal transformation library in the presence of scaling, displacement and rotation and is robust in the presence of noise. The algorithm forms the basis for a more general recognition mechanism if non-fractal images are encoded as fractal pictures u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Image Processing Algorithms on the Scan Line Array Processor

    Publication Year: 1993, Page(s):90 - 93
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB)

    We develop efficient algorithms for low and intermediate level image processing on the scan line array processor that handles images in a scan line fashion. For low level processing, we present algorithms for block DFT, block DCT, convolution, template matching, shrinking, and expanding. These algorithms run in real-time - that is, the output lines are generated at the rate of O(m) time per line, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

    Publication Year: 1993, Page(s):94 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB)

    In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • O(n)-Time and O(log n)-Space Image Component Labeling with Local Operations on SIMD Mesh Connected Computers

    Publication Year: 1993, Page(s):98 - 101
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented, providing a positive answer to the open question posed by several researchers whether there exists an O(n)-time and O(log n)-space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack-like data structures to achieve the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving the Region Growing Problem on the Connection Machine

    Publication Year: 1993, Page(s):102 - 105
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB)

    This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the CM-5 in the data parallel and message passing models. The performance of these implementations is examined and compared. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization

    Publication Year: 1993, Page(s):107 - 114
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    It is well known that a judicious choice of ordering has great impact on the sparse matrix factorization. Many proposed reordering algorithms attempt to minimize the corresponding elimination tree height, which is, however, not an accurate indication of the actual parallel factorization time. We will illustrate the appalling discrepancy with a contrived example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalability of Parallel Algorithms for Matrix Multiplication

    Publication Year: 1993, Page(s):115 - 123
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near linear speedup for sufficiently large matrix sizes and none of the algorithms can be clearly claimed to be superior than the others. In this paper we analyze the performance and scalability of a number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.