Parallel Computing, Volume 3

Volume 3, Number 1, March 1986

• James C. Browne:
  Framework for formulation and analysis of parallel computation structures. 1-9
  
• Selim G. Akl, Hartmut Schmeck:
  Systolic sorting in a sequential input/output environment. 11-17
  
• Jack Dongarra, Ahmed H. Sameh, Danny C. Sorensen:
  Implementation of some concurrent algorithms for matrix factorization. 25-34
  
• Henk A. van der Vorst:
  The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers. 49-58
  
• Owe Axelsson, Victor Eijkhout:
  A note on the vectorization of scalar recursions. 73-83
  
• David J. Evans, Nadia Y. Yousif:
  The parallel neighbour sort and 2-way merge algorithm. 85-90
  

Volume 3, Number 2, May 1986

• Harry F. Jordan:
  Structuring parallel algorithms in an MIMD, shared memory environment. 93-110
  
• Robert Hiromoto:
  Some issues in parallel processing as encountered on the Denelcor HEP. 111-127
  
• Timothy S. Axelrod:
  Effects of synchronization barriers on multiprocessor performance. 129-140
  
• Michael Goldapp:
  Fast scan-line conversion using vectorisation. 141-152
  
• Daniel Boley:
  Solving the generalized eigenvalue problem on a synchronous linear processor array. 153-166
  
• Andy Brass, G. Stuart Pawley:
  Two and three dimensional FFTs on highly parallel computers. 167-184
  

Volume 3, Number 3, July 1986

• Bill Buzbee:
  A strategy for vectorization. 187-192
  
• Iain S. Duff:
  Parallel implementation of multifrontal schemes. 193-204
  
• Ullrich Meier:
  Two parallel SOR variants of the Schwarz alternating procedure. 205-215
  
• Chang-Biau Yang, Richard C. T. Lee:
  The mapping of 2-D array processors to 1-D array processors. 217-229
  
• John Paul Shen, John P. Hayes, Luigi Ciminiera, Angelo Serra:
  Fault-tolerance and performance analysis of beta-networks. 231-249
  
• Endre Katona:
  A lattice model for cellular (systolic) algorithms. 251-258
  
• Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.:
  Superlinear speedup of an efficient sequential algorithm is not possible. 259-260
  
• D. Parkinson:
  Parallel efficiency can be greater than unity. 261-262
  
• J. J. Modi, J. S. Rollett:
  Some problems of exploiting a pipeline processor. 263-265
  

Volume 3, Number 4, October 1986

• Hans-Christian Hoppe, Heinz Mühlenbein:
  Parallel adaptive full-multigrid methods on message-based multiprocessors. 269-287
  
• David J. Evans, Graham M. Megson:
  Romberg integration using systolic arrays. 289-304
  
• Dennis Gannon, Jairo Panetta:
  Restructuring SIMPLE for the CHiP architecture. 305-326
  
• Joseph W. H. Liu:
  Computational models and task scheduling for parallel sparse Cholesky factorization. 327-342
  
• Wilfried Oed, Otto Lange:
  Modelling, measurement, and simulation of memory interference in the CRAY X-MP. 343-358
  
• Uwe Harms, Wolfgang Rönsch:
  International conference on vector and parallel computing. 359-363