By Topic

Parallel Processing, 1994. ICPP 1994 Volume 3. International Conference on

Date 15-19 Aug. 1994

Filter Results

Displaying Results 1 - 25 of 67
  • 1994 International Conference on Parallel Processing - Cover

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

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

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • 1994 International Conference on Parallel Processing - Table of contents

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

    Publication Year: 1994, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 1994, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Keynote Speakers

    Publication Year: 1994, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Panel Sessions

    Publication Year: 1994, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Conference Awards

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

    Publication Year: 1994, Page(s):xx - xxii
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • A Memory-Constrained Scalability Metric

    Publication Year: 1994, Page(s):1 - 7
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A performance evaluation metric called CMP scalability is introduced This metric is useful in analyzing performance of a parallel algorithm as the number of processors grows but the memory size per processor is fixed. The CMP scalability metric is derived for the parallel Matrix Multiplication (MM). Gauss Jordan Elimination (GJE), and Fast Fourier Transform (FFT). These examples show that the CMP ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Speculative Computation of Simulated Annealing

    Publication Year: 1994, Page(s):8 - 11
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB)

    Simulated annealing is known to be highly sequential due to loop-carried dependencies. This report presents a new approach to parallel simulated annealing, called generalized speculative computation (GSC). We use an n-ary speculative tree and loop indices to execute n iterations in parallel on n processors while maintaining the same decision sequence as sequential simulated annealing. To verify th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speculative Computation: Overcoming Communication Delays

    Publication Year: 1994, Page(s):12 - 16
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB)

    Communication latencies and delays are a major source of performance degradation in parallel computing systems. It is important to "mask" these communication delays by overlapping them with useful computation in order to obtain good parallel performance. This article proposes speculative computation as a technique to mask communication latencies in synchronous iterative algorithms. Processors spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs

    Publication Year: 1994, Page(s):17 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (745 KB)

    Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the difficulty in predicting the response time of these rule-based systems. In this paper, we tackle this problem with a fast, partially parallelizable response time a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Recursive Computations where Both Recombination and Partition Overheads are Problem-Dependent

    Publication Year: 1994, Page(s):21 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Parallel recursive computations incorporating the unavoidable and significant parallel computing overheads, encompassing a wide variety of applications, can be modeled as T(n) = left{ {mathop {min }limits_{0 le r le n}^{t_{(),} } } right.left{ {max left{ {T(n - r),T(r) + k(r)} right} + mathop {mathop {lambda (n,r)}limits_{otherwise} }limits^{forn le n_{(),} } } right} where k(r) and X(n,r) represe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Parallel Algorithm for Vector Quantizer Design

    Publication Year: 1994, Page(s):25 - 30
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (562 KB)

    Vector quantization is a technique used extensively and successfully to compress digitized data such as speech and images. The design of a vector quantizer is very computationally intensive. Parallel algorithms based on various architectures have been proposed for related applications in clustering. These algorithms are in general not practical for the vector quantization problem because of the ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Component Labeling on SIMD Mesh Processors

    Publication Year: 1994, Page(s):31 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (479 KB)

    A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(frac{{n^2 }} {{p^2 }} + n) for an n ?? n image on a p ?? p mesh. The algorithm is efficient in terms of total work for p leqslant n^{frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K ?? 1K size test inputs, our algorithm is faster than a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting

    Publication Year: 1994, Page(s):35 - 38
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB)

    Consider arbitrary collections A = a_1,a_2,.. .,a_n of items and Q = q_1,q_2,...,q_m (1 leqslant mn leqslant n) of queries from a totally ordered universe. The multiple rank problem involves computing for every query qi the number of items in A that have a lesser value. Our contribution is to show that the problem at hand can be solved time-optimally on meshes with multiple broadcasting. More spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Parallel Computation of Projections for Animated Volume Visualization

    Publication Year: 1994, Page(s):39 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB)

    In this paper, we parallelize a new efficient approximate projection algorithm for volume rendering. The algorithm is unique in that it computes N different views simultaneously, much faster than these projections could be computed independently. It is thus ideal for computing animated sequences of views. We implement and evaluate the algorithm on a MasPar MP-1. We render a 128x128x128 data set at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Contextual Knowledge to Improve Parallel Spoken Language Understanding

    Publication Year: 1994, Page(s):43 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (453 KB)

    This paper presents a parallel approach for utilizing contextual knowledge to improve spoken language understanding. The method emphasizes a hierarchically-structured knowledge base and a memory-based parsing technique. Within this paradigm, several levels of knowledge sources including contextual knowledge arc efficiently combined. An ambiguity resolution scheme utilizing the preceding discourse ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Algorithms for the Two-Dimensional Discrete Wavelet Transform

    Publication Year: 1994, Page(s):47 - 54
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    We present in this paper two parallel algorithms for the two-dimensional discrete wavelet transform. A mathematical model for the computation vs. communication tradeoff for these algorithms is presented and the scalability of the algorithms is analyzed. The wormhole routing model was used to model the communication costs involved. The algorithms were implemented on the Connection Machine-5 (CM-5^{... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Algorithm for an Inverse Problem Associated with a Hyperbolic System of Partial Differential Equations

    Publication Year: 1994, Page(s):55 - 63
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (985 KB)

    Parallel computing was applied to the solution of an inverse problem arising from a hyperbolic system of two coupled linear first-order partial differential equations. A known sequential algorithm based on the method of invariant imbedding was parallelized by a mapping assigning processors to characteristics. Two implementations of an algorithm based on this mapping and suitable for a message-pass... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical Issues of 2-D Parallel Finite Element Analysis

    Publication Year: 1994, Page(s):64 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (587 KB)

    The use of parallel processors has made it possible to execute large scale applications such as finite element analysis. Generally, the speedup is limited by the interprocessor communication used by message-passing multicomputers. The major question addressed by users of message-passing machines is the identification, of the most efficient type of communication scheme for the. particular applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation of Systolic Programs

    Publication Year: 1994, Page(s):69 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (638 KB)

    We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how efficient transformations/implementations of programs for different systolic architectures can be obtained throu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedy Task Migration in Hypercube Systems

    Publication Year: 1994, Page(s):74 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    This article considers speedy task migration in that two disjoint paths are created between every pair of corresponding nodes for delivering migrated information simultaneously, reducing the size of data transmitted over a path and thus the migration time. All migration paths selected are pairwise disjoint and contain no link of active subcubes, so that task migration can be performed quickly and ... View full abstract»

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