Proceedings of 8th International Parallel Processing Symposium

26-29 April 1994

Filter Results

Displaying Results 1 - 25 of 138
  • Proceedings of 8th International Parallel Processing Symposium

    Publication Year: 1994
    Request permission for commercial reuse | |PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Scalable techniques for computing band linear recurrences on massively parallel and vector supercomputers

    Publication Year: 1994, Page(s):502 - 508
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (628 KB)

    Presents a new scalable algorithm, called the `regular schedule', for parallel evaluation of band linear recurrences (BLRs), i.e. mth-order linear recurrences for m>1. Its scalability and simplicity make it well suited for vector supercomputers and massively parallel computers. We describe our implementation of the regular schedule on two types of machines: the Convex C240 and the MasPar MP-2. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting strings and constructing digital search trees in parallel

    Publication Year: 1994, Page(s):349 - 356
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (692 KB)

    We describe two simple optimal-work parallel algorithms for sorting a list L=(X1,X2,...,Xm) of m strings over an arbitrary alphabet Σ, where Σi=1m|Xi|=n. The first algorithm is a deterministic algorithm that runs in O((log2 m)/(log log m)) time and the second is a randomized algorithm that runs in O(log m) tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy communication for guided loop scheduling in multicomputers

    Publication Year: 1994, Page(s):439 - 443
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (344 KB)

    We propose the use of guided loop scheduling and fuzzy communications to map shared-variable communications into message passing operations among multicomputers. The mapping mechanism converts scalar message passing operations into multiple broadcast or multiple multicast operations. The proposed method is evaluated by both simulation experiments and theoretical analysis. The performance results, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HyperC: portable parallel programming in C

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

    We introduce the HyperC language, a data parallel extension of C intended for portability over a wide range of architectures. We present the main topics of the language: the explicit parallelism through the data, the synchronous semantics and the parallel flow control that allows asynchronous execution, new function qualifiers to emphasize locality properties code and, finally, new communication t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A clustered reduced communication element by element preconditioned conjugate gradient algorithm for finite element computations

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

    The clustered element by element preconditioned conjugate gradient (EBE-PCG) method can be effectively used to solve problems with symmetric positive definite matrices such as those arising in ANTARES-3D, a metal forming finite element (FE) simulation package. Efficient parallelization of this application on distributed memory multiple instruction multiple data (MIMD) parallel computers require au... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low cost complexity of a general multicast network

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

    This paper presents a new multicasting network constructed with a bit-level cost complexity of O(N log N) and a bit-level time complexity of O(log 2 N) using comparators with bit-level O(1) time and cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-signif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel extended GCD algorithm

    Publication Year: 1994, Page(s):357 - 361
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (304 KB)

    The extended GCD algorithm is very useful for data dependence tests, for example, the Power Test on supercomputers. We parallelize the extended GCD algorithm on a CREW SM MIMD computer with O(n) processors. We improve the sequential extended GCD algorithm and parallelize the extended GCD algorithm by two methods. We parallelize to triangularize the matrix by reducing elements in the same column si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of heuristics for scheduling DAGs on multiprocessors

    Publication Year: 1994, Page(s):446 - 451
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (436 KB)

    Many algorithms to schedule directed acyclic graphs (DAGs) on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multiprocessor scheduling is an NP-hard problem, no exact tractable algorithm exists, and no baseline is available from which to compare the resulting schedules. This paper is an attempt to quantify the differences in a few of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel routing of VLSI circuits based on net independency

    Publication Year: 1994, Page(s):949 - 953
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (352 KB)

    During the layout synthesis of integrated circuits, a major part of the time is spent with routing the interconnections of the chip's cells. Even for the most simple optimization criteria, this problem is np-complete, making the use of heuristics necessary. But even when using heuristics, the time required by the routing phase is very high. In the past, several approaches have been proposed to spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic routing and sorting on rings

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

    We present deterministic algorithms for k-k routing and k-k sorting on circular processor arrays with bidirectional connections. We distinguish between cases where k<4, 4⩽k<n2, and k⩾n2. Standing results are considerably improved; for most problem instances, near-optimality is achieved. A very simple algorithm has good performance for dynamic routing problems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable MIMD volume rendering algorithm

    Publication Year: 1994, Page(s):916 - 920
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (440 KB)

    Volume rendering is a compute intensive graphics algorithm with wide application. Researchers have sought to speed it up using parallel computers. The algorithm distributes the data for storage efficiency, avoids bottlenecks, and scales to more processors than rays. The main contribution is explicit partitioning of the input volume for higher memory utilization, while retaining viewpoint freedom a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IVHS traffic modeling using parallel computing: performance results

    Publication Year: 1994, Page(s):688 - 693
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (392 KB)

    The THOREAU simulation of vehicular traffic on city streets and freeways, developed by MITRE Corporation, has been adapted to run in parallel on a network of Unix workstations connected by ethernet. Tenfold and larger speedups were many as 40 parallel threads on 34 processors. The performance curves show little sign of leveling off with higher degrees of parallelism, which may mean that further ga... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel algorithms for solution of the Schrodinger equation

    Publication Year: 1994, Page(s):517 - 523
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (480 KB)

    Time-parallel algorithms for solution of the Schrodinger equation are developed. By using the Crank-Nicolson method, it is shown that the solution of the problem can be fully parallelized in time, leading to a massive temporal parallelism in the computation with a minimum of communication and synchronization requirements. Our results clearly indicate that the Crank-Nicolson method, in addition to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelization of linearized applications in Fortran D

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

    Fortran D extends Fortran to parallel computers via specification of the distribution of array variables across processors. When multidimensional arrays have been linearized for optimal performance on vector processors, Fortran D cannot produce the best parallelization because it is limited to one-dimensional distribution, which is less efficient due to surface-to-volume effects. We propose Fortra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PARAM parallel supercomputer: architecture, programming environment, and applications

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

    Recognising parallel processing as a leap-frog path for supercomputing as well as the destiny of future generation supercomputers, C-DAC was launched by the Government of India as a national initiative with a first 3-year mission of designing, and bringing into commercial a state-of-the-art parallel supercomputer with peak performance exceeding 1 GFLOPS, proportionate primary and secondary storage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic optimization of speedup and benefit/cost for parallel database scans on shared-memory multiprocessors

    Publication Year: 1994, Page(s):894 - 901
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (612 KB)

    Previous work on parallel database systems has paid little attention to the interaction of asynchronous disk prefetching and processor parallelism. The authors investigate this issue for scan operations on shared-memory multiprocessors. Two heuristic methods are developed for the allocation of processors and memory to optimize either the speedup or the benefit/cost ratio of database scan operation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized ring interconnection networks

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

    We propose a new interconnection network for multicomputers called generalized ring network (GRN). A GRN is a combination of two important networks-the ring and the complete network. It has excellent properties for fault tolerance and can be built for any even value of connectivity. We describe various properties of GRNs, and present routing and broadcast schemes. We also describe the embedding of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel algorithms for tree-related problems using the parentheses matching strategy

    Publication Year: 1994, Page(s):362 - 367
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (616 KB)

    Although several strategies have been developed for designing efficient parallel algorithms, there is still a need for new strategies so that efficient or simple solutions can be obtained for broader classes of problems. We establish a new design strategy, called parallel parentheses matching (PPM), by solving a number of problems related to trees. With this strategy, a given problem is first conv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of control parameters on dynamic load balancing

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

    This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model is parameterized to represent the random and redistribution algorithms. A parallel N-body simulation example is used to validate the model. The model and associated performance measures are used to evaluate various load balancing algorithms and derive optimal algorithms and alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The right stuff? Teaching parallel computing

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

    We consider the educational process with respect to parallel computing. Education in this area is provided by national supercomputing centers, a variety of manufacturers of parallel machines, within companies that use parallel machines, as well as by colleges and universities for both undergraduate and graduate students. The panel evaluates the current system, and debate potential (realistic) impr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and sorting on meshes with row and column buses

    Publication Year: 1994, Page(s):411 - 417
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (748 KB)

    Gives improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n+o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2-1/r)n+o(n) and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic space warping algorithms on fine-grain array processors

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

    We present a new mapping strategy of the dynamic space warping algorithm (DSWA) onto a micro-grained array processor (MGAP). This new mapping strategy reduces the communication complexity between processing elements and increases the performance due to data pipelining and interleaving. The DSWA, which can be applied to image recognition, originally needs a four-dimensional array. Practically howev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel benchmarks on the Transtech Paramid

    Publication Year: 1994, Page(s):694 - 699
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (372 KB)

    This paper presents the results of running the some benchmarks from the Genesis suite on the Transtech Paramid. The benchmarks use the PARMACS parallel processing standard, and are based on applications in the fields of general relativity, molecular dynamics and QCD. The Paramid is a distributed memory parallel computer, using up to 64 Intel i860-XP processors. The results demonstrate good paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for computing polygon set operations

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

    We present a parallel algorithm for performing Boolean set operations on generalized polygons that have holes in them. The intersection algorithm has a processor complexity of O(m2n 2) processors and a time complexity of O(max(2logm, log2 n)), where m is the maximum number of vertices in any loop of a polygon, and n is the maximum number of loops per polygon. The u... View full abstract»

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