Table of Contents

• Performance Visualization of Parallel Programs on a Shared Memory Multiprocessor SystemDavid B. Bernstein, Anthony Bolmarcich, Kimming So. 1-10
• Design of a Novel Combining Structure for Shared-Memory MultiprocessorsNian-Feng Tzeng. 1-8
• Time-Space Optimal Parallel Merging and SortingXiaojun Guan, Michael A. Langston. 1-8
• Preventing Congestion in Multistage Networks in the Presence of HotspotsDaniel M. Dias, Manoj Kumar. 9-13
• A Parallel Algorithm for Multiple Updates of Minimum Spanning TreesShaunak Pawagi. 9-15
• VMMP: A Virtual Machine for the Development of Portable and Efficient Programs for MultiprocessorsEran Gabber. 11-14
• A Novel Strategy for Controlling Hot Spot CongestionWing S. Ho, Derek L. Eager. 14-18
• Hypertool: A Programming Aid for MulticomputersMin-You Wu, Daniel Gajski. 15-18
• Parallel Algorithms for Searching In X+YMichel Cosnard, Afonso Ferreira. 16-19
• Message Flow Analysis and Run-Time Verification for Parallel ProgramsSheausong Yang, Jie-Yong Juang. 19-22
• Multistage Networks Including Traffic with Real-Time ConstraintsLance Kurisaki, Tomás Lang. 19-22
• List Ranking on the HypercubeKwan Woo Ryu, Joseph JáJá. 20-23
• Synchronization and Communication Costs of Loop Partitioning on Shared-Memory Multiprocessor SystemsRajiv Gupta. 23-30
• A Timestamp-based Cache Coherence SchemeSang Lyul Min, Jean-Loup Baer. 23-32
• Grouping in Nested Loops for Parallel Execution on MulticomputersChung-Ta King, Lionel M. Ni. 31-38
• Fast Image Labeling using Local Operators On Mesh-Connected ComputersHussein M. Alnuweiri, Viktor K. Prasanna. 32-39
• Analysis of Hypercube Cache Performance Using Address Traces Generated by TRAPEDSCraig B. Stunkel, W. Kent Fuchs. 33-40
• Parafrase-2: An Environment for Parallelizing Partitioning Synchronizing and Scheduling Programs on MultiprocessorsConstantine D. Polychronopoulos, Milind Girkar, Mohammad R. Haghighat, Chia Ling Lee, Bruce Leung, Dale Schouten. 39-48
• Extending the Memory Hierarchy into Multiprocessor Interconnection Networks: A Performance AnalysisHaim E. Mizrahi, Jean-Loup Baer, Edward D. Lazowska, John Zahorjan. 41-50
• Image Block Transformations in a Partitioned Parallel Associative ProcessorBrian D. Alleyne, Jill M. Boyce, Isaac D. Scherson. 48-55
• Parallelizing Programs with Recursive Data StructuresLaurie J. Hendren, Alexandru Nicolau. 49-56
• A Distributed Processor Management Scheme for Partitionable Parallel ComputersMenkae Jeng, Howard Jay Siegel. 57-64
• Experimental Application-Driven Architecture Analysis of an SIMD/MIMD Parallel Processing SystemEdward C. Bronson, Thomas L. Casavant, Leah H. Jamieson. 59-67
• A Parallel FFT on an MIMD MachineAmir Averbuch, Eran Gabber, Boaz Gordissky. 63-70
• Job Scheduling in Partitionable Mesh Connected SystemsKeqin Li, Kam-Hoi Cheng. 65-72
• Trace Driven Simulation for Studying MIMD Parallel ComputersManoj Kumar, Kimming So. 68-72
• High-Speed Event Counting and Classification Using a Dictionary Hash TechniquePaul E. McKenney. 71-75
• Virtual Subcubes and Job Migration in a HypercubeGuan-Ing Chen, Ten-Hwang Lai. 73-76
• From Interconnection Network To Task Level AnalysisLaxmi N. Bhuyan, Hong Jiang, Dipak Ghosal. 73-77
• The Measured Performance of Parallel Dynamic Programming ImplementationsKenneth Almquist, Richard J. Anderson, Edward D. Lazowska. 76-79
• Implementation of GAMMON: An Efficient Load Balancing Strategy for a Local Computer SystemKatherine M. Baumgartner, Ralph-Michael Kling, Benjamin W. Wah. 77-80
• A Study of the Memory Reference Behavior of Engineering/Scientific Applications in Parallel ProcessorsSandra Johnson Baylor, Bharat Deep Rathi. 78-82
• Design and Analysis of Vector Processing in Monte Carlo Particle Transport CodesRiyanarto Sarno, Virendra C. Bhavsar, Pradeep K. Banerjee. 80-87
• A Software Prototyping Environment and Its Use in Developing a Multiversion Distributed Database SystemSang Hyuk Son, Yumi Kim. 81-88
• Analysis of Parallel Processing Architectures for Database SystemsM. Seetha Lakshmi, Philip S. Yu. 83-90
• Tradeoffs in Message Passing and Shared Memory Implementations of a Standard Cell RouterMargaret Martonosi, Anoop Gupta. 88-96
• Structuring Distributed Algorithms in a Workstation Environment: The FrameWorks ApproachAjit Singh, Jonathan Schaeffer, Mark Green. 89-97
• On the Data Distribution Problems for Range QueriesMyoung-Ho Kim, Sakti Pramanik. 91-94
• A Simultaneous Access Priority QueueZhenqiang Fan, Kam-Hoi Cheng. 95-98
• Parallel Placement on Hypercube ArchitectureC. P. Ravikumar, Sarma Sastry. 97-101
• An Environment for Parallel Structuring for Fortran ProgramsK. Sridharan, Matthew J. McShea, Carole Denton, William Eventoff, James C. Browne, Peter Newton, M. Ellis, D. Grossbard, T. Wise, David E. Clemmer. 98-106
• A New Distributed Algorithm for the Biconnectivity ProblemShing-Tsaan Huang. 106-113
• An Introduction to the CAPER Application Programming EnvironmentBinay Sugla, John T. Edmark, Bethany S. Robinson. 107-111
• Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection NetworksPhilip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz. 111-115
• The Force: A Highly Portable Parallel Programming LanguageHarry F. Jordan, Muhammad S. Benten, Gita Alaghband, Rüdiger Jakob. 112-117
• A Parallel Algorithm for Maximum Matching on Interval GraphsAbha Moitra, Richard C. Johnson. 114-120
• An Analysis of the Twisted Cube TopologySeth Abraham, Krishnan Padmanabhan. 116-120
• The Chare-Kernel Base Language: Preliminary Performance ResultsLaxmikant V. Kalé, Wei Shu. 118-121
• On Mapping Systolic Algorithms onto the HypercubeOscar H. Ibarra, Stephen M. Sohn. 121-124
• Expected Performance of Parallel SearchK. S. Natarajan. 121-125
• A Parallel Programming Language Directed Towards Top-Down Software DevelopmentTheo Ungerer, Eberhard Zehendner. 122-125
• A Hypercube Shared Virtual Memory SystemKai Li, Richard Schaefer. 125-132
• Intersection of Parallel Structuring and Reuse of Software Components: A Calculus of Composition of Components for Parallel ProgramsJames C. Browne, John Werth, Taejae Lee. 126-130
• Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc GraphsMing-Shing Yu, C. L. Chen, Richard Chia-Tung Lee. 126-129
• Optimal Static Scheduling of Sequential Loops on MultiprocessorsAmr Zaky, P. Sadayappan. 130-137
• A Processor Allocation Algorithm for Nested Combinations of Parallel Loops and CasesFujio Yamamoto. 131-138
• Coherent Shared Memory on a Distributed Memory MachineRoberto Bisiani, Andreas Nowatzyk, Mosur Ravishankar. 133-141
• Partitioning and Labeling of Index Sets in DO Loops with Constant Dependence VectorsErik H. D Hollander. 139-144
• MERLIN: Massively Parallel Heterogeneous ComputingLarry D. Wittie, Creve Maples. 142-150
• O (n) Scheduling Algorithms for Real-Time Multiprocessor SystemsKrithi Ramamritham, John A. Stankovic, Perng-Fei Shiah. 143-152
• An Empirical Study on Array Subscripts and Data DependenciesZhiyu Shen, Zhiyuan Li, Pen-Chung Yew. 145-152
• Parallel Processing Performance in a Linda SystemLothar Borrmann, Martin Herdieckerhoff. 151-158
• Synchronization and Load Unbalance Effects of Parallel Iterative AlgorithmsLuigi Brochard, Jean-Pierre Prost, Francois Faurie. 153-160
• Program Optimization with IdeographS. ShouHan Wang, Augustus K. Uht. 153-159
• Cache-Based Error Recovery for Shared Memory Multiprocessor SystemsKun-Lung Wu, W. Kent Fuchs, Janak H. Patel. 159-166
• Coherence of Distributed Shared Memory: Unifying Synchronization and Data TransferUmakishore Ramachandran, Mustaque Ahamad, M. Yousef Amin Khalidi. 160-169
• Uniform Approach for Solving Some Classical Problems on a Linear ArrayDavid R. O Hallaron. 161-168
• Completion Times of Programs on Concurrent Processors with Failure and RepairPhillip F. Chimento Jr., Kishor S. Trivedi. 167-171
• Fault-Tolerant Matrix Operations on Hypercube MultiprocessorsAnne C. Elster, Anthony P. Reeves. 169-176
• The Performance Implications of Spin-Waiting Alternatives for Shared-Memory MultiprocessorsThomas E. Anderson. 170-174
• Distributed Fault Diagnosis in the Butterfly Parallel ProcessorTsang-Ling Sheu, Woei Lin, Chita R. Das, Mary Jane Irwin. 172-175
• Distance-Transitive Graphs for Fault-Tolerant Multiprocessor SystemsArif Ghafoor, Sohail Sheikh, Patrick Solé. 176-179
• Algorithm-Based Fault Tolerance for Adaptive Least Squares Lattice Filtering on a Hypercube MultiprocessorRobert B. Mueller-Thuns, David McFarland, Prithviraj Banerjee. 177-180
• On Folded HypercubesShahram Latifi, Ahmed El-Amawy. 180-187
• Task Scheduling for General Rollback ComputingPeter Tinker. 180-183
• Performance Estimation of Gaussian-Elimination on the Connection MachineMin-You Wu, Wei Shu. 181-184
• Heuristic Tuning of Parallel Loop PerformancePaul A. Suhler. 184-191
• An Optimal EREW Parallel Algorithm for Parenthesis MatchingWai Wan Tsang, Tak Wah Lam, Francis Y. L. Chin. 185-192
• Embedding of Linear Array and Binary Tree in Cubical Ring Connected Cycles NetworksChungti Liang, Yigang Chen, Wei-Tek Tsai. 192-195
• Partitioned Load Allocation for Minimum Parallel Processing Execution TimeEmile Haddad. 192-199
• Parallel Evaluation of Attribute GrammarsAlexander C. Klaiber, Maya Gokhale. 193-201
• The Effect of Barrier Synchronization and Scheduling Overhead on Parallel LoopsCarl J. Beckmann, Constantine D. Polychronopoulos. 200-204
• The Effect of Iterative Instructions in Dataflow ComputersA. P. Wim Böhm, John R. Gurd, Yong Meng Teo. 201-208
• Sublinear Parallel Time Recognition of Tree Adjoining LanguagesMichael A. Palis, Sunil M. Shende. 202-205
• Multiprogramming Performance Degradation: Case Study on a Shared Memory MultiprocesorRobert T. Dimpsey, Ravishankar K. Iyer. 205-208
• Fully-Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum UnfoldingKeshab K. Parhi, David G. Messerschmitt. 209-216
• Dataflow-based Methodology for Coarse-Grain Multiprocessing on a Network of WorkstationsR. Jagannathan, Alan R. Downing, William T. Zaumen, Rosanna K. S. Lee. 209-216
• Analyzing Semantics of Concurrent Hardware SpecificationsLeonid Ya. Rosenblum, Alexandre Yakovlev. 211-218
• The Prototype of a Semantic Network Machine IXMTetsuya Higuchi, Tatsumi Furuya, Hiroyuki Kusumoto, Ken ichi Handa, Akio Kokubu. 217-224
• The LAST Algorithm: A Heuristic-Based Static Task Allocation AlgorithmJeff Baxter, Janak H. Patel. 217-222
• Modeling Speedup greater than nDavid P. Helmbold, Charles E. McDowell. 219-225
• Multiprocessing versus MultiprogrammingConstantine D. Polychronopoulos. 223-230
• A General Model for Memory Interference in a Multiprocessor System with Memory HierarchyBadie A. Taha, Hilda M. Standley. 225-232
• Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous WritesIan Parberry, Pei Yuan Yan. 226-233
• A Processor Allocation Scheme for Hypercube ComputersJong Kim, Chita R. Das, Woei Lin. 231-238
• The Effects of Cache Coherence on the Performance of Parallel PDE Algorithms in MultiprocessorsSandra Johnson Baylor, Faye A. Briggs. 233-236
• Reducing Time Complexities of Semigroup Computations on Mesh-Connected Computers with Multiple BroadcastingYen-Cheng Chen, Wen-Tsuen Chen, Gen-Huey Chen, Jang-Ping Sheu. 234-241
• Address Transformations to Increase Memory PerformanceDavid T. Harper III. 237-241
• Exploring Multiple Worlds in ParallelJonathan M. Smith, Gerald Q. Maguire Jr.. 239-245
• The Cydram 5 Stride-Insensitive Memory SystemB. Ramakrishna Rau, Michael S. Schlansker, David W. L. Yen. 242-246
• Time Warp on a Shared Memory MultiprocessorRichard Fujimoto. 242-249
• Production Systems on Message Passing Computers: Simulation Results and AnalysisAnurag Acharya, Milind Tambe. 246-254
• Optimal Designs of Linear Flow Systolic ArchitecturesSuresh C. Kothari, Heekuck Oh, Ethan Gannet. 247-256
• MTW: A Control Mechanism for Parallel Discrete SimulationLisa Sokol, Brian K. Stucky, Vincent S. Hwang. 250-254
• Minimal State Space Search in Parallel Production SystemsVishweshwar V. Dixit, Dan I. Moldovan. 255-259
• Case Studies in Serial and Parallel SimulationFrederick Wieland, David R. Jefferson. 255-258
• The Optimal Assignment of Sequential Programs to a Pipelined Linear Processor ArrayZhijun Tong. 257-260
• An Approximate Method to Predict Performance of a Distributed Simulation SchemeDevendra Kumar. 259-262
• A Model for Combined And-Or Parallel Execution of Logic ProgramsGopal K. Gupta, Bharat Jayaraman. 260-263
• A Near Optimal Adaptive Row Modular Design for Efficiently Reconfiguring the Processor Array in VLSIHee Yong Youn, Adit D. Singh. 261-265
• Time Optimal Operation of Heterogeneous ArraysJorge L. Aravena, Ahmed El-Amawy. 266-269
• A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection NetworksDavid Nassimi. 278-287
• A Self-Routing Permutation NetworkDavid M. Koppelman, A. Yavuz Oruç. 288-295
• Task Migration Transfers in Multistage Cube Based Parallel SystemsThomas Schwederski, Howard Jay Siegel, Thomas L. Casavant. 296-305
• Prefetching in File Systems for MIMD MultiprocessorsCarla Schlatter Ellis, David Kotz. 306-314
• Performance Evaluation of Multiple-Disk I/O SystemsA. L. Narasimha Reddy, Prithviraj Banerjee. 315-318
• Impact of Advanced VLSI Packaging on the Design of a Large Parallel ComputerAbhaya Asthana, H. V. Jagadish, Boyd Mathews. 323-327