LCPC 1994: Ithaca, NY, USA

Keshav Pingali, Utpal Banerjee, David Gelernter, Alexandru Nicolau, David A. Padua (Eds.): Languages and Compilers for Parallel Computing, 7th International Workshop, LCPC'94, Ithaca, NY, USA, August 8-10, 1994, Proceedings. Lecture Notes in Computer Science 892 Springer 1995, ISBN 3-540-58868-X BibTeX

@proceedings{DBLP:conf/lcpc/1994,
  editor    = {Keshav Pingali and
               Utpal Banerjee and
               David Gelernter and
               Alexandru Nicolau and
               David A. Padua},
  title     = {Languages and Compilers for Parallel Computing, 7th International
               Workshop, LCPC'94, Ithaca, NY, USA, August 8-10, 1994, Proceedings},
  booktitle = {LCPC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {892},
  year      = {1995},
  isbn      = {3-540-58868-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Starting Small: Fine-Grain Parallelism

Paul Feautrier: Fine-Grain Scheduling under Resource Constraints. 1-15 BibTeX
Steven Novack, Alexandru Nicolau: Mutation Scheduling: A Unified Approach to Compiling for Fine-Grain Parallelism. 16-30 BibTeX
Henry G. Dietz, William E. Cohen, T. Muhammad, Timothy Mattox: Compiler Techniques for Fine-Grain Execution on Workstation Clusters Using PAPERS. 31-45 BibTeX

Getting Your Ducks in a Row: Alignment and Distribution

David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, Paul Stodghill: Solving Alignment Using Elementary Linear Algebra. 46-60 BibTeX
Eduard Ayguadé, Jordi Garcia, Mercè Gironés, Jesús Labarta, Jordi Torres, Mateo Valero: Detecting and Using Affinity in an Automatic Data Distribution Tool. 61-75 BibTeX
Siddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert: Array Distribution in Data-Parallel Programs. 76-91 BibTeX

Postlinear Loop Transformations

Amy W. Lim, Monica S. Lam: Communication-Free Parallelization via Affine Transformations. 92-106 BibTeX
Wayne Kelly, William Pugh: Finding Legal Reordering Transformations Using Mappings. 107-124 BibTeX
William F. Appelbe, Srinivas Doddapaneni, Charles Hardnett: A New Algorithm for Global Optimization for Parallelism and Locality. 125-140 BibTeX

What Next?

William Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay Hoeflinger, David A. Padua, Paul Petersen, William M. Pottenger, Lawrence Rauchwerger, Peng Tu, Stephen Weatherford: Polaris: Improving the Effectiveness of Parallelizing Compilers. 141-154 BibTeX
J. A. Trescher, Leo C. Breebaart, P. F. G. Dechering, A. B. Poelman, J. P. M. de Vreught, Henk J. Sips: A Formal Approach to the Compilation of Data-Parallel Languages. 155-169 BibTeX
Tsuneo Nakanishi, Kazuki Joe, Akira Fukuda, Keijiro Araki, Hideki Saito, Constantine D. Polychronopoulos: The Data Partitioning Graph: Extending Data and Control Dependencies for Data Partitioning. 170-185 BibTeX

Back to Basics: Program Analysis

Eric Stoltz, Michael Wolfe: Detecting Value-Based Scalar Dependence. 186-200 BibTeX
Yi-Qing Yang, Corinne Ancourt, François Irigoin: Minimal Data Dependence Abstractions for Loop Transformations. 201-216 BibTeX
Vincent Sgro, Barbara G. Ryder: Differences in Algorithmic Parallelism in Control Flow and Call Multigraphs. 217-233 BibTeX
Michael G. Burke, Paul R. Carini, Jong-Deok Choi, Michael Hind: Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers. 234-250 BibTeX

How to Communicate Better

S. D. Kaushik, Chua-Huang Huang, P. Sadayappan: Incremental Generation of Index Sets for Array Statement Execution on Distributed-Memory Machines. 251-265 BibTeX
Manish Gupta, Edith Schonberg, Harini Srinivasan: A Unified Data-Flow Framework for Optimizing Communication. 266-282 BibTeX
Gagan Agrawal, Joel H. Saltz: Interprocedural Communication Optimizations for Distributed Memory Compilation. 283-299 BibTeX

Automatic Parallelization Considered Unnecessary

J. Ramanujam, A. Mathew: Analysis of Event Synchronization in Parallel Programs. 300-315 BibTeX
Jeanne Ferrante: Computing Communication Sets for Control Parallel Programs. 316-330 BibTeX
Arvind Krishnamurthy, Katherine A. Yelick: Optimizing Parallel SPMD Programs. 331-345 BibTeX

Languages for Parallelism: Something Borrow, Something New

Piyush Mehrotra, Matthew Haines: An Overview of the Opus Language and Runtime System. 346-360 BibTeX
Calvin Lin, Lawrence Snyder: SIMPLE Performance Results in ZPL. 361-375 BibTeX
Rishiyur S. Nikhil: Cid: A Parallel, "Shared-Memory" C for Distributed-Memory Machines. 376-390 BibTeX
Thomas Derby, Robert B. Schnabel, Benjamin G. Zorn: EQ: Overview of a New Language Approach for Prototyping Scientific Computation. 391-405 BibTeX

And Now, for Something Completely Different

Aart J. C. Bik, Peter M. W. Knijnenburg, Harry A. G. Wijshoff: Reshaping Access Patterns for Generating Sparse Codes. 406-420 BibTeX
François Bodin, Elana D. Granston, Thierry Montaut: Evaluating Two Loop Transformations for Reducing Multiple Writer False Sharing. 421-439 BibTeX
Jon A. Solworth, Bryan Reagan: Parallelizing Tree Algorithms: Overhead vs. Parallelism. 440-454 BibTeX

When Your Program Runs (Finally)

José E. Moreira, Constantine D. Polychronopoulos: Autoscheduling in a Distributed Shared-Memory Environment. 455-471 BibTeX
Krishna Kunchithapadam, Barton P. Miller: Optimizing Array Distributions in Data-Parallel Programs. 472-486 BibTeX
Satoshi Sekiguchi, Kei Hiraki: Automatic Reduction Tree Generation for Fine-Grain Parallel Architectures when Iteration Count is Unknown. 487-496 BibTeX