![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Parallel Computing, Volume 12
Volume 12, Number 1, October 1989
- Horace P. Flatt, Ken Kennedy:
Performance of parallel processors. 1-20 - Luigi Brochard
:
Efficiency of some parallel numerical algorithms on distributed systems. 21-44 - Richard S. Barr, R. V. Helgaon, Jeffery L. Kennington:
Minimal spanning trees: an empirical investigation of parallel algorithms. 45-52 - Kam-Hoi Cheng, Sartaj Sahni:
VLSI architectures for back substitution. 53-69 - Hussein M. Alnuweiri, Viktor K. Prasanna:
An efficient VLSI architecture with applications to geometric problems. 71-93 - Esmail Babolian, L. M. Delves:
Parallel solution of Fredholm integral equations. 95-106 - Manfred Schimmler, Heiko Schröder:
A simple systolic method to find all bridges of an undirected graph. 107-111 - H. Bohr, Kim S. Jensen, T. Petersen, B. Rathjen, Erik Mosekilde
, Niels-Henrik Holstein-Rathlou
:
Parallel computer simulation of nearest-neighbour interaction in a system of nephrons. 113-120 - David J. Evans, Ivan Stojmenovic:
On parallel computation of Voronoï diagrams. 121-125
Volume 12, Number 2, November 1989
- Leslie Hart, Stephen F. McCormick:
Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: basic ideas. 131-144 - Stephen F. McCormick, Daniel J. Quinlan:
Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: performance results. 145-156 - Norbert S. Arenstorf, Harry F. Jordan:
Comparing barrier algorithms. 157-170 - Theodore S. Papatheodorou, Yiannis G. Saridakis:
Parallel algorithms and architectures for multisplitting iterative methods. 171-182 - Mounir Marrakchi, Yves Robert
:
Optimal algorithms for Gaussian elimination on an MIMD computer. 183-194 - Concettina Guerra, Rami G. Melhem
:
Synthesis of systolic algorithm design. 195-207 - Clive F. Baillie, G. Stuart Pawley:
A comparison of the CM with the DAP for lattice gauge theory. 209-220 - Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack
:
Computing the configuration space for a robot on a mesh-of-processors. 221-231 - Hans-Jürgen Hotop:
New Kalman filter algorithms based on orthogonal transformations for serial and vector computers. 233-247 - Abdelhamid Benaini, Yves Robert
:
An even faster systolic array for matrix multiplication. 249-254
Volume 12, Number 3, December 1989
- Friedel Hossfeld, Renate Knecht, Wolfgang E. Nagel:
Multitasking: experience with applications on a CRAY X-MP. 259-283 - Hiroshi Umeo:
A design of time-optimum and register-number-minimum systolic convolvers. 285-299 - Nikolay Petkov, Fridrich Sloboda:
A bit-level systolic array for digital contour smoothing. 301-313 - Elizabeth Eskow, Robert B. Schnabel:
Mathematical modeling of a parallel global optimization algorithm. 315-325 - P. Fernandes, P. Girdinio:
A new storage scheme for an efficient implementation of the sparse matrix-vector product. 327-333 - Jarle Berntsen:
Communication efficient matrix multiplication on hypercubes. 335-342 - Ian Gladwell, R. I. Hay:
Vector- and parallelisation of ODE BVP codes. 343-350 - T. L. Freeman:
Calculating polynomial zeros on a local memory parallel computer. 351-358 - George T. Papaspyropoulos, Dimitris G. Maritsas:
Parallel discrete event simulation with SIMULA. 359-373 - Tsung-Chuan Huang, Jhing-Fa Wang, Chu-Sing Yang, Jau-Yien Lee:
Graph theoretic characterization and reliability of the generalized Boolean n-cube network. 375-385
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.