SC 1990: New York, NY, USA
Joanne L. Martin, Daniel V. Pryor, Gary Montry (Eds.): Proceedings Supercomputing '90, New York, NY, USA, November 12-16, 1990. IEEE Computer Society / ACM 1990 ISBN 0-89791-412-0
Ed Anderson, Zhaojun Bai, Jack Dongarra, A. Greenbaum, A. McKenney, Jeremy Du Croz, Sven Hammarling, James Demmel, Christian H. Bischof, Danny C. Sorensen: LAPACK: a portable linear algebra library for high-performance computers. 2-11
Dingju Chen: Hierarchical blocking and data flow analysis for numerical linear algebra. 12-19
Rodney W. Johnson, Chua-Huang Huang, John R. Johnson: Multilinear algebra and parallel programming. 20-31
Jürgen-Friedrich Hake, Willi Homberg: The impact of memory organization on the performance of matrix multiplication. 34-40
Yoshikuni Okawa, Naoki Haraguchi: A linear array of processors with partially shared memory for parallel solution of PDE. 41-48
Allen D. Malony, John L. Larson, Daniel A. Reed: Tracing application program execution on the Cray X-MP and Cray 2. 60-73
Robert Hood, Ken Kennedy, John M. Mellor-Crummey: Parallel program debugging with on-the-fly anomaly detection. 74-81
Daniel R. Ripoll, Stephen J. Thomas: A parallel Monte Carlo search algorithm for the conformational analysis of proteins. 94-102
Michael Ess: Folding RNA on the Cray-2. 103-111
Steven W. White, David C. Torney, Clive C. Whittaker: A parallel computational approach using a cluster of IBM ES/3090 600Js for physical mapping of chromosomes. 112-121
Gilbert J. Hansen, Charles A. Linthicum, Gary Brooks: Experience with a performance analyzer for multithreaded applications. 124-131
Margaret L. Simmons, Harvey J. Wasserman: Performance evaluation of the IBM RISC System/6000: comparison of an optimized scalar processor with two vector processors. 132-141
Elizabeth Williams, C. Thomas Myers, Rebecca Koskela: The characterization of two scientific workloads using the CRAY X-MP performance monitor. 142-152
William L. French: Supercomputer network selection: a case study. 154-159
Marke Clinger: Very high performance networking for supercomputing. 160-168
Daniel A. Menascé, Virgilio Almeida: Cost-performance analysis of heterogeneity in supercomputer architectures. 169-177
Jyh-Herng Chow, Williams Ludwell Harrison III: Switch-stacks: a scheme for microtasking nested parallel loops. 190-199
Parthasarathy P. Tirumalai, Meng Lee, Michael S. Schlansker: Parallelization of loops with exits on pipelined architectures. 200-212
Anna Nagurney, Alexander Eydeland, Dae-Shik Kim: Computation of large-scale constrained matrix problems: the splitting equilibration algorithm. 214-223
Karl P. Traar, Wolfgang R. Mader, Otto Heinreichsberger, Siegfried Selberherr, Martin Stiftinger: High performance preconditioning on supercomputers for the 3D device simulator MINIMOS. 224-231
Edward Rothberg, Anoop Gupta: Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations. 232-241
Suresh Chalasani, Anujan Varma, C. S. Raghavendra: Fault-tolerant routing in MIN-based supercomputers. 244-253
Ted H. Szymanski, Chien Fang: Design and analysis of buffered crossbars and banyans with cut-through switching. 264-273
Takanobu Baba, Tsutomu Yoshinaga, Tohru Iijima, Yoshifumi Iwamoto, Masahiro Hamada, Mitsuru Suzuki: A parallel object-oriented total architecture: A-NET. 276-285
Jeffrey X. Zhou: A parallel computer model supporting procedure-based communication. 286-294
Creve Maples: A high-performance, memory-based interconnection system for multicomputer environments. 295-304
Vishwani D. Agrawal, Srimat T. Chakradhar: Performance estimation in a massively parallel system. 306-313
Gary J. Harkin: Parametrized algorithm decomposition and performance analysis. 314-323
Hans J. Berliner, Danny Kopec, Ed Northam: A taxonomy of concepts for evaluating chess strength. 336-343
Lewis Stiller: Group graphs and computational symmetry on massively parallel architecture. 344-353
Robert M. Hyatt, Harry L. Nelson: Chess and supercomputers: details about optimizing Cray Blitz. 354-363
D. E. Stevenson, R. M. Panoff: Experiences in building the Clemson computational sciences program. 366-375
Floyd B. Hanson: A real introduction to supercomputing: a user training course. 376-385
Rajiv Gupta: Loop displacement: an approach for transforming and scheduling loops for parallel execution. 388-397

Aladin Kamel, Piero Sguazzero, Vittorio Zecca: Large-scale computing on clustered vector multiprocessors. 418-427
Frederic J. L. Briens, Ching H. Wu: Application of sequential staging of tasks to petroleum reservoir modeling. 428-435
Mark Christon: A vectorized 3-D finite element model for transient simulation of two-phase heat transport with phase transformation and a moving interface. 436-445
William Celmaster, Edward N. May: Parallelization of a radiation transport simulation code on the BBN TC2000 parallel computer. 448-454
Zarka Cvetanovic, Edward G. Freedman, Charles Nofsinger: Perfect Benchmarks decomposition and performance on VAX multiprocessors. 455-474
Lasse Natvig: Logarithmic time cost optimal parallel sorting is not yet fast in practice!. 486-494
Janice M. Stone: A simple and correct shared-queue algorithm using compare-and-swap. 495-504
Prasad Vishnubhotla: Fine-grain parallelism in the ALPS programming language. 506-514

Iain S. Duff: Parallel algorithm research at CERFACS. 536-542
Mazin S. Algudady, Chita R. Das, Matthew Thazhuthaveetil: A write update cache coherence protocol for MIN-based multiprocessors with accessibility-based split caches. 544-553
John C. Willis, Arthur C. Sanderson, Charles R. Hill: Cache coherence in systems with parallel communication channels many processors. 554-563

Gail A. Alverson, William G. Griswold, David Notkin, Lawrence Snyder: A flexible communication abstraction for nonshared memory parallel computing. 584-593
Manohar Rao, Zary Segall, Dalibor F. Vrsalovic: Implementation machine paradigm for parallel programming. 594-603
Moon-Jung Chung, Yunmo Chung: Efficient parallel logic simulation techniques for the connection machine. 606-614
Robert B. Mueller-Thuns, Daniel G. Saab, Jacob A. Abraham: Design of a scalable parallel switch-level simulator for VLSI. 615-624
Samuel A. Fineberg, Thomas L. Casavant, Howard Jay Siegel: Experimental analysis of communication/data-conditional aspects of a mixed-mode parallel architecture via synthetic computations. 637-646
Suresh Chittor, Richard J. Enbody: Performance evaluation of mesh-connected wormhole-routed networks for interprocessor communication in multicomputers. 647-657
Wen-Tsuen Chen, Ming-Yi Fang: Theorem proving in propositional logic on vector computers using a generalized Davis-Putnam procedure. 658-665
Salvatore Filippone, Paolo Santangelo, Marcello Vitaletti: A vectorized long-period shift-register random number generator. 676-684
David J. Potter, Marhall P. Cline: Massively parallel computational methods in light scattering by small particles. 686-692
Yousry Y. Azmy: On the adequacy of message-passing parallel supercomputers for solving neutron transport problems. 693-699
Ted Sztnabski: A fiber optic hypermesh for SIMD/MIMD machines. 710-719
Jiun-Ming Hsu, Prithviraj Banerjee: A message passing coprocessor for distributed memory multicomputers. 720-729
Ben Heggy, Mary Lou Soffa: Architectural support for register allocation in the presence of aliasing. 730-739
S. Huang, K. J. M. Moriarty, E. Ann Myers, J. Potvin: Information optimization for Monte Carlo data and application to high-temperature quantum chromodynamics. 742-747
Jean-Philippe Brunet, Alan Edelman, Jill P. Mesirov: An optional hypercube direct N-body solver on the connection machine. 748-752
Nobuyasu Ito, Yasumasa Kanada: Monte Carlo simulation of the Ising model and random number generation on the vector processor. 753-763
Joel Welling, Chris Nuuja, Phil Andrews: P3D: a Lisp-based format for representing general 3D models. 766-774
Vincent J. Harrand, Amar Choudry, John P. Ziebarth: Scientific data visualization: a formal introduction to the rendering and geometric modeling aspects. 775-783
Sanjay Sharma, Allen D. Malony, Michael W. Berry, Priyamvada Sinvhal-Sharma: Run-time monitoring of concurrent programs on the Cedar multiprocessor. 784-793
James E. Smith, Wei-Chung Hsu, Christopher C. Hsiung: Future general purpose supercomputer architectures. 796-804
Stuart L. Shapiro, Saul A. Teukolsky: Building black holes, gravitational waves, and relativistic fluid flows: supercomputer cinema. 805-814
D. Hohl, R. Idaszak, R. O. Jones: Quantum molecular modeling with simulated annealing - a distributed processing and visualization application. 816-825
Scott Langlie, Wing Cheng, Ilhan Dilber: Computer simulation of high-speed impact response of composites. 826-834
Ping-Kang Hsiung, Robert H. Thibadeau, Christopher B. Cox, Robert H. P. Dunn: Time dilation visualization in relativity. 835-844
John M. A. Roy, Mark Nagel, Lubomir Bic: Partitioning declarative programs into communicating processes. 846-855
Hironori Kasahara, Hiroki Honda, Seinosuke Narita: Parallel processing of near fine grain tasks using static scheduling OSCAR (optimally scheduled advanced multiprocessor). 856-864
Jingke Li, Marina C. Chen: Generating explicit communication from shared-memory program references. 865-876
Takanobu Baba, Yoshifumi Iwamoto, Tsutomu Yoshinaga: A network-topology independent task allocation strategy for parallel computers. 878-887
Ishfaq Ahmad, Arif Ghafoor: A semi distributed task allocation strategy for large hypercube supercomputers. 898-907
Robert P. Colwell, W. Eric Hall, Chandra S. Joshi, David B. Papworth, Paul K. Rodman, James E. Tornes: Architecture and implementation of a VLIW supercomputer. 910-919
Rajiv Gupta, Michael Epstein, Michael Whelan: The design of a RISC based multiprocessor chip. 920-929
Yong-Fong Lee, Thomas J. Marlowe, Barbara G. Ryder: Performing data flow analysis in parallel. 942-951




