ICS '94, Proceedings of the 8th ACM International Conference on Supercomputing, July 11-15, 1994, Manchester, UK. ACM, 1994

• 
  Katsuyoshi Kitai, Tadaaki Isobe, Tadayuki Sakakibara, Shigeko Yazawa, Yoshiko Tamaki, Teruo Tanaka, Kouichi Ishii: Distributed storage control unit for the Hitachi S-3800 multivector supercomputer. 1-10
• 
  William Marcus Miller, Walid A. Najjar, A. P. Wim Böhm: A model for dataflow based vector execution. 11-22
• 
  Montse Peiron, Mateo Valero, Eduard Ayguadé: Synchronized access to streams in SIMD vector multiprocessors. 23-32
• 
  Lawrence Rauchwerger, David A. Padua: The privatizing DOALL test: a run-time technique for DOALL loop identification and array privatization. 33-43
• 
  Peiyi Tang, John N. Zigman: Reducing data communication overhead for DOACROSS loop nests. 44-53
• 
  Kathryn S. McKinley: Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors. 54-63
• 
  Shubhendu S. Mukherjee, Mark D. Hill: An evaluation of directory protocols for medium-scale shared-memory multiprocessors. 64-74
• 
  Farnaz Mounes-Toussi, David J. Lilja, Zhiyuan Li: An evaluation of a compiler optimization for improving the performance of a coherence directory. 75-84
• 
  Gregory K. Egan, Graham D. Riley, J. Mark Bull: Parallelisation of the SDEM distinct element stress analysis code on the KSR-1. 85-92
• 
  C. Domain, J.-P. Grégoire, Bernadette Thomas: Ultrasonic wave propagation on parallel machines. 93-97
• 
  Li-Ling Chen, Williams Ludwell Harrison III: An efficient approach to computing fixpoints for complex program analysis. 98-106
• 
  Waleed Meleis, Edward S. Davidson: Optimal local register allocation for a multiple-issue machine. 107-116
• 
  Xavier Redon, Paul Feautrier: Scheduling reductions. 117-125
• 
  Yih-jia Tsai, Philip K. McKinley: A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks. 126-135
• 
  Swaminathan Ramany, Derek L. Eager: The interaction between virtual channel flow control and adaptive routing in wormhole networks. 136-145
• 
  Suresh Chalasani, Rajendra V. Boppana: Fault-tolerant wormhole routing in tori. 146-155
• 
  Thomas T. Kwan, Daniel A. Reed: Performance of the CM-5 scalable file system. 156-165
• 
  Eric L. Boyd, Edward S. Davidson: Communication in the KSR1 MPP: performance evaluation using synthetic workload experiments. 166-175
• 
  Thomas R. Gross, Peter Steenkiste: Architecture implications of high-speed I/O for distributed-memory computers. 176-185
• 
  Oscar G. Plata, Francisco F. Rivera: Combining static and dynamic scheduling on distributed-memory multiprocessors. 186-195
• 
  Lars Lundberg, Håkan Lennerstad: An optimal upper bound on the minimal completion time in distributed supercomputing. 196-203
• 
  Yeong-Sheng Chen, Sheng-De Wang, Chien-Min Wang: Compiler techniques for maximizing fine-grain and coarse-grain parallelism in loops with uniform dependences. 204-213
• 
  Karen A. Tomko, Santosh G. Abraham: Data and program restructuring of irregular applications for cache-coherent multiprocessor. 214-225
• 
  Aart J. C. Bik, Harry A. G. Wijshoff: Nonzero structure analysis. 226-235
• 
  Antonio Lain, Prithviraj Banerjee: Techniques to overlap computation and communication in irregular iterative applications. 236-245
• 
  Vipul Gupta, Eugen Schenfeld: Performance analysis of a synchronous, circuit-switched interconnection cached network. 246-255
• 
  Yuanyuan Yang: An analysis model on nonblocking multirate broadcast networks. 256-263
• 
  Hui Li, Kenneth C. Sevcik: Exploiting cache affinity in software cache coherence. 264-273
• 
  Rohit Chandra, Kourosh Gharachorloo, Vijayaraghavan Soundararajan, Anoop Gupta: Performance evaluation of hybrid hardware and software distributed shared memory protocols. 274-288
• 
  Lex Wolters, Gerard Cats, Nils Gustafsson: Limited area numerical weather forecasting on a massively parallel computer. 289-296
• 
  Hideo Matsuda, Gary J. Olsen, Ross A. Overbeek, Yukio Kaneda: Fast phylogenetic analysis on a massively parallel machine. 297-302
• 
  Arjan J. C. van Gemund: Compiling performance models from parallel programs. 303-312
• 
  Margaret A. Schaar, Kemal Efe, Weijia Shang: Queueing performance analysis of co-scheduling in a pool of processors environment. 313-322
• 
  Sekhar R. Sarukkai, Jerry C. Yan, Jacob Gotwals: Normalized performance indices for message passing parallel programs. 323-332
• 
  Jeffrey D. Gee, Alan Jay Smith: The effectiveness of caches for vector processors. 333-343
• 
  Olivier Temam, Yvon Jégou: Using virtual lines to enhance locality exploitation. 344-352
• 
  Juan J. Navarro, Toni Juan, Tomás Lang: MOB forms: a class of multilevel block algorithms for dense linear algebra operations. 354-363
• 
  S. D. Kaushik, Chua-Huang Huang, Rodney W. Johnson, P. Sadayappan: An approach to communication-efficient data redistribution. 364-373
• 
  Tatsuya Shindo, Hidetoshi Iwashita, Shaun Kaneshiro, Tsunehisa Doi, Junichi Hagiwara: Twisted data layout. 374-381
• 
  Rajeev Thakur, Rajesh Bordawekar, Alok N. Choudhary: Compiler and runtime support for out-of-core HPF programs. 382-391
• 
  Seema Hiranandani, Ken Kennedy, John M. Mellor-Crummey, Ajay Sethi: Compilation techniques for block-cyclic distributions. 392-403
• 
  Josep-Lluis Larriba-Pey, Juan J. Navarro, Oriol Roig, Angel Jorba: A generalized vision of some parallel bidiagonal systems solvers. 404-411
• 
  Sumit Sur, A. P. Wim Böhm: Analysis of non-strict functional implementations of the Dongarra-Sorensen eigensolver. 412-418
• 
  Kyle Gallivan, Bret A. Marsolf, Harry A. G. Wijshoff: The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization. 419-430
• 
  Bharat Kumar, P. Sadayappan, Chua-Huang Huang: On sparse matrix reordering for parallel factorization. 431-438