Following are the contributed papers that have been accepted for IPPS/SPDP 1998. The papers are listed in order of paper number. Hiding Communication Latency in Data Parallel Applications Vivek Garg and David E. Schimmel

• Permutation Capability of Optical Multistage Interconnection Networks Yuanyuan Yang, Jianchao Wang, and Yi Pan
• Configuration Independent Analysis for Characterizing Shared-Memory Applications Gheith A. Abandah and Edward S. Davidson
• A New Self-Routing Multicast Network Yuanyuan Yang and Jianchao Wang
• Asymptotically Optimal Randomized Tree Embedding in Static Networks Keqin Li
• An Efficient Parallel Algorithm for High Dimensional Similarity Join Khaled Alsabti, Sanjay Ranka, and Vineet Singh
• Local Enumeration Techniques for Sparse Algorithms Gerardo Bandera, Pablo P. Trabado, and Emilio L. Zapata
• Partitioned Schedules for Clustered VLIW Architectures Marcio Merino Fernandes, Josep Llosa, and Nigel Topham
• Tree-Based Multicasting in Wormhole-Routed Irregular Topologies Ran Libeskind-Hadas, Dominic Mazzoni, and Ranjith Rajagopalan
• Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations Arnold L. Rosenberg
• Dynamic Processor Allocation with the Solaris Operating System Kelvin K. Yue and David J. Lilja
• On the Bisection Width and Expansion of Butterfly Networks Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, and Tal Yatzkar
• Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations Ran Libeskind-Hadas, Dominic Mazzoni, and Ranjith Rajagopalan
• Multicast Broadcasting in Large WDM Networks Weifa Liang and Hong Shen
• Preliminary Results from a Parallel MATLAB Compiler Michael J. Quinn, Alexey Malishevsky, Nagajagadeswar Seelam, and Yan Zhao
• NOW Based Parallel Reconstruction of Functional Images Frank Munz, T. Stephan, U. Maier, T. Ludwig, S. Ziegler, S. Nekolla, P. Bartenstein, M. Schwaiger, and A. Bode
• Optimizing Data Scheduling on Processor-In-Memory Arrays Yi Tian, Edwin H.-M. Sha, Chantana Chantrapornchai, and Peter M. Kogge
• Protocols for Non-Deterministic Communication over Synchronous Channels Erik D. Demaine
• Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network Shan-Chyun Ku and Biing-Feng Wang
• Synthesis of a Systolic Array Genetic Algorithm G.M. Megson and I.M. Bland
• Automatic Differentiation for Message-Passing Parallel Programs Paul Hovland and Christian Bischof
• Predicated Software Pipelining Technique for Loops with Conditions Dragan Milicev and Zoran Jovanovic
• An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains Neelima Gupta and Sandeep Sen
• Deterministic Routing of h-relations on the Multibutterfly Andrea Pietracaprina
• Impact of Switch Design on the Application Performance of Cache-Coherent Multiprocessors Laxmi N. Bhuyan, H. Wang, R. Iyer, and A. Kumar
• Using PI/OT to Support Complex Parallel I/O Ian Parsons, Jonathan Schaeffer, Duane Szafron, and Ron Unrau
• Sorting on Clusters of SMP's David R. Helman and Joseph JaJa
• Hyper-Butterfly Network: A Scalable Optimally Fault Tolerant Architecture Wei Shi and Pradip K. Srimani
• 106 An Expression-Rewriting Framework to Generate Communication Sets for HPF Programs with Block-Cyclic Distribution Gwan-Hwan Hwang and Jenq Kuen Lee
• Compiler Optimization of Implicit Reductions for Distributed Memory Multiprocessors Bo Lu and John Mellor-Crummey
• Resource Placements in 2D Tori Bader Almohammad and Bella Bose
• C++ Expression Templates Performance Issues in Scientific Computing Federico Bassetti, Kei Davis, and Dan Quinlan
• The Generalized Lambda Test Weng-Long Chang, Chih-Ping Chu, and Jesse Wu
• Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control D. Coudert, A. Ferreira, and X. Munoz
• Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs Michel Cosnard, Emmanuel Jeannot, and Laurence Rougeot
• An O((log log n)^2) Time Convex Hull Algorithm on Reconfigurable Meshes Tatsuya Hayashi, Koji Nakano, and Stephan Olariu
• 125 Cache Optimization for Multimedia Compilation on Embedded Processors for Low Power C. Kulkarni, F. Catthoor, and H. De Man
• An AT^2 Optimal Mapping of Sorting onto the Mesh Connected Array without Comparators Ju-wook Jang
• Design of a FEM Computation Engine for Real-Time Laparoscopic Surgery Simulation Alex Rhomberg, Rolf Enzler, Markus Thaler, and Gerhard Troester
• An Efficient RMS Admission Control And Its Application To Multiprocessor Scheduling Sylvain Lauzac, Rami Melhem, and Daniel Mosse
• Airshed Pollution Modeling: A Case Study in Application Development in an HPF Environment Jaspal Subhlok, Peter Steenkiste, James Stichnoth, and Peter Lieu
• An Efficient Logging Scheme for Lazy Release Consistent Distributed Shared Memory System Taesoon Park and Heon Y. Yeom
• Predicate Control for Active Debugging of Distributed Programs Ashis Tarafdar and Vijay K. Garg
• Memory Hierarchy Management for Iterative Graph Structures Ibraheem Al-Furaih and Sanjay Ranka
• A Generalized Framework for Global Communication Optimization M. Kandemir, P. Banerjee, A. Choudhary, J. Ramanujam, and N. Shenoy
• Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems Peter Cappello and Omer Egecioglu
• VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs Magnus Broberg, Lars Lundberg, and Hakan Grahn
• Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus Jyh-Jong Tsay and Wen-Tsong Wang
• NoWait-RPC: Extending ONC RPC to a Fully Compatible Message Passing System Thomas Hopfner
• Experimental Validation of Parallel Computation Models on the Intel Paragon Ben H.H. Juurlink ^p 165 Benchmarking the Task Graph Scheduling Algorithms Yu-Kwong Kwok and Ishfaq Ahmad
• Trace-Driven Debugging of Message Passing Programs Michael Frumkin, Robert Hood, and Louis Lopez
• Distributed, Dynamic Control of Circuit-Switched Banyan Networks Chuck Salisbury and Rami Melhem
• Sharing Random Bits with No Process Coordination Marius Zimand
• A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs Benjamin S. Macey and Albert Y. Zomaya
• Utilization and Predictability in Scheduling the IBM SP2 with Backfilling Dror G. Feitelson and Ahuva Weil
• Update Protocols and Iterative Scientific Applications Pete Keleher
• Java Consistency = Causality + Coherency Non-Operational Characterizations of the Java Memory Behavior Alex Gontmakher and Assaf Schuster
• Evaluation of Compiler and Runtime Library Approaches for Supporting Parallel Regular Applications Dhruva R. Chakrabarti, Antonio Lain, and Prithviraj Banerjee
• Design and Implementation of a Parallel I/O Runtime System for Irregular Applications Jaechun No, Sung-soon Park, Jesus Carretero, Alok Choudhary, and Pang Chen
• Locality and Performance of Page- and Object-Based DSMs Bryan Buck and Pete Keleher
• Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels Koji Nakano, Stephan Olariu, and James L. Schwing
• Design, Implementation and Evaluation of Parallel Pipelined STAP on Parallel Computers Alok Choudhary, Wei-keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, and Mark Linderman
• A Case for Aggregate Networks Raymond R. Hoare
• Parallel Performance Visualization Using Moments of Utilization Data T.J. Godin, Michael J. Quinn, and C.M. Pancake
• Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures Lars Lundberg and Hakan Lennerstad
• High-Performance External Computations Using User-Controllable I/O Jang Sun Lee, Sunghoon Ko, Sanjay Ranka, and Byung Eui Min
• Optimizing Parallel Applications for Wide-Area Clusters Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter Dozy, and Rutger F. H. Hofman
• Minimizing Total Communication Distance of a Broadcast on Mesh and Torus Networks Songluan Cang and Jie Wu
• Analysis of a Class of Parallel Matrix Multiplication Algorithms John Gunnels, Calvin Lin, Greg Morrow, and Robert van de Geijn
• Optimistic Synchronization of Mixed-Mode Simulators Peter Frey, Radharamanan Radhakrishnan, Harold W. Carter, and Philip A. Wilsey
• SIMD and Mixed-Mode Implementations of a Visual Tracking Algorithm Mark B. Kulaczewski and Howard Jay Siegel
• Scheduling Algorithms Exploiting Spare Capacity and Tasks' Laxities for Fault Detection and Location in Real-time Multiprocessor Systems K. Mahesh, G. Manimaran, C. Siva Ram Murthy, and Arun K. Somani
• Toward a Universal Mapping algorithm for Accessing Trees in Parallel Memory Systems Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, M. Cristina Pinotti, and Vittorio Scarano
• Vector Reduction and Prefix Computation on Coarse-Grained, Distributed-Memory Parallel Machines Seungjo Bae, Dongmin Kim, and Sanjay Ranka
• An Enhanced Co-Scheduling Method Using Reduced MS-State Diagrams R. Govindarajan, N.S.S. Narasimha Rao, E.R. Altman, and Guang R. Gao
• A Clustered Approach to Multithreaded Processors Venkata Krishnan and Josep Torrellas
• Jacobi Orderings for Multi-Port Hypercubes Dolors Royo, Antonio Gonzalez, and Miguel Valero-Garcia
• Solving the Maximum Clique Problem using PUBB Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, and Ryuichi Hirabayashi
• The Implicit Pipeline Method John B. Pormann, John A. Board, Jr., and Donald J. Rose
• Pin-down Cache: A Virtual Memory Management Technique for Zero-copy Communication Hiroshi Tezuka, Francis O'Carroll, Atsushi Hori, and Yutaka Ishikawa
• A Scalable VLSI Architecture for Binary Prefix Sums R. Lin, S. Olariu, M.C. Pinotti, K. Nakano, J.L. Schwing, and A.Y. Zomaya
• Aggressive Dynamic Execution of Multimedia Kernel Traces Benjamin Bishop, Robert Owens, and Mary Jane Irwin
• Prioritized Token-Based Mutual Exclusion for Distributed Systems Frank Mueller
• Performance Prediction in Production Environments Jennifer M. Schopf and Francine Berman
• The VEGA Moderately Parallel MIMD, Moderately Parallel SIMD, Architecture for High Performance Array Signal Processing Mikael Taveniku, Anders Ahlander, Magnus Jonsson, and Bertil Svensson
• Parallel Tree Building on a Range of Shared address Space Multiprocessors: Algorithms and Application Performance Hongzhang Shan and Jaswinder Pal Singh
• Thread-based vs Event-based Implementation of a Group Communication Service Shivakant Mishra and Rongguang Yang
• Experimental Study of Compiler Techniques for Scalable Shared Memory Machines Yunheung Paek and David A. Padua
• Efficient Barrier Synchronization Mechanism for the BSP Model on Message-Passing Architectures Jin-Soo Kim, Soonhoi Ha, and Chu Shik Jhon
• Performance Sensitivity of Space-Sharing Processor Scheduling in Distributed-Memory Multicomputers Sivarama P. Dandamudi and Hai Yu
• Rendering Computer Animations on a Network of Workstations Timothy A. Davis, and Edward W. Davis
• Compile-time Synchronization Optimizations for Software DSMs Hwansoo Han and Chau-Wen Tseng
• The Robust-Algorithm Approach to Fault Tolerance on Processor Arrays: Fault Models, Fault Diameter, and Basic Algorithms Behrooz Parhami and Chi-Hsiang Yeh
• Optimal All-to-Some Personalized Communication on Hypercubes Y. Charlie Hu
• Performance and Experience with LAPI -- a New High-Performance Communication Library for the IBM RS/6000 SP Gautam Shah, Jarek Nieplocha, Jamshed Mirza, Chulho Kim, Robert Harrison, Rama K. Govindaraju, Kevin Gildea, Paul DiNicola, and Carl Bender
• Predicting the Running Time of Parallel Programs by Simulation Radu Rugina and Klaus E. Schauser
• Lower Bounds on Communication Loads and Optimal Placements in Torus Networks M. Cemil Azizoglu and Omer Egecioglu
• Fault-Tolerant Switched Local Area Networks Paul LeMahieu, Vasken Bohossian, and Jehoshua Bruck
• Efficient Fine-Grain Thread Migration with Active Threads Boris Weissman, Benedict Gomes, Jurgen W. Quittek, and Michael Holtkamp
• ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets Mahesh V. Joshi, George Karypis, and Vipin Kumar
• Register-Sensitive Software Pipelining Amod K. Dani and R. Govindarajan
• Improved Concurrency Control Techniques for Multi-dimensional Index Structures K.V. Ravi Kanth, F. David Serena, and Ambuj K. Singh
• Emulating Direct Products by Index-Shuffle Graphs Bojana Obrenic ^p 300 An Efficient Counting Network Costas Busch and Marios Mavronicolas
• The Design of COMPASS: An Execution Driven Simulator for Commercial Applications Running on Shared Memory Multiprocessors Ashwini K. Nanda, Yiming Hu, Moriyoshi Ohara, Caroline D. Benveniste, Mark E. Giampapa, and Maged Michael
• A Comparative Study of Five Parallel Genetic Algorithms Using The Traveling Salesman Problem Lee Wang, Anthony A. Maciejewski, Howard Jay Siegel, and Vwani P. Roychowdhury
• Adaptive Quality Equalizing: High-Performance Load Balancing for Parallel Branch-and-Bound Across Applications and Computing Systems Nihar R. Mahapatra and Shantanu Dutt
• Data Collection and Restoration for Heterogeneous Network Process Migration Kasidit Chanchio and Xian-He Sun
• Medical Image Processing and Visualization on Heterogeneous Clusters of Symmetric Multiprocessors Using MPI and POSIX Threads Christoph GieB, Achim Mayer, Harald Evers, and Hans-Peter Meinzer
• High Performance OLAP and Data Mining on Parallel Computers Sanjay Goil and Alok Choudhary
• HIPIQS: A High-Performance Switch Architecture using Input Queuing Rajeev Sivaram, Craig B. Stunkel, and Dhabaleswar K. Panda
• Total-Exchange on Wormhole k-ary n-cubes with Adaptive Routing Fabrizio Petrini
• Managing Concurrent Access for Shared Memory Active Messages Steven S. Lumetta and David E. Culler
• Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices Peter D. Sulatycke and Kanad Ghose
• Clustering and Reassignment-Based Mapping Strategy for Message-Passing Architectures M.A. Senar, A. Ripoll, A. Cortes, and E. Luque
• Analyzing the Individual/Combined Effects of Speculative and Guarded Execution on a Superscalar Architecture M. Srinivas and Alexandru Nicolau
• Quantitative Code Analysis of Scientific Systolic Programs: DSP Vs. Matrix Algorithms R. Sernec, M. Zajc, and J.F. Tasic