default search action
LCPC 1991: Santa Clara, California, USA
- Utpal Banerjee, David Gelernter, Alexandru Nicolau, David A. Padua:
Languages and Compilers for Parallel Computing, Fourth International Workshop, Santa Clara, California, USA, August 7-9, 1991, Proceedings. Lecture Notes in Computer Science 589, Springer 1992, ISBN 3-540-55422-X
I. Explicitly Parallel Languages
- Gul Agha, Christopher R. Houck, Rajendra Panwar:
Distributed Execution of Actor Programs. 1-17 - Seema Hiranandani, Ken Kennedy, Charles Koelbel, Ulrich Kremer, Chau-Wen Tseng:
An Overview of the Fortran D Programming System. 18-34 - John Werth, James C. Browne, S. Sobek, Taejae Lee, Peter W. Newton, Ravi Jain:
The Interaction of the Formal and the Practical in Parallel Programming Environment Development: CODE. 35-49 - Daniel J. Scales, Martin C. Rinard, Monica S. Lam, Jennifer-Ann M. Anderson:
Hierarchical Concurrency in Jade. 50-64
II. Experimentation with Parallel Programming
- Rudolf Eigenmann, Jay P. Hoeflinger, Zhiyuan Li, David A. Padua:
Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs. 65-83 - Jinling Lee, Calvin Lin, Lawrence Snyder:
Programming SIMPLE for Parallel Portability. 84-98
III. Internal Representation
- Zena M. Ariola, Arvind:
Compilation of Id. 99-121 - Richard Johnson, Wei Li, Keshav Pingali:
An Executable Representation of Distance and Direction. 122-136 - Steven W. K. Tjiang, Michael E. Wolf, Monica S. Lam, K. Pieper, John L. Hennessy:
Integrating Scalar Optimization and Parallelization. 137-151 - Milind Girkar, Constantine D. Polychronopoulos:
Optimization of Data/Control Conditions in Task Graphs. 152-168
IV. Loop Parallelism
- David Callahan:
Recognizing and Parallelizing Bounded Recurrences. 169-185 - Chua-Huang Huang, P. Sadayappan:
Communication-Free Hyperplane Partitioning of Nested Loops. 186-200 - Lee-Chung Lu, Marina C. Chen:
Parallelizing Loops with Indirect Array References of Pointers. 201-217
V. Fine Grain Parallelism
- Alexandru Nicolau, Roni Potasman, Haigeng Wang:
Register Allocation, Renaming and Their Impact on Fine-Grain Parallelism. 218-235 - B. Ramakrishna Rau:
Data Flow and Dependence Analysis for Instruction Level Parallelism. 236-250
VI. Analysis Techniques
- Apostolos D. Kallis, David Klappholz:
Extending Conventional Flow Analysis to Deal with Array References. 251-265
VII. Compilers & Scheduling
- Mario Mango Furnari, Constantine D. Polychronopoulos:
Run-Time Management of Lisp Parallelism and the Hierarchical Task Graph Program Representation. 266-282 - Hironori Kasahara, Hiroki Honda, A. Mogi, A. Ogura, K. Fujiwara, Seinosuke Narita:
A Multi-Grain Parallelizing Compilation Scheme for OSCAR (Optimally Scheduled Advanced Multiprocessor). 283-297 - Jesús Labarta, Eduard Ayguadé, Jordi Torres, Mateo Valero, José M. Llabería:
Balanced Loop Partitioning Using GTS. 298-312
VIII. Cache Memory Issues
- Jesse Zhixi Fang, Mi Lu:
An Iteration Partition Approach for Cache or Local Memory Thrashing on Parallel Processing. 313-327 - Jeanne Ferrante, Vivek Sarkar, W. Thrash:
On Estimating and Enhancing Cache Effectiveness. 328-343 - Y.-L. Ju, Henry G. Dietz:
Reduction of Cache Coherence Overhead by Compiler Data Layout and Loop Transformation. 344-358
IX. Compilers for Dataflow Machines
- Guang R. Gao, Qi Ning:
Loop Storage Optimization for Dataflow Machines. 359-373 - Roni Hardon, Shlomit S. Pinter:
Optimal Partitioning of Programs for Data Flow Machines. 374-388
X. Analysis of Explicitly Parallel Programs
- Nicholas Carriero, David Gelernter:
A Foundation for Advanced Compile-time Analysis of Linda Programs. 389-404 - Harini Srinivasan, Michael Wolfe:
Analyzing Programs with Explicit Parallelism. 405-419
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.