default search action
International Journal of High Speed Computing, Volume 1
Volume 1, Number 1, May 1989
- Zhiqiang Cai, Steve F. McCormick:
Computational Complexity of the Schwarz Alternating Procedure. 1-28 - Kapil K. Mathur, S. Lennart Johnsson:
The Finite Element Method on a Data Parallel Computing System. 29-44 - Constantine D. Polychronopoulos, Milind Girkar, Mohammad R. Haghighat, Chia Ling Lee, Bruce Leung, Dale Schouten:
Parafrase-2: an Environment for Parallelizing, Partitioning, Synchronizing, and Scheduling Programs on Multiprocessors. 45-72 - Edward J. Anderson, Yousef Saad:
Solving Sparse Triangular Linear Systems on Parallel Computers. 73-95 - Zhaojun Bai, James Demmel:
On a Block Implementation of Hessenberg Multishift QR Iteration. 97-112 - Efstratios Gallopoulos, Yousef Saad:
Some Fast Elliptic Solvers on Parallel Architectures and their Complexities. 113-141 - Sukil Kim, Dharma P. Agrawal, Ja-Song Leu, Jon Mauney:
Modeling Techniques in a Parallelizing Compiler for the B-Hive Multiprocessor System. 143-164 - Owe Axelsson:
On Iterative Solution of Elliptic Difference Equations on a Mesh-Connected Array of Processors. 165-183 - Yoichi Muraoka, Hayato Yamana, Takashi Hagiwara, Toshikazu Marushima:
Major Research Activities in Parallel Processing in Japan and an Example -Harray-. 185-206
Volume 1, Number 2, June 1989
- Ray A. Kamin III, George B. Adams III:
Fast Fourier Transform Algorithm Design and Tradeoffs on the CM-2. 207-231 - Paul O. Frederickson:
Totally Parallel Multilevel Algorithms. 233-245 - Walter F. Tichy:
Parallel Matrix Multiplication on the Connection Machine. 247-262 - Charles Tong:
The Preconditioned Conjugate Gradient Method on the Connection Machine. 263-288 - Charbel Farhat, N. Sobh, K. C. Park:
Dynamic Finite Element Simulations on the Connection Machine. 289-302 - Ralph G. Brickner, Clive F. Baillie:
Pure Gauge QCD on the Connection Machine. 303-320 - D. L. Greenwell, Rajiv K. Kalia, J. C. Patterson, Priya Vashishta:
Molecular Dynamics Algorithm on the Connection Machine. 321-328 - Franklin C. Crow, Gary Demos, Jim Hardy, John McLaughlin, Karl Sims:
3D Image Synthesis on the Connection Machine. 329-347 - David Rogers:
Kanerva's Sparse Distributed Memory: an Associative Memory Algorithm Well-Suited to the Connection Machine. 349-365 - Creon Levit:
Grid Communication on the Connection Machine: Analysis, Performance, and Improvements. 367-381
Volume 1, Number 3, September 1989
- A. Cosnuau, P. Leca:
Scientific Parallel Computing with Transputer Networks. 383-398 - Srilata Raman, Lalit M. Patnaik:
Hirecs: Hypercube Implementation of Relaxation-Based Circuit Simulation. 399-432 - Rod A. Fatoohi:
Multitasking on the Cray y-MP: an Experiment with a 2-d Navier-Stokes Code. 433-447 - M. C. Lee, Chew Lim Tan, Hoon Heng Teh:
Product of Quasi-Group Graphs as Interconnection Network Topologies. 449-463 - C. Y. Chang, Kung Yao:
Systolic Array Processing of the Sequential Decoding Algorithm. 465-480 - Eric Barszcz, Tony F. Chan, Dennis C. Jespersen, Raymond S. Tuminaro:
Flo52 on Hypercubes: Performance and Modelling of a Multigrid Euler Code. 481-503 - K. J. M. Moriarty:
Optimization of the Fortran Code for the Three-Dimensional Ising Model on the M64/60. 505-516
Volume 1, Number 4, December 1989
- Daniel A. Reed, David C. Rudolph:
Experiences with Hypercube Operating System Instrumentation. 517-542 - William C. Brantley, Luigi G. Brochard, Anthony Bolmarcich, Henry Y. Chang, Kevin P. McAuliffe, Ton Anh Ngo:
Initial Experiences with RP3 Performance Monitoring. 543-561 - J. P. Prost, M. Becker:
Modeling Methodology for Performance Evaluation of Parallel Architectures a Case Study, LCAP. 563-601 - Sandra Johnson Baylor, Bharat Deep Rathi:
An Evaluation of the Memory Reference Behavior of Engineering/Scientific Applications in Parallel Systems. 603-641
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.