UID:
almahu_9948621489302882
Format:
XVII, 853 p.
,
online resource.
Edition:
1st ed. 1992.
ISBN:
9783540473060
Series Statement:
Lecture Notes in Computer Science, 634
Content:
This volume presents the proceedings of the joint meeting CONPAR 92 - VAPP V, held in Lyon, France, September 1992. The international Conferences on Parallel Processing (CONPAR) and the meetings on Vector and Parallel Processors in computational science (VAPP) have been held jointly since CONPAR 90 - VAPP IV, held in Zurich. The aim of the meeting presented in this volume is to review hardware and architecture developmentstogether with languages and software tools for supporting parallel processing and to highlight advances in models, algorithms, andapplications software on vector and parallel architectures. The papers in the volume are organized into sections on networks, software tools, distributed algorithms, dedicated architectures, numerical applications, systolic algorithms, parallel linear algebra, architectures, shared virtual memory, load balancing, data parallelism, parallel algorithms, image processing, compiling and scheduling, simulation and performance analysis, parallel artificialintelligence, dataflow architectures, parallel programming, and poster presentations.
Note:
Tolerating faults in synchronization networks -- On incomplete hypercubes -- Reducing network hardware quantity by employing multi-processor cluster structure in distributed memory parallel processors -- Connection Machine results for pyramid embedding algorithms -- Interconnection networks based on block designs -- Partitioning and mapping communication graphs on a modular reconfigurable parallel architecture -- Generalized shuffle-exchange networks -- Execution replay: A mechanism for integrating a visualization tool with a symbolic debugger -- The software-monitor DELTA-T and its use for performance measurements of some farming variants on the multi-transputer system DAMP -- Visualization of message passing parallel programs -- Parallel physical optimization algorithms for data mapping -- Profiling on a massively parallel computer -- A multiprocessor multiwindow visualization subsystem -- Data race detection based on execution replay for parallel applications -- The C_NET programming environment: An overview -- P++, a C++ virtual shared grids based programming environment for architecture-independent development of structured grid applications -- Detection of concurrency-related errors in Joyce -- Analysis of an efficient distributed algorithm for mutual exclusion (average-case analysis of path reversal) -- Invariance properties in distributed systems -- Synchronization of parallel processes in distributed systems -- Statistical probabilistic clock synchronization algorithm -- A SIMD architecture for medical imaging -- Computing the inner product on reconfigurable buses with shift switching -- A novel sorting array processor -- The time-parallel solution of parabolic partial differential equations using the frequency-filtering method -- The combination technique for parallel sparse-grid-preconditioning or -solution of PDE's on workstation networks -- Comparing the DAP, meiko and suprenum with a fluid dynamic benchmark -- Parallel detection algorithm of radar signals -- Efficient linear systolic array for the knapsack problem -- On the loading, recovery and access of stationary data in systolic arrays -- Designing modular linear systolic arrays using dependence graph regular partitions -- Reducing symmetric banded matrices to tridiagonal form - A comparison of a new parallel algorithm with two serial algorithms on the iPSC/860 -- An implementation of the BLAS on the i860: A RISC approach to software for RISC devices -- Partitioning and mapping for parallel nested dissection on distributed memory architectures -- On the accuracy of solving triangular systems in parallel-III -- Linear algebra calculations on the BBN TC2000 -- Parallel homotopy algorithm for large sparse generalized eigenvalue problems: Application to hydrodynamic stability analysis -- Parallel algorithms for solving linear recurrence systems -- A new parallel factorization A = DD tBC for band symmetric positive definite matrices -- Computation of the eigenvalues of real symmetric matrices using a processor farm -- Numerical performance of an asynchronous Jacobi iteration -- Matrix inversion algorithm for linear array processor -- Massively parallel preconditioners for the sparse conjugate gradient method -- A block algorithm for orthogonalization in elliptic norms -- Asynchronous polycyclic architecture -- A comparison of two memory models for high performance computers -- A decoupled multicomputer architecture with optical full interconnection -- Very high speed vectorial processors using serial multiport memory as data memory -- Resource management on a packet-based parallel graph reduction machine -- A large context multithreaded architecture -- On the practical efficiency of Randomized Shared Memory -- KOAN: A Shared Virtual Memory for the iPSC/2 hypercube -- A scalable distributed shared memory -- Cost prediction for load-balancing: Application to algebraic computations -- Envelopes in adaptive local queues for MIMD load balancing -- Dynamo - A portable tool for dynamic load balancing on distributed memory multicomputers -- Semantics and compilation of the data-parallel switch statement -- ?-Project/first step: To improve data manipulations and representations on parallel computers -- F-Code: A portable software platform for data-parallel languages -- A parallel best-first B & B with synchronization phases -- On tests of uniform tree circuits -- Improved parallel sorting of presorted sequences -- MIMD dictionary machines: From theory to practice -- Parallel searching for 3D-objects -- Parallel Gcd and lattice basis reduction -- Parallel minimum spanning forest algorithms on the star and pancake interconnection networks -- Parallel algorithms for the distance transformation -- A multiprocessor system for displaying quadric CSG models -- Efficient image computations on reconfigurable meshes (preliminary version) -- A multiscale parallel thinning algorithm -- Static scheduling of parallel programs for message passing architectures -- A polynomial time method for optimal software pipelining -- Scheduling loops on parallel processors: A simple algorithm with close to optimum performance -- Automatic parallelization of grid-based applications for the iPSC/860 -- Semantic analysis for parallelizing C -- A task scheduling algorithm for the parallel expression evaluation in a reconfigurable fully digit on-line network -- Unimodularity considered non-essential (extended abstract) -- PEPSIM-ST: A simulator tool for benchmarking -- Performance modeling of sparse matrix methods for distributed memory architectures -- ParSim: A tool for the analysis of parallel and distributed programs -- Estimating the effective performance of program parallelization on shared memory MIMD multiprocessors -- On the simulation of pipelining of fully digit on-line floating-point adder networks on massively parallel computers -- A parallel expert system using a backward chaining strategy -- Optimal speedup conditions for a parallel back-propagation algorithm -- A time-bounded binding access with low task-switching cost in an OR-parallel prolog -- Threads and subinstruction level parallelism in a data flow architecture -- A hybrid dataflow architecture with multiple tokens -- Parallelism control scheme in a dataflow architecture -- A Petri-Net-based method to the design of parallel programs for a multiprocessor system -- A parallel structure for static iterative transformation algorithms -- The construction of numerical mathematical software for the AMT DAP by program transformation -- On using object oriented parallel programming to build distributed algebraic abstractions -- Implementation of the self-organizing feature map on parallel computers -- Candela - A topology description language -- Parallelism in generation of sequences for Monte Carlo simulation -- Data parallel evaluation-interpolation algorithm for solving functional matrix equations -- Dynamic tree embeddings into de Bruijn graphs -- Memory access in shared virtual memory -- Parallel implementations of Jacobi's algorithm for the eigensolution of large matrices using array processors -- A parallel architecture for a VLSI-hardware-realization of a numerical stable variant of the Simplex-Method -- Generating physical channel access protocol data unit of CCSDS recommendation by use of the transputers and OCCAM -- Manifold: Concepts and implementation -- How to compile systems of recurrence equations into networks of communicating processes -- Parallel algorithms simulation applied to differential - Algebraic systems, and electrical network application -- Optimal performances and scheduling for parallel algorithms with equal cost tasks -- Load balancing in a neighbourhood-based multiprocessor -- A DAP-based implementation of a portable parallel image processing machine -- The design of a parallel algorithm to solve the word problem for free partially commutative groups -- A VLSI multigrid poisson solver amenable to biharmonic equation -- Monochrome i
,
processor arrays -- Automatic mapping of parallel programs onto processor networks -- Dynamic allocation on the transputer network -- Block implementations of the symmetric QR and Jacobi algorithms -- An improved parallel algorithm for the solution of molecular dynamics problems on MIMD multiprocessors -- Computational models for image processing: Towards a concise parallel language -- Broadcasting in faulty Cube-Connected-Cycles with minimum recovery time -- Parallel robot motion planning in a dynamic environment -- A hypergraph-based interconnection network for large multicomputers -- Greedy permutation routing on Cayley graphs -- Experimenting upon the CG algorithm within the C_NET programming environment -- An algorithm of broadcasting in the mesh of trees -- Complexity estimation in the pips parallel programming environment -- A graphical Petri net based editor for a visualization of distributed and parallel systems -- Automatic parallelization of divide- and-conquer algorithms.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783540558958
Additional Edition:
Printed edition: ISBN 9783662165935
Language:
English
DOI:
10.1007/3-540-55895-0
URL:
https://doi.org/10.1007/3-540-55895-0
Bookmarklink
