ICS 1996: Philadelphia, PA, USA

• Antonio Lain, Prithviraj Banerjee:
  Compiler Support for Hybrid Irregular Accesses on Multicomputers. 1-9
  
• Henk J. Sips, Kees van Reeuwijk, Will Denissen:
  Analysis of Local Enumeration and Storage Schemes in HPF. 10-17
  
• Toshio Suganuma, Hideaki Komatsu, Toshio Nakatani:
  Detection and Global Optimization of Reduction Operations for Distributed Parallel Machines. 18-25
  
• Yan Yang Xiao, John K. Bennett:
  Memory Organization in Multi-Channel Optical Networks: NUMA and COMA Revisited. 26-34
  
• Stefanos Kaxiras, James R. Goodman:
  The GLOW Cache Coherence Protocol Extensions for Widely Shared Data. 35-43
  
• Jai-Hoon Kim, Nitin H. Vaidya:
  A Cost-Comparison Approach for Adaptive Distributed Shared Memory. 44-51
  
• Wayne Kelly, William Pugh:
  Minimizing Communication While Preserving Parallelism. 52-60
  
• Akimasa Yoshida, Kenichi Koshizuka, Hironori Kasahara:
  Data-Localization for Fortran Macro-Dataflow Computation Using Partial Static Task Assignment. 61-68
  
• R. Bruce Irvin, Barton P. Miller:
  Mapping Performance Data for High-Level and Data Views of Parallel Program Performance. 69-77
  
• Manuel Ujaldon, Shamik D. Sharma, Emilio L. Zapata, Joel H. Saltz:
  Experimental Evaluation of Efficient Sparse Matrix Distributions. 78-85
  
• Robert van Engelen, Lex Wolters, Gerard Cats:
  CTADEL: A Generator of Multi-Platform High Performance Codes for PDE-Based Scientific Applications. 86-93
  
• Marios D. Dikaiakos, Joachim Stadel:
  A Performance Study of Cosmological Simulations on Message-Passing and Shared-Memory Multiprocessors. 94-101
  
• Srinivas Aluru:
  Parallel Additive Lagged Fibonacci Random Number Generators. 102-108
  
• Juan J. Navarro, Elena García-Diego, José R. Herrero:
  Data Prefetching and Multilevel Blocking for Linear Algebra Operations. 109-116
  
• Salvatore Orlando, Raffaele Perego:
  A Template for Non-Uniform Parallel Loops Based on Dynamic Scheduling and Prefetching Techniques. 117-124
  
• Sally A. McKee, Assaji Aluwihare, Benjamin H. Clark, Robert H. Klenke, Trevor C. Landon, Christopher W. Oliver, Maximo H. Salinas, Adam E. Szymkowiak, Kenneth L. Wright, William A. Wulf, James H. Aylor:
  Design and Evaluation of Dynamic Access Ordering Hardware. 125-132
  
• Luddy Harrison:
  Examination of a Memory Access Classification Scheme for Pointer-Intensive and Numeric Programs. 133-140
  
• Liuxi Yang, Josep Torrellas:
  Optimizing Primary Data Caches for Parallel Scientific Applications: The Pool Buffer Approach. 141-148
  
• Elise de Doncker, Ajay K. Gupta, Jay Ball, Patricia Ealy, Alan Genz:
  ParInt: A Software Package for Parallel Integration. 149-156
  
• Jérôme Galtier:
  Automatic Partitioning Techniques for Solving Partial Differential Equations on Irregular Adaptive Meshes. 157-164
  
• Karen A. Tomko, Edward S. Davidson:
  Profile Driven Weighted Decomposition. 165-172
  
• Kaushik Ghosh, Stephen R. Breit:
  Evaluating the Limits of Message Passing via the Shared Attraction Memory on CC-COMA Machines: Experiences with TCGMSG and PVM. 173-180
  
• N. S. Sundar, D. N. Jayasimha, Dhabaleswar K. Panda, P. Sadayappan:
  Hybrid Algorithms for Complete Exchange in 2D Meshes. 181-188
  
• Rob F. Van der Wijngaart, Sekhar R. Sarukkai, Pankaj Mehra:
  The Effect of Interrupts on Software Pipeline Execution on Message-Passing Architectures. 189-196
  
• Hesham Keshk, Shin-ichiro Mori, Hiroshi Nakashima, Shinji Tomita:
  Amon2: A Parallel Wire Routing Algorithm on a Torus Network Parallel Computer. 197-204
  
• Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka:
  Parallel Construction of Multidimensional Binary Search Trees. 205-212
  
• Andrew Sohn, Rupak Biswas:
  Satisfiability Test with Synchronous Simulated Annealing on the Fujitsu AP1000 Massively-Parallel Multiprocessor. 213-220
  
• Sanjeev Krishnan, Laxmikant V. Kalé:
  Automating Parallel Runtime Optimizations Using Post-Mortem Analysis. 221-228
  
• M. Ranganathan, Anurag Acharya, Guy Edjlali, Alan Sussman, Joel H. Saltz:
  Runtime Coupling of Data-Parallel Programs. 229-236
  
• Cong Fu, Tao Yang:
  Run-Time Compilation for Parallel Sparse Matrix Computations. 237-244
  
• Rahmat S. Hyder, David A. Wood:
  Synchronization Hardware for Networks of Workstations: Performance vs. Cost. 245-252
  
• Akhilesh Kumar, Laxmi N. Bhuyan:
  Evaluating Virtual Channels for Cache-Coherent Shared-Memory Multiprocessors. 253-260
  
• Pierre-Yves Calland, Alain Darte, Yves Robert:
  A New Guaranteed Heuristic for the Software Pipelining Problem. 261-269
  
• Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa:
  A Register Allocation Technique Using Guarded PDG. 270-277
  
• Philippe Clauss:
  Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs. 278-285
  
• Michael E. Thomadakis, Jyh-Charn Liu:
  An Efficient Steepest-Edge Simplex Algorithm for SIMD Computers. 286-293
  
• Ester M. Garzón, Inmaculada García:
  Parallel Implementation of the Lanczos Method for Sparse Matrices: Analysis of Data Distributions. 294-300
  
• Juan J. Navarro, Elena García-Diego, Josep-Lluis Larriba-Pey, Toni Juan:
  Block Algorithms for Sparse Matrix Computations on High Performance Workstations. 301-308
  
• Luiz De Rose, David A. Padua:
  A MATLAB to Fortran 90 Translator and Its Effectiveness. 309-316
  
• Saniya Ben Hassen, Henri E. Bal:
  Integrating Task and Data Parallelism Using Shared Objects. 317-324
  
• Anurag Acharya:
  Eliminating Redundant Barrier Synchronizations in Rule-Based Programs. 325-332
  
• Harvey J. Wasserman:
  Benchmark Tests on the Digital Equipment Corporation Alpha AXP 21164-based AlphaServer 8400, Including a Comparison of Optimized Vector and Superscalar Processing. 333-340
  
• Todd W. Mummert, Corey Kosak, Peter Steenkiste, Allan Fisher:
  Fine Grain Parallel Communication on General Purpose LANs. 341-349
  
• Alexandre Farcy, Olivier Temam:
  Improving Single-Process Performance with Multithreaded Processors. 350-357
  
• Gagan Agrawal, Anurag Acharya, Joel H. Saltz:
  An Interprocedural Framework for Placement of Asynchronous I/O Operations. 358-365
  
• Rajesh Bordawekar, Alok N. Choudhary, J. Ramanujam:
  Automatic Optimization of Communication in Compiling Out-of-Core Stencil Codes. 366-373
  
• Nils Nieuwejaar, David Kotz:
  The Galley Parallel File System. 374-381
  
• A. M. del Corral, José M. Llabería:
  Reducing Inter-Vector-Conflicts in Complex Memory Systems. 382-389
  
• Jaques Jorda, Abdelaziz Mzoughi, O. Lafontaine, Daniel Litaize:
  Performance of the Vectorial Processor VEC-SM2 Using Serial Multiport Memory. 390-397
  
• Shantanu Dutt, Nam Trinh:
  Are There Advantages to High-Dimension Architectures? Analysis of k-ary n-Cubes for the Class of Parallel Divide-and-Conquer Algorithms. 398-406
  

Last update Tue May 21 17:05:10 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page