Table of Contents

• Evaluation of compiler optimizations for Fortran D on MIMD distributed memory machinesSeema Hiranandani, Ken Kennedy, Chau-Wen Tseng. 1-14 [doi]
• Evaluation of compiler generated parallel programs on three multicomputersRoland Rühl. 15-24 [doi]
• Automatic data mapping for distributed-memory parallel computersSkef Wholey. 25-34 [doi]
• Characterizing memory performance in vector multiprocessorsJ. E. Smith, W. R. Taylor. 35-44 [doi]
• Performance analysis of the CM-2, a massively parallel SIMD computerJukka Helin. 45-52 [doi]
• Evaluation of the lock mechanism in a snooping cacheToshiaki Tarui, Takayuki Nakagawa, Noriyasu Ido, Machiko Asaie, Mamoru Sugie. 53-62 [doi]
• Processor allocation and loop scheduling on multiprocessor computersNadia Tawbi, Paul Feautrier. 63-71 [doi]
• Low level scheduling using the hierarchical task graphDavid R. Wallace. 72-81 [doi]
• ABCL/onEM-4: a new software/hardware architecture for object-oriented concurrent computing on an extended dataflow supercomputerMasahiro Yasugi, Satoshi Matsuoka, Akinori Yonezawa. 93-103 [doi]
• Tolerating data access latency with register preloadingWilliam Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu, Tokuzo Kiyohara, Pohua P. Chang. 104-113 [doi]
• Supercomputing and transputersFalk Langhammer, Francis Wray. 114-128 [doi]
• Automatic software cache coherence through vectorizationErvan Darnell, John M. Mellor-Crummey, Ken Kennedy. 129-138 [doi]
• Life span strategy - a compiler-based approach to cache coherenceHoichi Cheong. 139-148 [doi]
• Conflict-free access of vectors with power-of-two stridesMateo Valero, Tomás Lang, Eduard Ayguadé. 149-156 [doi]
• Parallel program visualization using SIEVE.1Sekhar R. Sarukkai, Dennis Gannon. 157-166 [doi]
• The CODE 2.0 graphical parallel programming languagePeter Newton, James C. Browne. 167-177 [doi]
• Paralex: an environment for parallel programming in distributed systemsÖzalp Babaoglu, Lorenzo Alvisi, Alessandro Amoroso, Renzo Davoli, Luigi-Alberto Giachini. 178-187 [doi]
• Exploiting heterogeneous parallelism on a multithreaded multiprocessorGail A. Alverson, Robert Alverson, David Callahan, Brian Koblenz, Allan Porterfield, Burton J. Smith. 188-197 [doi]
• An architectural framework for migration from CISC to higher performance platformsGabriel M. Silberman, Kemal Ebcioglu. 198-215 [doi]
• Manchester data-flow: a progress reportJohn R. Gurd, David F. Snelling. 216-225 [doi]
• A comprehensive approach to parallel data flow analysisYong-Fong Lee, Barbara G. Ryder. 236-247 [doi]
• Register requirements of pipelined processorsWilliam H. Mangione-Smith, Santosh G. Abraham, Edward S. Davidson. 260-271 [doi]
• Benchmarking a vector-processor prototype based on multithreaded streaming/FIFO vector (MSFV) architectureTetsuo Hironaka, Takashi Hashimoto, Keizo Okazaki, Kazuaki Murakami, Shinji Tomita. 272-281 [doi]
• On storage schemes for parallel array accessZhiyong Liu, Xiaobo Li, Jia-Huai You. 282-291 [doi]
• A general algorithm for data dependence analysisChristine Eisenbeis, Jean-Claude Sogno. 292-302 [doi]
• On exact data dependence analysisKleanthis Psarris. 303-312 [doi]
• Array privatization for parallel execution of loopsZhiyuan Li. 313-322 [doi]
• Optimizing for parallelism and data localityKen Kennedy, Kathryn S. McKinley. 323-334 [doi]
• A transformational approach to compiling Sisal for distributed memory architecturesMichael F. P. O Boyle, G. A. Hedayat. 335-346 [doi]
• Automatic performance prediction to support parallelization of Fortran programs for massively parallel systemsThomas Fahringer, Roman Blasko, Hans P. Zima. 347-356 [doi]
• A methodology for high-level synthesis of communication on multicomputersManish Gupta, Prithviraj Banerjee. 357-367 [doi]
• A parallel execution environment for a sequential object oriented languageJean-Marc Jézéquel, F. André Bergheul. 368-376 [doi]
• Scheduling in parallel systems with a hierarchical organization of tasksS. P. Cheng, Sivarama P. Dandamudi. 377-386 [doi]
• A scalable, object-oriented finite element solver for partial differential equations on multicomputersGraham F. Carey, Joe Schmidt, Vineet Singh, Dennis Yelton. 387-396 [doi]
• Experiments with an ocean circulation model on CEDARLuiz De Rose, Kyle Gallivan, Efstratios Gallopoulos. 397-408 [doi]
• Minimizing the Lennard-Jones potential function on a massively parallel computerGuoliang Xue, R. S. Maier, J. Ben Rosen. 409-416 [doi]
• Supercomputing out of recycled garbage: preliminary experience with PiranhaDavid Gelernter, David Kaminsky. 417-427 [doi]
• PYRROS: static task scheduling and code generation for message passing multiprocessorsTao Yang, Apostolos Gerasoulis. 428-437 [doi]
• Compiler and runtime support for irregularly coupled regular meshesCraig M. Chase, Kay Crowley, Joel H. Saltz, Anthony P. Reeves. 438-446 [doi]
• Parallel SAS multicluster algorithms for solving linear systems with reflexive coefficient matricesHsin-Chu Chen. 447-455 [doi]
• Orthogonal s-step methods for nonsymmetric linear systems of equationsCharles D. Swanson, Anthony T. Chronopoulos. 456-465 [doi]
• Speedup of band linear recurrences in the presence of resource constraintsHaigeng Wang, Alexandru Nicolau. 466-477 [doi]
• Preconditioning parallel multisplittings for solving linear systems of equationsChiou-Ming Huang, Dianne P. O Leary. 478-484 [doi]