Abstract is missing.
- Fine-Grain Scheduling under Resource ConstraintsPaul Feautrier. 1-15
- Mutation Scheduling: A Unified Approach to Compiling for Fine-Grain ParallelismSteven Novack, Alexandru Nicolau. 16-30
- Compiler Techniques for Fine-Grain Execution on Workstation Clusters Using PAPERSHenry G. Dietz, William E. Cohen, T. Muhammad, Timothy Mattox. 31-45
- Solving Alignment Using Elementary Linear AlgebraDavid Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, Paul Stodghill. 46-60
- Detecting and Using Affinity in an Automatic Data Distribution ToolEduard Ayguadé, Jordi Garcia, Mercè Gironés, Jesús Labarta, Jordi Torres, Mateo Valero. 61-75
- Array Distribution in Data-Parallel ProgramsSiddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert. 76-91
- Communication-Free Parallelization via Affine TransformationsAmy W. Lim, Monica S. Lam. 92-106
- Finding Legal Reordering Transformations Using MappingsWayne Kelly, William Pugh. 107-124
- A New Algorithm for Global Optimization for Parallelism and LocalityWilliam F. Appelbe, Srinivas Doddapaneni, Charles Hardnett. 125-140
- Polaris: Improving the Effectiveness of Parallelizing CompilersWilliam Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay Hoeflinger, David A. Padua, Paul Petersen, William M. Pottenger, Lawrence Rauchwerger, Peng Tu, Stephen Weatherford. 141-154
- A Formal Approach to the Compilation of Data-Parallel LanguagesJ. A. Trescher, Leo C. Breebaart, P. F. G. Dechering, A. B. Poelman, J. P. M. de Vreught, Henk J. Sips. 155-169
- The Data Partitioning Graph: Extending Data and Control Dependencies for Data PartitioningTsuneo Nakanishi, Kazuki Joe, Akira Fukuda, Keijiro Araki, Hideki Saito, Constantine D. Polychronopoulos. 170-185
- Detecting Value-Based Scalar DependenceEric Stoltz, Michael Wolfe. 186-200
- Minimal Data Dependence Abstractions for Loop TransformationsYi-Qing Yang, Corinne Ancourt, François Irigoin. 201-216
- Differences in Algorithmic Parallelism in Control Flow and Call MultigraphsVincent Sgro, Barbara G. Ryder. 217-233
- Flow-Insensitive Interprocedural Alias Analysis in the Presence of PointersMichael G. Burke, Paul R. Carini, Jong-Deok Choi, Michael Hind. 234-250
- Incremental Generation of Index Sets for Array Statement Execution on Distributed-Memory MachinesS. D. Kaushik, Chua-Huang Huang, P. Sadayappan. 251-265
- A Unified Data-Flow Framework for Optimizing CommunicationManish Gupta, Edith Schonberg, Harini Srinivasan. 266-282
- Interprocedural Communication Optimizations for Distributed Memory CompilationGagan Agrawal, Joel H. Saltz. 283-299
- Analysis of Event Synchronization in Parallel ProgramsJ. Ramanujam, A. Mathew. 300-315
- Computing Communication Sets for Control Parallel ProgramsJeanne Ferrante. 316-330
- Optimizing Parallel SPMD ProgramsArvind Krishnamurthy, Katherine A. Yelick. 331-345
- An Overview of the Opus Language and Runtime SystemPiyush Mehrotra, Matthew Haines. 346-360
- SIMPLE Performance Results in ZPLCalvin Lin, Lawrence Snyder. 361-375
- ::::Cid::::: A Parallel, Shared-Memory C for Distributed-Memory MachinesRishiyur S. Nikhil. 376-390
- EQ: Overview of a New Language Approach for Prototyping Scientific ComputationThomas Derby, Robert B. Schnabel, Benjamin G. Zorn. 391-405
- Reshaping Access Patterns for Generating Sparse CodesAart J. C. Bik, Peter M. W. Knijnenburg, Harry A. G. Wijshoff. 406-420
- Evaluating Two Loop Transformations for Reducing Multiple Writer False SharingFrançois Bodin, Elana D. Granston, Thierry Montaut. 421-439
- Parallelizing Tree Algorithms: Overhead vs. ParallelismJon A. Solworth, Bryan Reagan. 440-454
- Autoscheduling in a Distributed Shared-Memory EnvironmentJosé E. Moreira, Constantine D. Polychronopoulos. 455-471
- Optimizing Array Distributions in Data-Parallel ProgramsKrishna Kunchithapadam, Barton P. Miller. 472-486
- Automatic Reduction Tree Generation for Fine-Grain Parallel Architectures when Iteration Count is UnknownSatoshi Sekiguchi, Kei Hiraki. 487-496