Table of Contents

• Broadcasting Algorithms in Faulty SIMD HypercubesC. S. Raghavendra, M. A. Sridhar. 4-11
• Tolerating Faults in a Mesh with a Row of Spare NodesJehoshua Bruck, Robert Cypher, Ching-Tien Ho. 12-19
• Fault-Tolerant Embeddings of Rings, Meshes, and Tori in HypercubesAlexander Wang, Robert Cypher. 20-29
• SMALL: A Scalable Multithreaded Architecture to Exploit Large LocaliyRamaswamy Govindarajan, Shashank S. Nemawarkar. 32-39
• Impact of Workload Partitionability on the Performance of Coupling Architectures for Transaction ProcessingPhilip S. Yu, Asit Dan. 40-49
• Experiments with Virtual C ThreadsWolfgang Küchlin, Jeffrey A. Ward. 50-55
• Event Scheduling in Window Based Parallel Simulation SchemesRassul Ayani, Hassan Rajaei. 56-60
• Revisiting the allocation of regular data arrays to a mesh of processorsSerge Miguet, Virginie Poty. 62-69
• Optimal Algorithms for Selection on a Mesh-Connected Processor ArrayDanny Krizanc, Lata Narayanan. 70-76
• Mapping Tree-Structured Computations onto Mesh-Connected Arrays of ProcessorsJyh-Jong Tsay. 77-84
• Parallel Image Sequence Coding on Multiprocessor SystemsSanjeev Rampal, Dharma P. Agrawal. 86-93
• A General Purpose Distributed Implementation of Simulated AnnealingRalf Diekmann, Reinhard Lüling, Jens Simon. 94-101
• Surface Reconstruction in ParallelSunjay E. Talele, Theodore Johnson, Panos E. Livadas. 102-106
• An Extact Hardware Implementation of the Boltzmann MachineMarcin Skubiszewski. 107-111
• Optimal and Near Optimal Tree Scheduling for Parallel SystemsYahui Zhu, Carolyn McCreary. 112-119
• An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel GraphsSivaprakasam Sunder, Xin He. 120-127
• On Uniformization of Affine Dependence AlgorithmsZhigang Chen, Weijia Shang. 128-137
• Pipelined Circuit-Switching: A Fault-Tolerant Variant of Wormhole RoutingPatrick T. Gaughan, Sudhakar Yalamanchili. 148-155
• Fault Tolerance of Adaptive Routing Algorithms in MulticomputersA. L. Narasimha Reddy, Rich Freitas. 156-161
• Hierarchical Interconnection Networks: Routing Performance in the Presence of FaultsBeomsu Kim, Hee Yong Youn, Krishna M. Kavi. 162-165
• A New Framework for Designing Parallel Algorithms on Series Parallel GraphsYuval Caspi, Eliezer Dekel. 168-175
• A Divide and Conquer Approach to Shortest Paths in Planar Layered DigraphsSairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter. 176-183
• Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical ClusteringElias Dahlhaus. 184-187
• The p-Shovelers Problem (Computing with Time-Varying Data)Fabrizio Luccio, Linda Pagli. 188-193
• Distributed Termination Detection of Loosely Synchonized ComputationsCheng-Zhong Xu, Francis C. M. Lau. 196-203
• Advanced Software Pipelining and the Program Dependence GraphRandall M. Lee, Vicki H. Allan. 208-211
• An Algebraic Framework of Edge-Disjoint Permutations on HypercubesArch D. Robison, Danny Soroker. 214-221
• Distributed Computing on Cayley Networks (Extended Abstract)Evangelos Kranakis, Danny Krizanc. 222-229
• On Embedding Ternary Trees into Boolean HypercubesAjay K. Gupta, Hong Wang. 230-235
• Using Communication-to-Computation Ratio in Parallel Program Design and Performance PredictionMark Crovella, Ricardo Bianchini, Thomas J. LeBlanc. 238-245
• On the Relative Speed of Messages and Hierarchical ChannelsMohan Ahuja, Ravi Prakash. 246-253
• Shared Memory vs. Message Passing in Shared-Memory MultiprocessorsThomas J. LeBlanc, Evangelos P. Markatos. 254-263
• Two System State Calculation Algorithms for Optimal Load BalancingAndreas Winckler. 266-273
• An (N-1)-Resilient Algorithm for Distributed Termination DetectionTen-Hwang Lai, Li-Fen Wu. 274-281
• Multiple Tree Quorum Algorithm for Replica Control in Distributed Database SystemsSoon Myoung Chung, Cailin Cao. 282-286
• Complete and Efficient Methods for Supporting Side-Effects and Cuts in And-Or Parallel PrologGopal Gupta, Vítor Santos Costa. 288-295
• The Parallel Asynchronous Recursion ModelLisa Higham, Eric Schenk. 310-316
• The Complexity of Sequential ConsistencyPhillip B. Gibbons, Ephraim Korach. 317-325
• A Novel Approach for Subcube Allocation in Hypercube MultiprocessorsDebendra Das Sharma, Dhiraj K. Pradhan. 336-345
• A Balanced Layered Allocation Scheme for Hypercube Based Dataflow SystemsVincent R. Freytag, Ben Lee, Ali R. Hurson. 346-353
• Time Sharing in Hypercube MultiprocessorsEliseu M. Chaves Filho, Valmir C. Barbosa. 354-359
• On the Distributed Subcube-Allocation Strategies in the Hypercube Multiprocessor SystemsJyh-Charn Liu, Yilong Chen. 360-364
• A Tight Bound on the Diameter of One-Dimensional PEC NetworksCho-chin Lin, Viktor K. Prasanna. 368-375
• Deterministic Routing on Circular ArraysMichael Kaufmann, Jop F. Sibeyn. 376-383
• An Optimal Multiplication Algorithm for Reconfigurable MeshJu-wook Jang, Heonchul Park, Viktor K. Prasanna. 384-391
• Page Replacement in Distributed Virtual Memory SystemsMohammed Malkawi, Deborah Knox, Mahmoud Abaza. 394-401
• Debugging Dynamic Distributed Programs Using Global PredicatesYoshifumi Manabe, Shigemi Aoyagi. 402-407
• A Token Based Distributed K Mutual Exclusion AlgorithmKia Makki, Paul Banta, Ken Been, Niki Pissinou, E. K. Park. 408-411
• Modeling Resource Contention Among Distributed Periodic ProcessesLonnie R. Welch, Alexander D. Stoyenko, Thomas J. Marlowe. 412-415
• An Implementation of F-Channels for Possible Cyclic NetworksXuefeng Dong, Mohan Ahuja. 416-421
• Multiple Message Broadcasting wiht Generalized Fibonacci TreesJehoshua Bruck, Robert Cypher, Ching-Tien Ho. 424-431
• Residue Number Systems: A Key to Parallelism in Public Key CryptographyKarl C. Posch, Reinhard Posch. 432-435
• A Methodology for Generating Data Distributions to Optimize CommunicationSandeep K. S. Gupta, S. D. Kaushik, Chua-Huang Huang, John R. Johnson, Rodney W. Johnson, P. Sadayappan. 436-441
• Memory Architecture Support for the SIMD Construction of a Gaussian PyramidJong Won Park, David T. Harper III. 444-451
• Programming Environment fo rPhase-Reconfigurable Parallel Programming on SuperNodeJean-Marc Adamo, Christophe Bonello, L. Trejo. 452-459
• Single Processor-Pool MSIMD/MIMD ArchitecturesMohamed S. Baig, Tarek A. El-Ghazawi, Nikitas A. Alexandridis. 460-467
• An Evalutation of Planar-Adaptive Routing (PAR)Jae H. Kim, Andrew A. Chien. 470-478
• A New Class of Interconnection Networks Based on Alternative GroupJung-Sing Jwo. 483-486
• Efficient Networks for Realizing Point-toPoint Assignments in Parallel ProcessorsMing Lu, A. Yavuz Oruç. 487-490
• Hierarchical Shuffle-Exchange and de Bruijn NetworksRobert Cypher, Jorge L. C. Sanz. 491-496
• The Scalable Tree Protocol - A Cache Coherence Approach for Large-Scale MultiprocessorsHåkan Nilsson, Per Stenström. 498-506
• Efficient Evaluation of Arbitrary Set-Associative Caches on MultiprocessorsYuguang Wu, Gerald J. Popek, Richard R. Muntz. 507-514
• Cache Coherent Shared Memory Hypercube MultiprocessorsJianxun Ding, Laxmi N. Bhuyan. 515-520
• Software Caching on Cache-Coherent MultiprocessorsRicardo Bianchini, Thomas J. LeBlanc. 521-526