Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Computing, Volume 18
Volume 18, Number 1, January 1992
- Eleanor Chu, Alan George:
A balanced submatrix merging algorithm for multiprocessor architectures. 1-10 - Grazia Lotti, Marián Vajtersic:
The application of VLSI Poisson solvers to the biharmonic problem. 11-19 - Graham Horton, Ralf Knirsch:
A time-parallel multigrid-extrapolation method for parabolic partial differential equations. 21-29 - Domenico Conforti
, Lucio Grandinetti, Roberto Musmanno, Mario Cannataro, Giandomenico Spezzano, Domenico Talia:
A model of efficient asynchronous parallel algorithms on multicomputer systems. 31-45 - Christian Neusius, Jan Olszewski, D. Scheerer:
An efficient distributed thinning algorithm. 47-55 - Alessandro De Gloria, Paolo Faraboschi, Sandro Ridella:
A dedicated massively parallel architecture for the Boltzmann machine. 57-73 - Venu K. Murthy, E. V. Krishnamurthy, Pin Chen:
Systolic algorithm for rational interpolation and Padé approximation. 75-83 - Anatol G. Filin, Michael A. Frumkin:
A systolic array for inversion of a finite Radon transform. 85-90 - M. Wheat, David J. Evans:
An efficient parallel sorting algorithm for shared memory multiprocessors. 91-102 - El-Sayed M. El-Horbaty, A. El-Din H. Mohamed:
A synchronous algorithm for shortest paths on a tree machine. 103-107 - W. Erhard, A. Grefe:
Improved parallel algorithms for the classification of electroencephalograms (EEGs) on the DAP510. 109-115
Volume 18, Number 2, February 1992
- Reinhard von Hanxleden, L. Ridgway Scott:
Correctness and determinism of Parallel Monte Carlo Processes. 121-132 - Tzung-Pei Hong, Shian-Shyong Tseng:
Parallel perceptron learning on a single-channel broadcast communication model. 133-148 - Daniel Audet, Yvon Savaria, Jean-Louis Houle:
Performance improvements to VLSI parallel systems, using dynamic concatenation of processing resources. 149-167 - Mounir Marrakchi:
Optimal parallel scheduling for the 2-steps graph with constant task cost. 169-176 - Hong Shen:
Improved universal k-selection in hypercubes. 177-184 - Philippe Clauss, Catherine Mongenet, Guy-René Perrin:
Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution. 185-194 - David J. Evans:
A systolic array design for matrix system solution by the symmetric bordering method. 195-205 - T. Z. Kalamboukis:
A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array. 207-212 - Przemyslaw Stpiczynski:
Parallel Cholesky factorization on orthogonal multiprocessors. 213-219 - Chang-Sung Jeong, Jung-Ju Choi, Der-Tsai Lee:
Parallel enclosing rectangle on SIMD machines. 221-229 - Stephan Kohlhoff, Jörg Krone:
Performance evaluation of SUPRENUM for the LINPACK benchmark (Short communication). 231-238
Volume 18, Number 3, March 1992
- Robert Hiromoto, B. R. Wienke, R. G. Brickner:
The performance of asynchronous iteration schemes applied to the linearized Boltzmann transport equation. 241-268 - A. Schuller:
Parallelizing particle simulations based on the Boltzmann equation. 269-279 - J. Andrew Holey, Oscar H. Ibarra:
Iterative algorithms for the planar convex hull problem on mesh-connected arrays. 281-296 - Borut Robic, Peter Kolbezen, Jurij Silc:
Area optimization of dataflow-graph mappings. 297-311 - Paolo Casiccia, Paolo Castangia, Silvano Cincotti, Giancarlo Parodi:
Simulation of a molecular cellular array on a transputer-based parallel computer. 313-324 - Konstantinos G. Margaritis, David J. Evans:
Systolic implementation of neural networks for searching sets of properties. 325-334 - W. Loots, T. H. C. Smith:
A parallel three phase sorting procedure for a k-dimensional hypercube and a transputer implementation. 335-344 - Eric Goles Ch., Marcos A. Kiwi:
A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer. 345-354 - Graham M. Megson, David J. Evans:
More on systolic line drawing. 355-358
Volume 18, Number 4, April 1992
- Patrick H. Worley:
The effect of multiprocessor radius on scaling. 361-376 - Su-Chu Hsu, Hsien-Fen Hsieh, Shing-Tsaan Huang:
A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph. 377-391 - Hong Chich Chou, Chung-Ping Chung:
A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle. 393-399 - I. Mahadevan, Lalit M. Patnaik:
Performance evaluation of bidirectional associative memory on a transputer-based parallel system. 401-413 - Graham M. Megson, Octav Brudaru, D. Comish:
Systolic designs for Aitken's root finding method. 415-429 - Pl. Iv. Piskoulijski:
Error analysis of parallel algorithm for the solution of a tridiagonal Toeplitz linear system of equations. 431-438 - Gen-Huey Chen, Wei-Wen Liang:
Conflict-free broadcasting algorithms for graph traversals and their applications. 439-448 - Christopher P. Thompson, Wayne R. Cowell, Gary K. Leaf:
On the parallelization of an adaptive multigrid algorithm for a class of flow problems. 449-466 - Heribert C. Burg, Jukka Helin:
1991 International Conference on Supercomputing. 467-471 - Hans-Christian Hege, Renate Knecht:
Parallel Computing 91. 473-476
Volume 18, Number 5, May 1992
- Yves Robert, Siang W. Song:
Revisiting cycle shrinking. 481-496 - Yuh-Horng Shiau, Chung-Ping Chung:
Adoptability and effectiveness of microcode compaction algorithms in superscalar processing. 497-510 - Rong Lin, Stephan Olariu:
A fast cost-optimal parallel algorithm for the lowest common ancestor problem. 511-516 - E. D. Adamides, Philippos Tsalides, Adonios Thanailakis:
Hierarchical Cellular Automata structures. 517-524 - David J. Evans, Marjan Gusev:
Implementation of folding transformations on linear VLSI processor arrays. 525-542 - Rhys S. Francis, L. J. H. Pannan:
A parallel partition for enhanced parallel QuickSort. 543-550 - Francis Suraweera, Prabir Bhattacharya:
A parallel cost-optimal algorithm to compute the supremum of max-min powers. 551-556 - Hellfried Schreiber, Othmar Steinhauser, Peter Schuster:
Parallel molecular dynamics of biomolecules. 557-573 - T. Dontje, Thomas Lippert, Nicolai Petkov, Klaus Schilling:
Statistical analysis of simulation-generated time series: Systolic vs. semi-systolic correlation on the Connection Machine. 575-588
Volume 18, Number 6, June 1992
- Ajay K. Gupta, Susanne E. Hambrusch:
Load balanced tree embeddings. 595-614 - Yuri P. Boglaev:
Exact dynamic load balancing of MIMD architectures with linear programming algorithms. 615-623 - Chien-Min Wang, Sheng-De Wang:
A hybrid scheme for efficiently executing nested loops on multiprocessors. 625-637 - Jean-Claude Bermond, Philippe Michallon, Denis Trystram:
Broadcasting in wraparound meshes with parallel monodirectional links. 639-648 - Ömer Egecioglu, Çetin Kaya Koç:
A parallel algorithm for generating discrete orthogonal polynomials. 649-659 - B. M. S. Khalaf, D. Hutchinson:
Parallel algorithms for initial value problems: parallel shooting. 661-673 - Johannes Andersen, Gautam Mitra, D. Parkinson:
The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer. 675-677 - Jonathan M. D. Hill:
Parallel lexical analysis and parsing on the AMT distributed array processor. 699-714
Volume 18, Number 7, July 1992
- Edward Rothberg, Anoop Gupta:
Parallel ICCG on a hierarchical memory multiprocessor - Addressing the triangular solve bottleneck. 719-741 - Tatsuoki Takeda, Keiji Tani, Toshihide Tsunematsu, Yasuaki Kishimoto, Gen'Ichi Kurita, Satoshi Matsushita, Toshiyuki Nakata:
Plasma simulator METIS for tokamak confinement and heating studies. 743-765 - Luciano Lopez, Tiziano Politi:
Parallel methods in the numerical treatment of population dynamic models. 767-777 - Jianjian Song:
A distributed-termination experiment on a mesh-connected array of processors. 779-791 - Derrick Morris, D. Gareth Evans:
Modelling distributed and parallel computer systems. 793-806 - Laurence Boxer:
Finding congruent regions in parallel. 807-810 - Gen-Huey Chen, Jin Hwang Jang:
An improved parallel algorithm for 0/1 knapsack problem. 811-821 - Yung-Chen Hung, Gen-Huey Chen:
Distributed algorithms for the quickest path problem. 823-834
Volume 18, Number 8, August 1992
- Srinivas Aluru, Gurpur M. Prabhu, John L. Gustafson:
A random number generator for parallel computers. 839-847 - P. Sreenivasa Kumar, M. Kishore Kumar, A. Basu:
A parallel algorithm for elimination tree computation and symbolic factorization. 849-856 - Marjan Gusev, Jurij F. Tasic:
Comparative analysis of methods for broadcast elimination. 857-866 - M. Thune:
The partitioning problem for a class of data parallel algorithms. 867-878 - Michael P. Bekakos, David J. Evans:
The double alternating group explicit method for nonlinear parabolic equations on MIMD parallel computers. 879-895 - Janez Zerovnik, M. Kaufman:
A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication). 897-900 - Kazuaki Okamoto, Yuetsu Kodama, Shuichi Sakai, Yoshinori Yamaguchi:
Methodologies in development and testing of the dataflow machine EM-4. 901-912 - Kifah R. Tout, David J. Evans:
Parallel forward chaining technique with dynamic scheduling, for rule-based expert systems. 913-930 - R. Butel:
A Cray-2 versus CM-2 comparison using several polynomial benchmarks. 931-945 - Wilfried Oed:
Cray Y-MP C90: System features and early benchmark results (Short communication). 947-954
Volume 18, Number 9, September 1992
- Scott Stark, Antony N. Beris:
LU decomposition optimized for a parallel computer with a hierarchical distributed memory. 959-971 - Jack J. Dongarra, Robert A. van de Geijn:
Reduction to condensed form for the eigenvalue problem on distributed memory architectures. 973-982 - Y. P. Chu, C. M. Hsieh:
An artificial neural network model with modified perceptron algorithm. 983-996 - Marjan Gusev, David J. Evans:
VLSI processor array IPS cells (Short communication). 997-1007 - G. Zhang, Howard C. Elman:
Parallel sparse Cholesky factorization on a shared memory multiprocessor. 1009-1022 - Murry Bentley, C. F. Fischer:
Hypercube conversion of serial codes for atomic structure calculations. 1023-1031 - Søren S. Nielsen, Stavros A. Zenios:
Data structures for network algorithms on massively parallel architectures. 1033-1052 - Jurij F. Tasic, Marjan Gusev, David J. Evans:
Systolic implementation of preconditioned conjugate gradient method in adaptive transversal filters. 1053-1065 - Roger W. Hockney, Edward A. Carmona:
Comparison of communications on the Intel iPSC/860 and Touchstone Delta (Short communication). 1067-1072 - H. Strauss:
Parallel CFD'92. 1073-1074
Volume 18, Number 10, October 1992
- Marius V. A. Hâncu, Kazuhiko Iwasaki, Yuji Sato, Mamoru Sugie:
Experimental results on the error detection capability of a concurrent test architecture for massively-parallel computers. 1079-1103 - Peter Arbenz:
Divide and conquer algorithms for the bandsymmetric eigenvalue problem. 1105-1128 - Achim Basermann, Peter Weidner:
A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices. 1129-1141 - Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu:
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree. 1143-1155 - T. Chockalingam, S. Arunkumar:
A randomized heuristics for the mapping problem: The genetic approach. 1157-1165 - Eric Violard, Guy-René Perrin:
PEI: A language and its refinement calculus for parallel programming. 1167-1184 - Y.-H. Choi:
An easily-diagnosable fault-tolerant binary tree architecture (Short communication). 1185-1195
Volume 18, Number 11, November 1992
- S. Lennart Johnsson, Robert L. Krawitz:
Cooley-Tukey FFT on the Connection Machine. 1201-1221 - Mohammad Zubair, S. N. Gupta, Chester E. Grosch:
A variable precision approach to speedup iterative schemes on fine grained parallel machines (short communication). 1223-1231 - Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. 1233-1257 - Roman G. Strongin, Yaroslav D. Sergeyev:
Global multidimensional optimization on parallel computer. 1259-1273 - Ioannis P. Vlahavas, Petros Kefalas:
A parallel Prolog resolution based on multiple unifications. 1275-1283
Volume 18, Number 12, December 1992
- Frans J. Peters:
Preface. 1289- - Thomas Lippert, Klaus Schilling, Nicolai Petkov:
Quark propagator on the Connection Machine. 1291-1299 - Mi Lu, Xiangzhen Qiao:
Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems. 1301-1315 - El Mostafa Daoudi, J. Lobry:
Implementation of a boundary element method on distributed memory computers. 1317-1324 - Maurice Clint, Jim Weston, C. W. Bleakney:
A comparison of two Fortran dialects for expressing parallel solutions for a problem in linear algebra. 1325-1333 - B. Khan, Ladson Hayes, Arthur P. Cracknell:
The optimisation of higher order resampling methods in a multiprocessor environment. 1335-1347 - Paul Spee, Weng-Fai Wong, M. Sato, Eiichi Goto:
Evaluation of the continuation bit in the Cyclic Pipeline Computer. 1349-1361 - David W. N. Sharp, Martin Cripps, John Darlington:
Parallel-architecture-directed program transformation. 1363-1380 - D. K. Arvind:
On the detection of communication-related errors in concurrent programs. 1381-1392 - C. Ribeiro, Didier El Baz:
A parallel optimal routing algorithm. 1393-1402 - Andrew W. G. Duller, Richard H. Storer:
Simulation and verification of associative processor arrays. 1403-1414 - Bernhard Quatember:
Concept of a crossbar switch for large-scale multiple processor systems in the field of process control. 1415-1431
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-04-22 20:02 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:
