


default search action
SC 1991: Albuquerque, NM, USA
- Joanne L. Martin:
Proceedings Supercomputing '91, Albuquerque, NM, USA, November 18-22, 1991. ACM 1991, ISBN 0-89791-459-7 - William W. Pugh:
The Omega test: a fast and practical integer programming algorithm for dependence analysis. 4-13 - Jon Loeliger, Robert Metzger, Mark Seligman, Sean Stroud:
Pointer target tracking - an empirical study. 14-23 - John M. Mellor-Crummey
:
On-the-fly detection of data races for programs with nested fork-join parallelism. 24-33 - Silvio Picano, Eugene D. Brooks III, Joseph E. Hoag:
Programming costs of explicit memory localization on a large scale shared memory multiprocessor. 36-45 - Honda Shing, Lionel M. Ni:
A conflict-free memory design for multiprocessors. 46-55 - Benoît Dupont de Dinechin:
A ultra fast Euclidean division algorithm for prime memory systems. 56-65 - Marion Cohen, Marilyn Foster, David Kratzer, Patricia Malone, Ann Solem:
A high school supercomputing challenge. 68-75 - Ramana Sadananda:
Chaotic cardiac arrhythmias. 76-84 - Seema Hiranandani, Ken Kennedy, Chau-Wen Tseng:
Compiler optimizations for Fortran D on MIMD distributed-memory machines. 86-100 - Charles Koelbel:
Compile-time generation of regular communications patterns. 101-110 - J. Ramanujam, P. Sadayappan:
Tiling multidimensional iteration spaces for nonshared memory machines. 111-120 - H. T. Kung, Jaspal Subhlok:
A new approach for automatic parallelization of blocked linear Algebra computations. 122-129 - Victoria Markstein, Peter W. Markstein, Tung Nguyen, Steve Poole:
Wide format floating-point math libraries. 130-138 - Hugh B. Nicholas, Grace Giras, Vasiliki Hartonas-Garmhausen, Michael Kopko, Christopher Maher, Alexander Ropelewski:
Distributing the comparison of DNA and protein sequences across heterogeneous supercomputers. 139-146 - Nan C. Schaller:
Panel: parallel computing in the undergraduate computer science curriculum. 148 - Margaret L. Simmons, Harvey J. Wasserman, Olaf M. Lubeck, Christopher Eoyang, Raul Mendez, Hiroo Harada, Misako Ishiguro:
A performance comparison of three supercomputers: Fujitsu VP-2600, NEC SX-3, and CRAY Y-MP. 150-157 - David H. Bailey, Eric Barszcz, John T. Barton, D. S. Browning, Robert L. Carter, Leonardo Dagum, Rod Fatoohi, Paul O. Frederickson, T. A. Lasinski, Robert Schreiber, Horst D. Simon
, V. Venkatakrishnan, Sisira Weeratunga:
The NAS parallel benchmarks - summary and preliminary results. 158-165 - David H. Bailey, Paul O. Frederickson:
Performance results for two of the NAS parallel benchmarks. 166-173 - Jean-Loup Baer, Tien-Fu Chen:
An effective on-chip preloading scheme to reduce data access penalty. 176-186 - Peter L. Bird, Richard Uhlig:
Using Lookahead to reduce memory bank contention for decoupled operand references. 187-196 - Michel Dubois, Jin-Chin Wang, Luiz André Barroso, Kangwoo Lee, Yung-Syau Chen:
Delayed consistency and its effects on the miss rate of parallel programs. 197-206 - Philip J. Hatcher, Michael J. Quinn, Ray J. Anderson, Anthony J. Lapadula, Bradley K. Seevers, Andrew F. Bennett:
Architecture-independent scientific programming in data parallel C: three case studies. 208-217 - Hiroyuki Hirayama, Miiko Ikeda, Nobutoshi Sagawa:
Solution functions of PDEQSOL (Partial differential EQuation SOlver language) for fluid problems. 218-227 - James A. Sethian, Jean-Philippe Brunet, Adam Greenberg, Jill P. Mesirov:
Computing turbulent flow in complex geometries on a massively parallel processor. 230-241 - Bracy H. Elton:
A lattice Boltzmann method for a two-dimensional viscous Burgers equation: computational results. 242-252 - Carlos R. Mechoso, Chung-Chun Ma, John D. Farrara, Joseph A. Spahr:
Distribution of a climate model across high-speed networks. 253-260 - David C. Cann:
Retire Fortran? A debate rekindled. 264-272 - Jenq Kuen Lee, Dennis Gannon:
Object oriented parallel programming: experiments and results. 273-282 - Attila Gürsoy, Laxmikant V. Kalé:
High level support for divide-and-conquer parallelism. 283-292 - Richard E. Ewing, Patrick O'Leary, James S. Sochacki:
Vector/parallel implementation of a porous media flow code. 294-303 - L. C. Young, S. E. Zarantonello:
High performance vector processing in reservoir simulation. 304-315 - Jacek Myczkowski, Guy L. Steele Jr.:
Seismic modeling at 14 gigaflops on the connection machine. 316-326 - Jack J. Dongarra, Alan H. Karp, Ken Miura, Horst D. Simon
:
Gordon Bell prize lectures. 328-337 - Gary Sabot, Lisa Tennies, Alex Vasilevsky, Richard Shapiro:
Compiler parallelization of an elliptic grid generator for 1990 Gordon Bell prize. 338-346 - Donald F. Beal, Costas Lambrinoudakis
:
GPFP: an array processing element for the next generation of massively parallel supercomputer architectures. 348-357 - Narendra Karmarkar:
A new parallel architecture for sparse matrix computation based on finite projective geometries. 358-369 - Harry F. Jordan, Vincent P. Heuring:
Time multiplexed optical computers. 370-378 - Charles M. Feduccia, Elaine M. Jacobson:
Universal multistage networks via linear permutations. 380-389 - Sizheng Wei, Saul Levy:
Design and analysis of efficient hierarchical interconnection networks. 390-399 - Matthew K. Farrens, Brad Wetmore, Allison Woodruff:
Alleviation of tree saturation in multistage interconnection networks. 400-409 - Doreen Cheng, Douglas M. Pase:
An evaluation of automatic and interactive parallel programming tools. 412-423 - Mary W. Hall
, Ken Kennedy, Kathryn S. McKinley:
Interprocedural transformations for parallel code generation. 424-434 - Adam Beguelin, Jack J. Dongarra:
Graphical development tools for network-based concurrent supercomputing. 435-444 - Steve Plimpton, Gary Mastin, Denni Ghiglia:
Synthetic aperture radar image processing on parallel supercomputers. 446-452 - Robert S. Hotchkiss, Cheryl L. Wampler:
The auditorialization of scientific information. 453-461 - Pablo Tamayo, Jill P. Mesirov, Bruce M. Boghosian:
Parallel approaches to short range molecular dynamics simulations. 462-470 - Mark Friedell, Mark Vincent LaPolla, Sandeep Kochhar, Steve Sistare, Janusz Juda:
Visualizing the behavior of massively parallel programs. 472-480 - Aaron J. Goldberg, John L. Hennessy:
Performance debugging shared memory multiprocessor programs with MTOOL. 481-490 - Sue Utter-Honig, Cherri M. Pancake:
Graphical animation of parallel Fortran programs. 491-499 - Yao-Jen Chang, Jean-Lien C. Wu, Jingshown Wu:
Scheduling parallel programs with non-uniform parallelism profiles. 502-511 - Arthur Ieumwananonthachai, Akiko N. Aizawa, Steven R. Schwartz, Benjamin W. Wah, Jerry C. Yan:
Intelligent mapping of communicating processes in distributed computing systems. 512-521 - Yuetsu Kodama, Shuichi Sakai
, Yoshinori Yamaguchi:
Load balancing by function distribution on the EM-4 prototype. 522-531 - James D. Meindl:
Gigascale integration (GSI) technology. 534-538 - Dennis E. Willen:
Exploration geophysics, parallel computing and reality. 540 - Jeffrey M. Rutledge, David R. Jones, Wen H. Chen, Ernest Y. Chung:
Application issues for large scale reservoir simulation on massively parallel computers. 541 - R. P. Kendall, John R. Wallis, J. A. Foster, J. S. Nolen:
Large scale reservoir simulation in the concurrent processing milieu. 542 - Lauren L. Smith:
Vectorizing C compilers: how good are they? 544-553 - Raymond R. Glenn, Daniel V. Pryor, John M. Conroy, Theodore Johnson:
Characterizing memory hot spots in a shared memory MIMD machine. 554-566 - Ethan L. Miller, Randy H. Katz:
Input/output behavior of supercomputing applications. 567-576 - Anthony T. Chronopoulos:
Towards efficient parallel implementation of the CG method applied to a class of block tridiagonal linear systems. 578-587 - Claude Pommerell, Wolfgang Fichtner:
PILS: an iterative linear solver package for ill-conditioned systems. 588-599 - Joël M. Malard:
Threshold pivoting for dense LU factorization on distributed memory multiprocessors. 600-607 - Susan Flynn Hummel, Edith Schonberg, Lawrence E. Flynn:
Factoring: a practical and robust method for scheduling parallel loops. 610-632 - Tao Yang, Apostolos Gerasoulis:
A fast static scheduling algorithm for DAGs on an unbounded number of processors. 633-642 - Chunming Qiao, Rami G. Melhem:
Time-division optical communications in multiprocessor arrays. 644-653 - Sergio A. Felperin, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz:
Fully-adaptive routing: packet switching performance and wormhole algorithms. 654-663 - H. T. Kung, Robert D. Sansom, Steven Schlick, Peter Steenkiste
, Matthieu Arnould, Francois J. Bitz, Fred Christianson, Eric C. Cooper, Onat Menzilcioglu, Denise Ombres, Brian Zill:
Network-based multicomputers: an emerging parallel architecture. 664-673 - Robert C. Malone, Robert Chervin, Richard Smith, William P. Dannevik, John B. Drake:
Computing climate change: can we beat nature? 676 - Robert Chervin:
Climate modeling with parallel vector supercomputers. 677 - William P. Dannevik:
Computing modeling in a MIMD environment. 678 - R. D. Smith, J. K. Dukowicz, Robert C. Malone:
Ocean modeling on the connection machine. 679 - Tzi-cker Chiueh:
An integrated memory management scheme for dynamic alias resolution. 682-691 - Henk Corporaal, Hans M. Mulder:
MOVE: a framework for high-performance processor design. 692-701 - Peter L. Bird, Uwe F. Pleban:
A semantics-directed partitioning of a processor architecture. 702-709 - Marco Zagha, Guy E. Blelloch:
Radix sort for vector multiprocessors. 712-721 - Yasusi Kanada:
A method of vector processing for shared symbolic data. 722-731 - Hussein M. Alnuweiri:
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds. 732-739 - Howard Jay Siegel:
"Whither massive parallelism?". 740 - Kevin B. Theobald, Guang R. Gao:
An efficient parallel algorithm for all pairs examination. 742-753 - Mahn-ling Woo, Rosemary A. Renaut
:
Parallel power-of-two FFTs on hypercubes. 754-763 - P. J. Narayanan:
Analysis of replicated data algorithms on processor array architectures. 764-773 - Nian-Feng Tzeng:
Design of a highly reliable cube-connected cycles architecture. 776-785 - Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt:
Three-dimensional finite-element analyses: implications for computer architectures. 786-795 - James L. Tomkins, J. P. VanDyke:
Massively parallel computing and the mid-course tracking problem. 796-804 - Ingrid Y. Bucher, Margaret L. Simmons:
Measurement of memory access contentions in multiple vector processor systems. 806-817 - Yung-Chin Chen, Alexander V. Veidenbaum:
Comparison and analysis of software and directory coherence schemes. 818-829 - Ishfaq Ahmad, Arif Ghafoor, Kishan Mehrotra:
Performance prediction of distributed load balancing on multicomputer systems. 830-839 - Hong-Men Su, Pen-Chung Yew
:
Efficient Doacross execution on distributed shared-memory multiprocessors. 842-853 - Elana D. Granston, Alexander V. Veidenbaum:
Detecting redundant accesses to array data. 854-865 - Sesh Venugopal, Vijay K. Naik:
Effects of partitioning and scheduling sparse matrix factorization on communication and load balance. 866-875 - Tom Myers, Elizabeth Williams:
Mass storage requirements in the intelligence community. 878-889 - Nicholas S. Bowen, Dhiraj K. Pradhan:
A virtual memory translation mechanism to support checkpoint and rollback recovery. 890-899 - Marco Annaratone, Marco Fillo, M. Halbherr, Roland Rühl, P. Steiner, Marc A. Viredaz:
The K2 distributed memory parallel processor: architecture, compiler, and operating system. 900-909

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.