21. ICPP 1992: University of Michigan, An Arbor, Michigan, USA - Volume 2

Communications

• Ming-Hwa Wang, Thomas W. Christopher: Simulate CSP-like Synchronous Communications by MDC Asynchronous Message Passing and Pattern Matching. 2-9 BibTeX
• Philip K. McKinley, Hong Xu, Abdol-Hossein Esfahanian, Lionel M. Ni: Unicast-based Multicast Communication in Wormhole-routed Networks. 10-19 BibTeX
• Thomas W. Christopher: A Technique for Damping Exponential Behavior in Reactive Object Algorithms with Invalidation. 20-23 BibTeX
• Sampath Rangarajan, Yennun Huang, Satish K. Tripathi: Computing Threshold Times for k-Resilient Protocols. 24-27 BibTeX
• Soo-Young Lee, Chung-Ming Chen: Analyzing Effect of Shared Data Replication on Minimizing Communication Overheads. 28-31 BibTeX

Dataflow

• Liang-Fang Chao, Edwin Hsing-Mean Sha: Retiming and Unfolding Data-Flow Graphs. 33-40 BibTeX
• Mark R. Thistle, Thomas L. Sterling, James T. Kuehn, Thomas A. Anastasio: The Effectiveness of Random Mapping on Fine-Grain MIMD Architectures. 41-48 BibTeX
• Shridhar B. Shukla, Brian Little, Amr Zaky: A Compile-Time Technique for Contorlling Real-Time Execution of Task-Level Data-Flow Graphs. 49-56 BibTeX

Load Distribution/Balancing

• Emile Haddad: Optimal Distribution of Random Workloads Over Heterogeneous Processors with Loading Constraints. 58-65 BibTeX
• Zheng Lin, Jack Minker: A Distributed Load Balancing Scheme for Parallel Logic Programming. 66-73 BibTeX
• James M. Conrad, Dharma P. Agrawal: A Graph Partitioning-Based Load Balancing Strategy for a Distributed Memory Machine. 74-81 BibTeX

Loop/Program Parallelization

• Jin-Chin Chung: Optimal Loope Parallelization Based on a Retiming Technique. 83-90 BibTeX
• Ten H. Tzen, Lionel M. Ni: Data Dependence Analysis and Uniformization for Doubly Nested Loops. 91-99 BibTeX
• Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau: Applying an Abstract Data Structure Description Approach to Parallelizing Scientific Pointer Programs. 100-104 BibTeX

Manipulation of Data Objects

• Alex L. Cheung, Anthony P. Reeves: Sparse Data Representation for Dense Data-Parallel Computation. 106-114 BibTeX
• Avraham Leff, Joel L. Wolf, Philip S. Yu: Distributed Object Replication Strategies for a Remote Caching Architecture. 114-123 BibTeX
• Jayashree Ramanathan, Lionel M. Ni: Exploiting Data Exchange Patterns in Creating Objects for NUMA Shared Virtual Memory Systems. 124-131 BibTeX

Performance and Operating Systems

• Parameswaran Ramanathan, Suresh Chalasani: Resource Placement in k-Ary n-Cubes. 133-140 BibTeX
• Yi Pan: On Efficient Distributed Elections in Clustered Chordal Rings. 141-144 BibTeX
• Thierry Priol, Zakaria Lahjomri: Experiments with Shared Virtual Memory on a iPSC/2 Hypercube. 145-148 BibTeX
• Kia Makki, Paul Banta, Ken Been, Niki Pissinou: On Algorithms for Mutual Exclusion in Distributed Systems. 149-152 BibTeX
• Nikos Krivossidis, Carl Tropper: A Performance Analysis of Time Warp. 153-156 BibTeX

Parallel Languages and Programming

• Christopher R. Houck, Gul Agha: HAL: A High-Level Actor Language and Its Distributed Implementation. 158-165 BibTeX
• Amitabha Das, Louise E. Moser, P. M. Melliar-Smith: PAL: A Language for Parallel Asynchronous Computation. 166-173 BibTeX
• Henry G. Dietz: Common Subexpression Induction. 174-182 BibTeX

Parallel Programs

• Henry Thomas, Henk J. Sips, Edwin M. R. M. Paalvast: A Taxonomy of User-Annotated Programs for Distributed Memory Computers. 184-191 BibTeX
• Jyh-Herng Chow, Williams Ludwell Harrison III: A General Framework for Analyzing Shared-Memory Parallel Programs. 192-199 BibTeX
• Carole M. McNamee, Ronald A. Olsson: Static Inter-Module Analysis for Determining Processor Co-Residency. 200-207 BibTeX

Parsers and Compilers

• Randall A. Helzerman, Mary P. Harper: Log Time Parsing on the MasPar MP-1. 209-217 BibTeX
• Scott R. Cannon: Experience with a Tuple-Space Approach for Parallel Compilation of LR Languages. 218-225 BibTeX
• Ping-Sheng Tseng: Network Parallel Computing with a Command Interpreter. 226-232 BibTeX

Consistency and Race Detection

• Deron Liang, Satish K. Tripathi: Analyzing Tradeoffs between Temporary Consistency and Concurrency with Rollbacks and Aborts. 234-241 BibTeX
• Robert H. B. Netzer, Sanjoy Ghosh: Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization. 242-246 BibTeX
• Emmi Schatz, Barbara G. Ryder: Directed Tracing to Detect Race Conditions. 247-250 BibTeX
• Larry D. Wittie, Gudjon Hermannsson, Ai Li: Eager Sharing fo Efficient Massive Parallelism. 251-255 BibTeX

Miscellaneous Software I

• A. Jefferson Offutt, Roy P. Pargas, Scott V. Fichter, Prashant K. Khambekar: Mutation Testing of Software Using MIMD Computer. 257-266 BibTeX
• Michael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri: Design Methodology for Fault-Tolerant Systolic Array Architectures. 267-274 BibTeX
• Sanjay Gadkari: Layered Encapsulations for Portable Parallel Programming. 275-278 BibTeX
• G. N. Srinivasa Prasanna, Anant Agarwal: Compile-time Techniques for Processor Allocation in Macro Dataflow Graphs for Multiprocessors. 279-283 BibTeX

Miscellaneous Software II

• Ding-Kai Chen, Pen-Chung Yew: A Scheme for Effective Execution of Irregular Doacross Loops. 285-292 BibTeX
• Dz-Ching Ju, Chuan-lin Wu, Paul R. Carini: The Synthesis of Array Functions and Its Use in Parallel Computation. 293-296 BibTeX
• Alexandru Nicolau, Steven Novack: An Efficient Global Resource Constrained Technique for Exploiting Instruction Level Parallelism. 297-301 BibTeX
• Viet N. Ngo, Gary Elsesser, Sourav Bhattacharya, Wei-Tek Tsai: Array Covering: A Technique4 for Enabling Lloop Parallelization. 302-305 BibTeX
• Jianzhong Li, Jaideep Srivastava: A High Dimensional Array Assignment Method for Parallel Computing Systems. 306-310 BibTeX