Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Computing, Volume 17
Volume 17, Number 1, April 1991
- Manfred Alef:
Concepts for efficient multigrid implementation on SUPRENUM-like architectures. 1-16 - S. Heydorn, Peter Weidner:
Optimization and performance analysis of thinning algorithms on parallel computers. 17-27 - Pascale Sénéchaud:
A MIMD Implementation of the Buchberger Algorithm for Boolean Polynomials. 29-37 - Norbert Köckler, Matthias Simon:
Parallel singular value decomposition with cyclic storing. 39-47 - David J. Evans, Martin D. Levin:
A matrix-squaring variant of the power method on the DAP. 49-54 - Evripidis Bampis, Jean-Claude König, Denis Trystram:
Impact of communications on the complexity of the parallel Gaussian Elimination. 55-61 - Sathiamoorthy Manoharan
, Peter Thanisch:
Assigning dependency graphs onto processor networks. 63-73 - Chia-Jiu Wang, Victor P. Nelson:
Petri net performance modeling of a modified mesh-connected parallel computer. 75-84 - Antonio Torralba:
A systolic array with applications to image processing and wire-routing in VLSI circuits. 85-93 - Witold Dzwinel:
The search for an optimal multiprocessor interconnection network. 95-100 - M. Wheat, David J. Evans:
Maintenance of shared data structures on tightly coupled multiprocessors. 101-107 - M. Simmen:
Comments on broadcast algorithms for two-dimensional grids. 109-112
Volume 17, Number 2-3, June 1991
- Roland A. Sweet, William L. Briggs, Suely Oliveira, Jules L. Porsche, Thomas Turnbull:
FFTs and three-dimensional Poisson solvers for hypercubes. 121-131 - Marcin Paprzycki, Ian Gladwell:
Solving almost block diagonal systems on parallel computers. 133-153 - P. Tervola, W. Yeung:
Parallel Jacobi algorithm for matrix diagonalisation on transputer networks. 155-163 - David J. Evans, Wang Deren:
An asynchronous parallel algorithm for solving a class of nonlinear simultaneous equations. 165-180 - Silvia M. Müller, Dieter Scheerer:
A method to parallelize tridiagonal solvers. 181-188 - Fethi A. Rabhi, Gordon A. Manson:
Divide-and-conquer and parallel graph reduction. 189-205 - Heiko Schröder, Peter E. Strazdins:
Program compression on the instruction systolic array. 207-219 - Chang-Sung Jeong, Myung Ho Kim:
Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections. 221-228 - Pao-Hsu Shih, Wu-Shung Feng:
An application of neural networks on channel routing problem. 229-240 - Chang-Sung Jeong:
Parallel Voronoi diagram in L1(Linfty) metric on a mesh-connected computer. 241-252 - Laura Bacchelli Montefusco, Carla Guerrini:
A domain decomposition method for scattered data approximation on a distributed memory multiprocessor. 253-263 - Hong Zhang:
On the accuracy of the parallel diagonal dominant algorithm. 265-272 - Heiko Schröder, E. V. Krishnamurthy:
Systolic computation of characteristic polynomials of Hessenberg matrices. 273-277 - Gen-Huey Chen, Maw-Sheng Chern:
Synthesis of algorithms on processor arrays. 279-284 - R. J. van der Pas, J. M. van Kats:
Parallelism in a multi-user environment. 285-296 - Nobumitsu Honjou, Kazumasa Ohtsuki, Masahiro Sekiya, Fukashi Sasaki:
A parallelization technique for the speedup of configuration interaction computing. 297-310 - Jürgen-Friedrich Hake, Willi Homberg:
The impact of memory organization on the performance of matrix calculations. 311-327 - Hartmut Schwandt:
Memory access problems in block cyclic reduction on vector computers. 329-346 - M. Kiehl:
A vector implementation of an ODE code for multi-point-boundary-value problems. 347-352
Volume 17, Number 4-5, July 1991
- Tom Tollenaere, Guy A. Orban:
Simulating modular neural networks on message-passing multiprocessors. 361-379 - Xiaobo Li:
Nearest neighbor classification on two types of SIMD machines. 381-407 - Ilan Bar-On:
Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process. 409-417 - Stefan Bondeli:
Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations. 419-434 - Fridrich Sloboda:
A projection method of the Cimmino type for linear algebraic systems. 435-442 - Éric D. Taillard:
Robust taboo search for the quadratic assignment problem. 443-455 - Yen-Chun Lin:
An FP-based tool for the synthesis of regular array algorithms. 457-470 - Zaher Mahjoub, F. Karoui-Sahtout:
Parallel algorithms for redundant precedence relations elimination in task systems. 471-481 - E. V. Krishnamurthy, Heiko Schröder:
Systolic algorithm for multivariable approximation using tensor products of basis functions. 483-492 - Heiko Schröder, Venu K. Murthy, E. V. Krishnamurthy:
Systolic algorithm for polynomial interpolation and related problems. 493-503 - Chang-Sung Jeong:
An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer. 505-514 - Yen-Chun Lin:
Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication. 515-522 - Sverre Storøy, Tor Sørevik:
A note on an orthogonal systolic design for the assignment problem. 523-525 - Sajal K. Das, Cui-Qing Yang:
Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems. 527-551 - Giorgio Pini:
A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP. 553-561 - Israel Gohberg, Israel Koltracht, Amir Averbuch, Barack Shoham:
Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine. 563-577 - Ulrich Detert, G. Hofemann:
CRAY X-MP and Y-MP memory performance. 579-590 - Martin D. Levin, David J. Evans:
The inversion of matrices by the double-bordering algorithm on MIMD computers. 591-602
Volume 17, Number 6-7, September 1991
- Paul N. Swarztrauber, Roland A. Sweet, William L. Briggs, Van Emden Henson, James S. Otto:
Bluestein's FFT for arbitrary N on the hypercube. 607-617 - Heinz Mühlenbein, M. Schomisch, Joachim Born:
The parallel genetic algorithm as function optimizer. 619-632 - V. V. R. Prasad, C. Siva Ram Murthy:
Downloading node programs/data into hypercubes. 633-642 - Constantine N. K. Osiakwan, Selim G. Akl:
Parallel computation of matchings in trees. 643-656 - Manfred Schimmler:
Parallel strong orientation on a mesh connected computer. 657-664 - Michael Thuné:
Straightforward partitioning of composite grids for explicit difference methods. 665-672 - T. L. Freeman, Michael K. Bane:
Asynchronous polynomial zero-finding algorithms. 673-681 - Stephan Olariu, Zhaofang Wen, Wei Xiong Zhang:
A faster optimal algorithm for the measure problem. 683-687 - Stephan Olariu, Zhaofang Wen:
An efficient parallel algorithm for multiselection. 689-693 - D. Fischer:
On superlinear speedups. 695-697 - J. Hagemann:
Combinatorial structures for multiprocessor-systems. 699-706 - Dimitri P. Bertsekas, David A. Castañón:
Parallel synchronous and asynchronous implementations of the auction algorithm. 707-732 - David Moncrieff, V. R. Saunders, Stephen Wilson:
Parallel processing using macro-tasking in a multi-job environment on a CRAY Y-MP computer. 733-750 - Chris Phillips:
The performance of the BLAS and LAPACK on a shared memory scalar multiprocessor. 751-761 - Sun Kyung Kim, Anthony T. Chronopoulos:
A class of Lanczos-like algorithms implemented on parallel computers. 763-778 - Kenneth Wright:
Parallel algorithms for QR decomposition on a shared memory multiprocessor. 779-790 - F. Wiegand, B. S. Hoyle:
Development and implementation of real-time ultrasound process tomography using a transputer network. 791-807 - Angelo Corana, Aldo Casaleggio, Claudia Rolando, Sandro Ridella:
Efficient computation of the correlation dimension from a time series on a LIW computer. 809-820 - Chwan-Hwa John Wu, Russel E. Hodges, Chia-Jiu Wang:
Parallelizing the self-organizing feature map on multiprocessor systems. 821-832 - David J. Evans, Sevelyn Chikohora:
The alternating group explicit (AGE) method on a transputer network. 833-843
Volume 17, Number 8, October 1991
- Vijaykumar A. Topkar, Ophir Frieder, Arun K. Sood:
Duplicate removal on hypercube engines: an experimental analysis. 845-871 - Emmanuel D. Chajakis, Stavros A. Zenios:
Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization. 873-894 - Yonggen Huang, Yakup Paker:
A parallel FFT algorithm for transputer networks. 895-906 - Elisa Francomano, A. Pecorella, Adele Tortorici Macaluso:
Parallel experience on the inverse matrix computation. 907-912 - H. Park:
A parallel algorithm for the unbalanced orthogonal Procrustes problem. 913-923 - David J. Evans:
The parallel AGE method for the elliptic problem in two dimensions. 925-940 - Y.-H. Choi:
Reconfigurable VLSI/WSI multipipelines. 941-952
Volume 17, Number 9, November 1991
- D. Hutchinson, B. M. S. Khalaf:
Parallel algorithms for solving initial value problems: front broadening and embedded parallelism. 957-968 - Alessandro De Gloria, Paolo Faraboschi:
A Boltzmann Machine approach to code optimization. 969-982 - Wen-Tsuen Chen, Ming-Yi Fang:
An efficient procedure for theorem proving in propositional logic on vector computers. 983-995 - Susumu Horiguchi:
Hybrid systolic sorters. 997-1007 - S. Selvakumar, C. Siva Ram Murthy:
An efficient algorithm for mapping VLSI circuit simulation programs onto multiprocessors. 1009-1016 - Luigi Brugnano:
A parallel solver for tridiagonal linear systems for distributed memory parallel computers. 1017-1023 - V. R. Saunders, Stephen Wilson:
"Scavenger" programming for the CRAY X-MP computer (Short communication). 1025-1034 - M. Wheat, David J. Evans:
Asynchronous parallel merging. 1035-1041 - Lionel C. Waring, Maurice Clint:
Parallel Gram-Schmidt orthogonalisation on a network of transputers. 1043-1050 - Jocelyne Erhel, A. Traynard, M. Vidrascu:
An element-by-element preconditioned conjugate gradient method implemented on a vector computer. 1051-1065
Volume 17, Number 10-11, December 1991
- Jack Worlton:
Toward a taxonomy of performance metrics. 1073-1092 - Xian-He Sun, John L. Gustafson:
Toward a better parallel performance metric. 1093-1109 - Roger W. Hockney:
Performance parameters and benchmarking of supercomputers. 1111-1130 - Willi Schönauer, Hartmut Häfner:
Performance estimates for supercomputers: the responsibilities of the manufacturer and of the user. 1131-1149 - Reinhold Weicker:
A detailed look at some popular benchmarks. 1153-1172 - Michael W. Berry, George Cybenko, John L. Larson:
Scientific benchmark characterizations. 1173-1194 - Kaivalya M. Dixit:
The SPEC benchmarks. 1195-1209 - Aad J. van der Steen:
The benchmark of the EuroBen group. 1211-1221 - David Levine, David Callahan, Jack J. Dongarra:
A comparative study of automatic vectorizing compilers. 1223-1244 - Jack J. Dongarra, Mark Furtney, Steven P. Reinhardt, J. Russell:
Parallel loops - a test suite for parallelizing compilers: description and example results. 1247-1255 - C. M. Grassl:
Parallel performance of applications on supercomputers. 1257-1273 - Anthony J. G. Hey:
The Genesis distributed memory benchmarks. 1275-1283 - Thomas H. Dunigan:
Performance of the Intel iPSC/860 and Ncube 6400 hypercubes. 1285-1302 - Wolfgang E. Nagel, Markus A. Linn:
Benchmarking parallel programs in a multiprogramming environment: the PAR-Bench system. 1303-1321
Volume 17, Number 12, December 1991
- Sunil Arvindam, Vipin Kumar, V. Nageshwara Rao, Vineet Singh:
Automatic test pattern generation on parallel processors. 1323-1342 - Jenn-Yang Tien, Wei-Pang Yang:
Hierarchical spanning trees and distributing on incomplete hypercubes. 1343-1360 - Dieter Müller-Wichards:
Problem size scaling in the presence of parallel overhead. 1361-1376 - Dror G. Feitelson:
Deadlock detection without wait-for graphs. 1377-1383 - Amal Chakraborty, Donald C. S. Allison, Calvin J. Ribbens, Layne T. Watson:
Note on unit tangent vector computation for homotopy curve tracking on a hypercube. 1385-1395 - G. Bader, Eckard Gehrke:
On the performance of transputer networks for solving linear systems of equations. 1397-1407 - A. Peters:
Sparse matrix vector multiplication techniques on the IBM 3090 VF. 1409-1424 - Y. Escaig, Wilfried Oed:
Analysis tools for Micro- and Autotasking programs on CRAY multiprocessor systems. 1425-1433
a service of 
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.
last updated on 2024-05-02 21:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
