Parallel Computing 12 (1989) 393-394 North-Holland
393
Author Index to Volume 12 (1989) (The issue number is given in front of page numbers)
Alnuweiri, ll.M. and V.IC Prasanna Kumar, An efficient VLSI architecture with applications to geometric problems Arenstod, N.S. and H.F. Jordan, Comparing barrier algorithms Babelian, E. and L M . Delves, Parallel solution of Fredholm integral equations Balllie, C.F. and G.S. Pawley, A comparison of the CM with the DAP for lattice gauge theory Barr, R.S., R.V. Helgaon and J.L. Kennington, Minimal spanning trees: An empirical investigation of parallel algorithms Beuaini, A. and Y. Robert, An even faster systolic array for matrix multiplication ( S h o r t C o m m u n i c a tion )
Berntsen, J., Communication efficient matrix multiplication on hypercubes Bohr, H., K.S. Jensen, T. Petersen, B. Rathjen, E. Mosekilde and N.-H. Holstein-Rathlou, Parallel computer simulation of nearest-neighbour interaction in a system of nephrons Brockard, L., Efficiency of some parallel numerical algorithms on distributed systems
(1) 71- 93 (2) 157-170 (1) 95-106 (2) 209-220 (1) 45- 52 (2) 249-254 (3) 335-342 (1) 113-120 (1) 21- 44
Cheng, K.H. and S. Sahni, VLSI architectures for back substitution
(1) 53- 69
Dehne, F., A.-L. Hessenklover and J.-R. Sack, Computing the configuration space for a robot on a mesh-of-processors Delves, L.M., see Babolian, E.
(2) 221-231 (1) 95-106
Eskow, E. and R.B. Schnabel, Mathematical modeling of a parallel global optimization algorithm Evans, D J . and I. Stojmenovi~, On parallel computation of Voronoi diagrams (Short Communication )
(3) 315-325 (1) 121-125
Fernandes, P. and P. Girdinio, A new storage scheme for an efficient implementation of the sparse matrix-vector product Flatt, H.P. and K. Kennedy, Performance of parallel processors Freeman, T.L., Calculating polynomial zeros on a local memory parallel computer
(3) 327-333 (1) 1- 20 (3) 351-358
Girdinio, P., see Fernandes, P. Gladwell, I. and R.I. Hay, Vector- and paraUelisation of ODE BVP codes Guerra, C. and R. Melbem, Synthesis of systolic algorithm design
(3) 327-333 (3) 343-350 (2) 195-207
Hake, J.-Fr., Parallel Computing 89 (Conference R e p o r t ) Hart, L. and S. McCormick, Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: Basic ideas Hassenklover, A.-L, see Delme, F. Hay, R.I., see Gladwell, I. Helgaon, R.V., see Barr, R.S. llolstein-Rathiou, N.-H., see Bohr, tl. Hossfeld, F., R. Knecht and W.E. Nagd, Multitasking: Experience with applications on a CRAY X-MP Hotop, H.-J., New Kalman filter algorithms based on orthogonal transformations for serial and vector computers Huang, T.-C., J.-F. Wang, C.-S. Yang and J.-Y. Lee, Graph theoretic characterization and reliability of the generalized Boolean n-cube network ( S h o r t C o m m u n i c a t i o n )
(3) 387-388 (2) (2) (3) (1) (1)
131-144 221-231 343-350 45- 52 113-120
(3) 259-283 (2) 233-247 (3) 375-385
Jensen, K.S., see Bohr, H. Jordan, H.F., see Arenstorf, N.S.
(1) 113-120 (2) 157-170
Kennedy, K., see Flatt, H.P. Kennington, J.L, see Barr, R.S. K n e c h t , R., see Hossfeld, F.
(1) 1- 20 (1) 45- 52 (3) 259-283
394 Lee, J.-Y.,
Author Index
see
Huang, T.-C.
(3) 375-385
Maritsas, D.G., s e e Papaspyropoulos, G.T. Marrakehi, M. and Y. Robert, Optimal algorithms for Gaussian elimination on an MIMD computer McCormick, S. and D. Quinlan, Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: Performance results McCormick, S., s e e H a r t , L . Melbem, R., s e e G u e r r a , C . Mosekilde, E., s e e B o h r , EL
(3) 359-373 (2) 183-194
Nagel, W.E.,
(3) 259-283
see
Hossfeld, F.
(2) (2) (2) (1)
145-156 131-144 195-207 113-120
Papaspyropoulos, G.T. and D.G. Maritsas, Parallel discrete event simulation with SIMULA Papatbeodorou, T.S. and Y.G. Saridakis, Parallel algorithms and architectures for multisplitting iterative methods Pawley, G.S., s e e Baillie, C.F. Petersea, T., s e e l l o h r , H . Petkov, N. and F. Slobeda, A bit-level systolic array for digital contour smoothing Prasanna Kumar, V.K., s e e Alnuweiri, ELM.
(2) 171-182 (2) 209-220 (1) 113-120 (3) 301-313 (1) 71- 93
Quinlan, D.,
(2) 145-156
see
McCormick, S.
(3) 359-373
Rathjen, B., s e e B o h r , H . Robert, Y., s e e Benaini, A. Robert, Y., s e e Marrakchi, M.
(1) 113-120 (2) 249-254 (2)183-194
Sack, J.-R., s e e D e h n e , F. Sahni, S., s e e Chang, ILEL Saridakis, Y.G., s e e Papatbeodoroa, T.S. Schimmler, M. and H. Schr6der, A simple systolic method to find all bridges of an undirected graph Schnabel, ll.B., s e e Eskow, E. S c h r 6 d e r , EL, s e e Schimmler, M. Slobeda, F., s e e Petkov, N. Stojmenovi~ I., s e e Evans, D.J.
(2) (1) (2) (1) (3) (1) (3) (1)
Umeo, H., A design of time-optimum and register-number-minimum systolic convolvers
(3) 285-299
Wang, J.-F.,
see
Huang, T.-C.
(3) 375-385
Yang, C.-S.,
see
Huang, T.-C.
(3) 375-385
221-231 53- 69 171-182 107-111 315-325 107-111 301-313 121-125