ICPP 1990: Urbana-Champaign, IL, USA

@proceedings{DBLP:conf/icpp/1990-2,
  editor    = {David A. Padua},
  title     = {Proceedings of the 1990 International Conference on Parallel
               Processing, Volume 2: Software, Urbana-Champaign, IL, August
               1990},
  booktitle = {ICPP (2)},
  publisher = {Pennsylvania State University Press},
  year      = {1990},
  isbn      = {0-271-00728-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Compilers I

• Youfeng Wu, Ted G. Lewis: Parallelizing WHILE Loops. 1-8
• Angelika Zobel: Parallel Interval Analysis of Data Flow Equations. 9-16

Programming Languages

• Laxmikant V. Kalé: The Chare Kernel Parallel Programming Language and System. 17-25
• Ian T. Foster, Rick L. Stevens: Parallel Programming with Algorithmic Motifs. 26-34
• Youfeng Wu, Ted G. Lewis: Parallelism Encapsulation in C++. 35-42

Dataflow

• Micah Beck, Keshav Pingali: From Control Flow to Dataflow. 43-52
• Handong Wu, Lars-Erik Thorelli: Extending Dataflow Principles for Multiprocessing. 53-60
• Ashar Nisar, Henry G. Dietz: Optimal Code Scheduling for Multiple-Pipeline Processors. 61-64
• Yi-Hsiu Wei, Jean-Luc Gaudiot: Compiling Programs to Direct Access Data-Flow Graphs. 65-69

Program Analysis Techniques and Tools

• David P. Helmbold, Charles E. McDowell, Jian-Zhong Wang: Analyzing Traces with Anonymous Synchronization. 70-77
• Stephen P. Masticola, Barbara G. Ryder: Static Infinite Wait Anomaly Detection in Polynomial Time. 78-87
• Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle: OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. 88-92
• Robert H. B. Netzer, Barton P. Miller: On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions. 93-97

Compilers II

• Chung-Chi Jim Li, W. Kent Fuchs: Maintaining Scalable Checkpoints on Hypercubes. 98-104
• Samuel P. Midkiff, David A. Padua: Issues in the Optimization of Parallel Programs. 105-113
• Ki-Chang Kim, Alexandru Nicolau: Parallelizing Non-Vectorizable Loops for MIMD Machines. 114-118
• Lang-Sheng Liu, Chin-Wen Ho, Jang-Ping Sheu: On the Parallelism of Nested For-Loops Using Index Shift Method. 119-123

Mapping, Partitioning, and Program Visualization

• Alfred Hough, Janice E. Cuny: Perspective Views: A Technique for Enhancing Parallel Program Visualization. 124-132
• Camille Batarekh: On the Mapping of Program Graphs Onto Pipeline Nets. 133-136
• Vipin Chaudhary, Jake K. Aggarwal: Generalized Mapping of Parallel Algorithms Onto Parallel Architectures. 137-141
• Keshav Pingali, Anne Rogers: Compiling for Locality. 142-146
• Eyal Zimran, Manohar Rao, Zary Segall: Performance Efficient Mapping of Applications to Parallel and Distributed Architectures. 147-154

Performance Evaluation

• Srikanth Kambhatla, Jon Inouye, Jonathan Walpole: Experiences with BeLinda: A Synthetic Linda Benchmark for Parallel Computing Platforms. 155-162
• Calvin Lin, Lawrence Snyder: A Comparison of Programming Models for Shared Memory Multiprocessors. 163-170
• Marc Willebeek-LeMair, Anthony P. Reeves, Chun H. Ning: Characterization of Multicomputer Systems: A Transfer Ratio Approach. 171-178

Partitioning, Synchronization, and Static Scheduling

• J. Ramanujam, P. Sadayappan: Tiling of Iteration Spaces for Multicomputers. 179-186
• Abderrazek Zaafrani, Henry G. Dietz, Matthew T. O'Keefe: Static Scheduling for Barrier MIMD Architectures. 187-194
• Yitzhak Birk, Phillip B. Gibbons, Jorge L. C. Sanz, Danny Soroker: A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines. 195-198
• Carolyn McCreary, Helen Gill: Efficient Exploitation of Concurrency Using Graph Decomposition. 199-203

Compilers III

• Xiangyun Kong, David Klappholz, Kleanthis Psarris: The I Test: A New Test for Subscript Data Dependence. 204-211
• Hudson Benedito Ribas: Obtaining Dependence Vectors for Nested-Loop Computations. 212-219
• Dirk Grunwald: Data Dependence Analysis: The Lambda Test Revisited. 220-223
• K. Sridharan, Ravi Narayanaswamy, Carole Denton, William Eventoff: Parallel Structuring of Programs Containing I/O Statements. 224-228

Production Systems and Logic Programming

• Wen-Tsuen Chen, Ming-Yi Fang: Vectorization Techniques for Theorem Proving in Propositional Logic. 229-235
• Evan Tick, Jim A. Crammond: Comparison of Two Shared-Memory Emulators for Flat Committed-Choice Logic Programs. 236-242
• Steve Kuo, Dan I. Moldovan, Seungho Cha: Control in Production Systems with Multiple Rule Firings. 243-246
• Daniel P. Miranker, Chin-Ming Kuo, James C. Browne: Parallelizing Compilation of Rule-Based Programs. 247-251

Data Management and Placement

• Lothar Borrmann, Martin Herdieckerhoff: A Coherency Model for Virtually Shared Memory. 252-257
• Patrick M. Clancey, Joan M. Francioni: Distribution of Pages in a Distributed Virtual Memory. 258-265
• Josep Torrellas, Monica S. Lam, John L. Hennessy: Share Data Placement Optimizations to Reduce Multiprocessor Cache Miss Rates. 266-270
• Zhixi Fang: Cache or Local Memory Thrashing and Compiler Strategy in Parallel Processing Systems. 271-275

Parallel Software Management

• Martin Adelantado, Nourredine Hifdi: MaRGOH: A Parallel Programming Approach for a Massive Cluster-Oriented System. 276-277
• Bernd Bruegge, Frank Walzer: Runtime Monitoring in a Network Environment. 278-279
• Yigang Chen, Wei-Tek Tsai: A Synthesis Approach to Developing Large Petri Nets. 280-281
• Jyh-Herng Chow, Williams Ludwell Harrison III: Microtasking Recursive, Parallel Programs. 282-283
• Tzilla Elrad, N. Krishna Kumar: State-Space Abstraction of Concurrent Programs: A Means to Computation-Progressive Scheduling. 284-285
• William G. Griswold, Gail A. Harrison, David Notkin, Lawrence Snyder: How Port Ensembles Aid the Efficient Retargeting of Reduction Algorithms. 286-287
• Magne Haveraaen: Distributing Programs on Different Parallel Architectures. 288-289
• Lorenz Huelsbergen, Douglas Hahn, James R. Larus: Exact Data Dependence Analysis Using Data Access Descriptors. 290-291
• Kai Hwang, Jian Xu: Mapping Partitioned Program Modules Onto Multicomputer Nodes Using Simulated Annealing. 292-293
• Hironori Kasahara, Hiroki Honda, M. Iwata, M. Hirota: A Compilation Scheme for Macro-Dataflow Computation on Hierarchical Multiprocessor Systems. 294-295
• Kichul Kim, Viktor K. Prasanna: An Efficient Mapping of Directed Graph Based Computations onto SIMD Hypercube Arrays and Applications. 296-297
• Ted Lehr, David Black, Zary Segall, Dalibor F. Vrsalovic: Visualizing Context-Switches Using PIE and the Mach Kernel Monitor. 298-299
• Santosh Pande, Dharma P. Agrawal, Jon Mauney: On Control Flow and Pseudo-Static Dynamic Allocation Strategy. 300-301
• Behrooz Shirazi, David D. H. Lin: An Asynchronous Communication Protocol for Heterogeneous Distributed Programming. 302