CONPAR 81 : Conference on Analysing Problem Classes and Programming for Parallel Computing, Nürnberg, June 10-12, 1981 : proceedings / edited by Wolfgang Händler
Programming and structure changes in parallel computers -- Tree machines and divide-and-conquer algorithms -- Queue machines: An organization for parallel computation -- Operating systems support for the finite element machine -- Automatic program restructuring for high-speed computation -- Language support for designing multilevel computer systems -- Parallel structures for vector processing -- Language design approaches for parallel processors -- Reconciling data flow machines and conventional languages -- On language constructs for concurrent programs -- Generation of dataflow graphical object code for the lapse programming language -- Cellular algorithms and their verification -- The development of fast cellular pattern transformation algorithms using virtual boundaries -- Cellular algorithms for binary matrix operations -- Analysis of concurrent algorithms -- Sauge: How to use the parallelism of sequential programs -- A transformational approach for developing parallel programs -- A methodology for programming with concurrency -- On synchronization and its specification -- "Non-numerical aspects of computations on parallel hardware" -- Compiling in parallel -- Finding the maximum, merging and sorting in a parallel computation model -- Parallel computations in information retrieval -- Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines -- Parallel algorithms for the convex hull problem in two dimensions -- On basic concepts in parallel numerical mathematics -- Iterative methods for the solution of elliptic difference equations on multiprocessors -- Hierarchical discrete systems and realisation of parallel algorithms -- Solving two modified discrete poisson equations in 7logn steps on N2 processors -- A parallel algorithm for solving band systems and matrix inversion -- Parallel evaluation of correlation time-of-flight experiments -- Parallelization of a minimization problem for multi-processor systems -- Design and development of concurrent programs -- Binary trees and parallel scheduling algorithms -- New variants of the quadrant interlocking factorisation (Q.I.F.) method
Bibliography
Includes bibliographical references
Notes
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
