Abstract is missing.
- Parallel computer ADENART - its architecture and applicationHiroshi Kadota, Katsuyuki Kaneko, I. Okabayashi, T. Okamoto, T. Mimura, Yasuhiro Nakakura, A. Wakatani, Masaitsu Nakajima, J. Nishikawa, K. Zaiki, Tatsuo Nogi. 1-8 [doi]
- The HyperDynamic architecture (massively parallel message-passing machine) - architecture and performanceHojung Cha, Peter Jones. 9-19 [doi]
- High performance communication for MIMD supercomputersJochen Gries, Axel Hahlweg, Ralf Harneit, Axel Kern, Hans Christoph Zeidler. 20-27 [doi]
- Behavioral characterization of decoupled access/execute architectureDaniel Windheiser, William Jalby. 28-39 [doi]
- A space-efficient parallel garbage compaction algorithmWolfgang Küchlin. 40-46 [doi]
- Vectorization and parallelization of irregular problems via graph coloringHans-Christian Hege, Hinnerk Stüben. 47-56 [doi]
- Sequential description and parallel execution language DFCII dataflow supercomputersSatoshi Sekiguchi, Toshio Shimada, Kei Hiraki. 57-66 [doi]
- GRACIA: a software environment for graphical specification, automatic configuration and animation of parallel programsOttmar Krämer-Fuhrmann, T. Brandes. 67-74 [doi]
- A scheme to extract run-time parallelism form sequential loopsChinhyun Kim, Jean-Luc Gaudiot. 75-84 [doi]
- Compiler algorithms for event variable synchronizationZhiyuan Li. 85-95 [doi]
- Work distribution in parallel programs for distributed memory multiprocessorsMichael Gerndt. 96-104 [doi]
- Routing and processor allocation on a Hypercycle-based multiprocessorNikitas J. Dimopoulos, Shivakumar Radhakrishnan, Don Radvan. 105-114 [doi]
- Dynamic and static load scheduling performance on a NUMA shared memory multiprocessorXiaodong Zhang. 128-135 [doi]
- An algorithm for the generalized singular value decomposition on massively parallel computersHaesun Park, L. Magnus Ewerbring. 136-145 [doi]
- Exploiting parallelism in automatic differentiationChristian H. Bischof, Andreas Griewank, David W. Juedes. 146-153 [doi]
- Three-dimensional simulation of semiconductor devices on supercomputersKarl P. Traar, Martin Stiftinger, Otto Heinreichsberger, Siegfried Selberherr. 154-162 [doi]
- Parallel conjugate gradient algorithms for solving the Neutron Diffusion Equation on SUPERNUMA. Böhm, Jürgen Brehm, H. Finnemann. 163-171 [doi]
- Beyond loop partitioning: data assignment and overlap to reduce communication overheadDavid E. Hudak, Santosh G. Abraham. 172-182 [doi]
- Automatic transformation of FORTRAN loops to reduce cache conflictsSesh Venugopal, William Eventoff. 183-193 [doi]
- Optimization of array accesses by collective loop transformationsVivek Sarkar, Guang R. Gao. 194-205 [doi]
- Loop partitioning for distributed memory multiprocessors as unimodular transformationsDattatraya Kulkarni, Kamlesh G. Kumar, Anupam Basu, Arogyaswami Paulraj. 206-215 [doi]
- A systolic array processor for biological information signal processingE. T. Chow, J. C. Peterson, Michael S. Waterman, Tim Hunkapiller, B. A. Zimmermann. 216-223 [doi]
- Software and hardware parallelism on the iWarp multi-computerHerbert G. Mayer, Brent Baxter. 224-233 [doi]
- Strip mining on SIMD architecturesMichael Weiss. 234-243 [doi]
- The hierarchical task graph and its use in auto-schedulingConstantine D. Polychronopoulos. 252-263 [doi]
- Accurate modelling of interconnection networks in vector supercomputersJ. E. Smith, W. R. Taylor. 264-273 [doi]
- Combining hardware and software cache coherence strategiesDavid J. Lilja, Pen-Chung Yew. 274-283 [doi]
- A software coherence scheme with the assistance of directoriesYung-Chin Chen, Alexander V. Veidenbaum. 284-294 [doi]
- Mesh and pyramid algorithms for iconic indexingAlok N. Choudhary, Sanjay Ranka. 295-303 [doi]
- Implementing partition on vector computersMarkus Hegland. 304-311 [doi]
- A parallel genetic algorithm for the graph partitioning problemEl-Ghazali Talbi, Pierre Bessière. 312-320 [doi]
- Experiences with data dependence abstractionsMichael Wolfe. 321-329 [doi]
- Extending the I test to direction vectorsKleanthis Psarris, Xiangyun Kong, David Klappholz. 330-340 [doi]
- Uniform techniques for loop optimizationWilliam Pugh. 341-352 [doi]
- Supercomputers: where are the lost cycles?Willi Schönauer, Hartmut Häfner. 353-364 [doi]
- Parallel programs and background load: efficiency studies with the PAR-Bench systemWolfgang E. Nagel, Markus A. Linn. 365-375 [doi]
- Analyzing the performance of message passing MIMD Hypercubes: a study with the Intel iPSC/860Jukka Helin, Rudolf Berrendorf. 376-385 [doi]
- Parallel program behavioral study on a shared-memory multiprocessorHock-Beng Lim, Pen-Chung Yew. 386-395 [doi]
- Analysis of scalability of parallel algorithms and architectures: a surveyVipin Kumar, Anshul Gupta. 396-405 [doi]
- Solving banded systems using a parallel programming language with hierarchically data descriptive featuresFujio Yamamoto. 406-413 [doi]
- PATCH - a new algorithm for rapid incremental dependence analysisWilliam F. Appelbe, Kevin Smith, Kurt Stirewalt. 424-432 [doi]
- Analysis and transformation in the ParaScope editorKen Kennedy, Kathryn S. McKinley, Chau-Wen Tseng. 433-447 [doi]
- A performance bound analysis of multistage combining networks using a probabilistic modelByung-Chang Kang, Gyungho Lee, Richard Y. Kain. 448-457 [doi]
- Supercomputer workload decomposition and analysisDavid K. Bradley, George Cybenko, John L. Larson, F. Ahmad, J. Golab, M. Straka. 458-467 [doi]