ICS 1991: Cologne, Germany

• Hiroshi Kadota, Katsuyuki Kaneko, I. Okabayashi, T. Okamoto, T. Mimura, Yasuhiro Nakakura, Akiyoshi Wakatani, Masaitsu Nakajima, J. Nishikawa, K. Zaiki, Tatsuo Nogi:
  Parallel computer ADENART - its architecture and application. 1-8
  
• Hojung Cha, Peter Jones:
  The HyperDynamic architecture (massively parallel message-passing machine) - architecture and performance. 9-19
  
• Jochen Gries, Axel Hahlweg, Ralf Harneit, Axel Kern, Hans Christoph Zeidler:
  High performance communication for MIMD supercomputers. 20-27
  
• Daniel Windheiser, William Jalby:
  Behavioral characterization of decoupled access/execute architecture. 28-39
  
• Wolfgang Küchlin:
  A space-efficient parallel garbage compaction algorithm. 40-46
  
• Hans-Christian Hege, Hinnerk Stüben:
  Vectorization and parallelization of irregular problems via graph coloring. 47-56
  
• Satoshi Sekiguchi, Toshio Shimada, Kei Hiraki:
  Sequential description and parallel execution language DFCII dataflow supercomputers. 57-66
  
• Ottmar Krämer-Fuhrmann, T. Brandes:
  GRACIA: a software environment for graphical specification, automatic configuration and animation of parallel programs. 67-74
  
• Chinhyun Kim, Jean-Luc Gaudiot:
  A scheme to extract run-time parallelism form sequential loops. 75-84
  
• Zhiyuan Li:
  Compiler algorithms for event variable synchronization. 85-95
  
• Michael Gerndt:
  Work distribution in parallel programs for distributed memory multiprocessors. 96-104
  
• Nikitas J. Dimopoulos, Shivakumar Radhakrishnan, Don Radvan:
  Routing and processor allocation on a Hypercycle-based multiprocessor. 105-114
  
• Nikos Chrisochoides, Elias N. Houstis, Catherine E. Houstis:
  Geometry based mapping strategies for PDE computations. 115-127
  
• Xiaodong Zhang:
  Dynamic and static load scheduling performance on a NUMA shared memory multiprocessor. 128-135
  
• Haesun Park, L. Magnus Ewerbring:
  An algorithm for the generalized singular value decomposition on massively parallel computers. 136-145
  
• Christian H. Bischof, Andreas Griewank, David W. Juedes:
  Exploiting parallelism in automatic differentiation. 146-153
  
• Karl P. Traar, Martin Stiftinger, Otto Heinreichsberger, Siegfried Selberherr:
  Three-dimensional simulation of semiconductor devices on supercomputers. 154-162
  
• A. Böhm, Jürgen Brehm, H. Finnemann:
  Parallel conjugate gradient algorithms for solving the Neutron Diffusion Equation on SUPERNUM. 163-171
  
• David E. Hudak, Santosh G. Abraham:
  Beyond loop partitioning: data assignment and overlap to reduce communication overhead. 172-182
  
• Sesh Venugopal, William Eventoff:
  Automatic transformation of FORTRAN loops to reduce cache conflicts. 183-193
  
• Vivek Sarkar, Guang R. Gao:
  Optimization of array accesses by collective loop transformations. 194-205
  
• Dattatraya Kulkarni, Kamlesh G. Kumar, Anupam Basu, Arogyaswami Paulraj:
  Loop partitioning for distributed memory multiprocessors as unimodular transformations. 206-215
  
• E. T. Chow, J. C. Peterson, Michael S. Waterman, Tim Hunkapiller, B. A. Zimmermann:
  A systolic array processor for biological information signal processing. 216-223
  
• Herbert G. Mayer, Brent Baxter:
  Software and hardware parallelism on the iWarp multi-computer. 224-233
  
• Michael Weiss:
  Strip mining on SIMD architectures. 234-243
  
• François Irigoin, Pierre Jouvelot, Rémi Triolet:
  Semantical interprocedural parallelization: an overview of the PIPS project. 244-251
  
• Constantine D. Polychronopoulos:
  The hierarchical task graph and its use in auto-scheduling. 252-263
  
• J. E. Smith, W. R. Taylor:
  Accurate modelling of interconnection networks in vector supercomputers. 264-273
  
• David J. Lilja, Pen-Chung Yew:
  Combining hardware and software cache coherence strategies. 274-283
  
• Yung-Chin Chen, Alexander V. Veidenbaum:
  A software coherence scheme with the assistance of directories. 284-294
  
• Alok N. Choudhary, Sanjay Ranka:
  Mesh and pyramid algorithms for iconic indexing. 295-303
  
• Markus Hegland:
  Implementing partition on vector computers. 304-311
  
• El-Ghazali Talbi, Pierre Bessière:
  A parallel genetic algorithm for the graph partitioning problem. 312-320
  
• Michael Wolfe:
  Experiences with data dependence abstractions. 321-329
  
• Kleanthis Psarris, Xiangyun Kong, David Klappholz:
  Extending the I test to direction vectors. 330-340
  
• William Pugh:
  Uniform techniques for loop optimization. 341-352
  
• Willi Schönauer, Hartmut Häfner:
  Supercomputers: where are the lost cycles? 353-364
  
• Wolfgang E. Nagel, Markus A. Linn:
  Parallel programs and background load: efficiency studies with the PAR-Bench system. 365-375
  
• Jukka Helin, Rudolf Berrendorf:
  Analyzing the performance of message passing MIMD Hypercubes: a study with the Intel iPSC/860. 376-385
  
• Hock-Beng Lim, Pen-Chung Yew:
  Parallel program behavioral study on a shared-memory multiprocessor. 386-395
  
• Vipin Kumar, Anshul Gupta:
  Analysis of scalability of parallel algorithms and architectures: a survey. 396-405
  
• Fujio Yamamoto:
  Solving banded systems using a parallel programming language with hierarchically data descriptive features. 406-413
  
• Charles Koelbel, Piyush Mehrotra:
  Programming data parallel algorithms on distributed memory using Kali. 414-423
  
• William F. Appelbe, Kevin Smith, Kurt Stirewalt:
  PATCH - a new algorithm for rapid incremental dependence analysis. 424-432
  
• Ken Kennedy, Kathryn S. McKinley, Chau-Wen Tseng:
  Analysis and transformation in the ParaScope editor. 433-447
  
• Byung-Chang Kang, Gyungho Lee, Richard Y. Kain:
  A performance bound analysis of multistage combining networks using a probabilistic model. 448-457
  
• David K. Bradley, George Cybenko, John L. Larson, F. Ahmad, J. Golab, M. Straka:
  Supercomputer workload decomposition and analysis. 458-467
  

Last update Thu May 23 00:04:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page