4. SPDP 1992: Arlington, Texas, USA

Fault Tolerant Structures

• C. S. Raghavendra, M. A. Sridhar: Broadcasting Algorithms in Faulty SIMD Hypercubes. 4-11 BibTeX
• Jehoshua Bruck, Robert Cypher, Ching-Tien Ho: Tolerating Faults in a Mesh with a Row of Spare Nodes. 12-19 BibTeX
• Alexander Wang, Robert Cypher: Fault-Tolerant Embeddings of Rings, Meshes, and Tori in Hypercubes. 20-29 BibTeX

Scheduling I

• Ramaswamy Govindarajan, Shashank S. Nemawarkar: SMALL: A Scalable Multithreaded Architecture to Exploit Large Localiy. 32-39 BibTeX
• Philip S. Yu, Asit Dan: Impact of Workload Partitionability on the Performance of Coupling Architectures for Transaction Processing. 40-49 BibTeX
• Wolfgang Küchlin, Jeffrey A. Ward: Experiments with Virtual C Threads. 50-55 BibTeX
• Rassul Ayani, Hassan Rajaei: Event Scheduling in Window Based Parallel Simulation Schemes. 56-60 BibTeX

Mesh Connected Arrays

• Serge Miguet, Virginie Poty: Revisiting the allocation of regular data arrays to a mesh of processors. 62-69 BibTeX
• Danny Krizanc, Lata Narayanan: Optimal Algorithms for Selection on a Mesh-Connected Processor Array. 70-76 BibTeX
• Jyh-Jong Tsay: Mapping Tree-Structured Computations onto Mesh-Connected Arrays of Processors. 77-84 BibTeX

Applications

• Sanjeev Rampal, Dharma P. Agrawal: Parallel Image Sequence Coding on Multiprocessor Systems. 86-93 BibTeX
• Ralf Diekmann, Reinhard Lüling, Jens Simon: A General Purpose Distributed Implementation of Simulated Annealing. 94-101 BibTeX
• Sunjay E. Talele, Theodore Johnson, Panos E. Livadas: Surface Reconstruction in Parallel. 102-106 BibTeX
• Marcin Skubiszewski: An Extact Hardware Implementation of the Boltzmann Machine. 107-111 BibTeX

Scheduling II

• Yahui Zhu, Carolyn McCreary: Optimal and Near Optimal Tree Scheduling for Parallel Systems. 112-119 BibTeX
• Sivaprakasam Sunder, Xin He: An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs. 120-127 BibTeX
• Zhigang Chen, Weijia Shang: On Uniformization of Affine Dependence Algorithms. 128-137 BibTeX

Fault Tolerant Architectures

• D. L. Tao: Evaluating Reliability Improvements of Fault Tolerant VLSI Processor Arrays. 140-147 BibTeX
• Patrick T. Gaughan, Sudhakar Yalamanchili: Pipelined Circuit-Switching: A Fault-Tolerant Variant of Wormhole Routing. 148-155 BibTeX
• A. L. Narasimha Reddy, Rich Freitas: Fault Tolerance of Adaptive Routing Algorithms in Multicomputers. 156-161 BibTeX
• Beomsu Kim, Hee Yong Youn, Krishna M. Kavi: Hierarchical Interconnection Networks: Routing Performance in the Presence of Faults. 162-165 BibTeX

Algorithms

• Yuval Caspi, Eliezer Dekel: A New Framework for Designing Parallel Algorithms on Series Parallel Graphs. 168-175 BibTeX
• Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. 176-183 BibTeX
• Elias Dahlhaus: Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. 184-187 BibTeX
• Fabrizio Luccio, Linda Pagli: The p-Shovelers Problem (Computing with Time-Varying Data). 188-193 BibTeX

Compilation

• Cheng-Zhong Xu, Francis C. M. Lau: Distributed Termination Detection of Loosely Synchonized Computations. 196-203 BibTeX
• Chun Gong: Extended Cycle Shrinking: an Optimal Loop Transformation. 204-207 BibTeX
• Randall M. Lee, Vicki H. Allan: Advanced Software Pipelining and the Program Dependence Graph. 208-211 BibTeX

Networks

• Arch D. Robison, Danny Soroker: An Algebraic Framework of Edge-Disjoint Permutations on Hypercubes. 214-221 BibTeX
• Evangelos Kranakis, Danny Krizanc: Distributed Computing on Cayley Networks (Extended Abstract). 222-229 BibTeX
• Ajay K. Gupta, Hong Wang: On Embedding Ternary Trees into Boolean Hypercubes. 230-235 BibTeX

Communication Issues

• Mark Crovella, Ricardo Bianchini, Thomas J. LeBlanc: Using Communication-to-Computation Ratio in Parallel Program Design and Performance Prediction. 238-245 BibTeX
• Mohan Ahuja, Ravi Prakash: On the Relative Speed of Messages and Hierarchical Channels. 246-253 BibTeX
• Thomas J. LeBlanc, Evangelos P. Markatos: Shared Memory vs. Message Passing in Shared-Memory Multiprocessors. 254-263 BibTeX

Distributed Systems I

• Andreas Winckler: Two System State Calculation Algorithms for Optimal Load Balancing. 266-273 BibTeX
• Ten-Hwang Lai, Li-Fen Wu: An (N-1)-Resilient Algorithm for Distributed Termination Detection. 274-281 BibTeX
• Soon Myoung Chung, Cailin Cao: Multiple Tree Quorum Algorithm for Replica Control in Distributed Database Systems. 282-286 BibTeX

Problem Solving

• Gopal Gupta, Vítor Santos Costa: Complete and Efficient Methods for Supporting Side-Effects and Cuts in And-Or Parallel Prolog. 288-295 BibTeX
• Raéd Yousef Sindaha: The Dharma Scheduler - Definitive Scheduling in Aurora an Multiprocessors Architecture. 296-303 BibTeX
• A. J. Piper, Richard W. Prager: A High-Level, Object-Oriented Approach to Divide-and-Conquer. 304-307 BibTeX

Models and Algorithms

• Lisa Higham, Eric Schenk: The Parallel Asynchronous Recursion Model. 310-316 BibTeX
• Phillip B. Gibbons, Ephraim Korach: The Complexity of Sequential Consistency. 317-325 BibTeX
• Claudia Leopold: A Fast Sort Using Parallelism within Memory. 326-333 BibTeX

Processor Allocation

• Debendra Das Sharma, Dhiraj K. Pradhan: A Novel Approach for Subcube Allocation in Hypercube Multiprocessors. 336-345 BibTeX
• Vincent R. Freytag, Ben Lee, Ali R. Hurson: A Balanced Layered Allocation Scheme for Hypercube Based Dataflow Systems. 346-353 BibTeX
• Eliseu M. Chaves Filho, Valmir C. Barbosa: Time Sharing in Hypercube Multiprocessors. 354-359 BibTeX
• Jyh-Charn Liu, Yilong Chen: On the Distributed Subcube-Allocation Strategies in the Hypercube Multiprocessor Systems. 360-364 BibTeX

Networks and Algorithms

• Cho-Chin Lin, Viktor K. Prasanna: A Tight Bound on the Diameter of One-Dimensional PEC Networks. 368-375 BibTeX
• Michael Kaufmann, Jop F. Sibeyn: Deterministic Routing on Circular Arrays. 376-383 BibTeX
• Ju-wook Jang, Heonchul Park, Viktor K. Prasanna: An Optimal Multiplication Algorithm for Reconfigurable Mesh. 384-391 BibTeX

Distributed Systems II

• Mohammed Malkawi, Deborah Knox, Mahmoud Abaza: Page Replacement in Distributed Virtual Memory Systems. 394-401 BibTeX
• Yoshifumi Manabe, Shigemi Aoyagi: Debugging Dynamic Distributed Programs Using Global Predicates. 402-407 BibTeX
• Kia Makki, Paul Banta, Ken Been, Niki Pissinou, E. K. Park: A Token Based Distributed K Mutual Exclusion Algorithm. 408-411 BibTeX
• Lonnie R. Welch, Alexander D. Stoyenko, Thomas J. Marlowe: Modeling Resource Contention Among Distributed Periodic Processes. 412-415 BibTeX
• Xuefeng Dong, Mohan Ahuja: An Implementation of F-Channels for Possible Cyclic Networks. 416-421 BibTeX

Miscellaneous

• Jehoshua Bruck, Robert Cypher, Ching-Tien Ho: Multiple Message Broadcasting wiht Generalized Fibonacci Trees. 424-431 BibTeX
• Karl C. Posch, Reinhard Posch: Residue Number Systems: A Key to Parallelism in Public Key Cryptography. 432-435 BibTeX
• Sandeep K. S. Gupta, S. D. Kaushik, Chua-Huang Huang, John R. Johnson, Rodney W. Johnson, P. Sadayappan: A Methodology for Generating Data Distributions to Optimize Communication. 436-441 BibTeX

Architecture

• Jong Won Park, David T. Harper III: Memory Architecture Support for the SIMD Construction of a Gaussian Pyramid. 444-451 BibTeX
• Jean-Marc Adamo, Christophe Bonello, L. Trejo: Programming Environment fo rPhase-Reconfigurable Parallel Programming on SuperNode. 452-459 BibTeX
• Mohamed S. Baig, Tarek A. El-Ghazawi, Nikitas A. Alexandridis: Single Processor-Pool MSIMD/MIMD Architectures. 460-467 BibTeX

Interconnection Networks

• Jae H. Kim, Andrew A. Chien: An Evalutation of Planar-Adaptive Routing (PAR). 470-478 BibTeX
• Gowri Ramanathan, Mark J. Clement, Phyllis Crandall: Hyperweave: A Fault-Tolerant Expandable Interconnection Network. 479-482 BibTeX
• Jung-Sing Jwo: A New Class of Interconnection Networks Based on Alternative Group. 483-486 BibTeX
• Ming Lu, A. Yavuz Oruç: Efficient Networks for Realizing Point-toPoint Assignments in Parallel Processors. 487-490 BibTeX
• Robert Cypher, Jorge L. C. Sanz: Hierarchical Shuffle-Exchange and de Bruijn Networks. 491-496 BibTeX

Cache-Coherent Architectures

• Håkan Nilsson, Per Stenström: The Scalable Tree Protocol - A Cache Coherence Approach for Large-Scale Multiprocessors. 498-506 BibTeX
• Yuguang Wu, Gerald J. Popek, Richard R. Muntz: Efficient Evaluation of Arbitrary Set-Associative Caches on Multiprocessors. 507-514 BibTeX
• Jianxun Ding, Laxmi N. Bhuyan: Cache Coherent Shared Memory Hypercube Multiprocessors. 515-520 BibTeX
• Ricardo Bianchini, Thomas J. LeBlanc: Software Caching on Cache-Coherent Multiprocessors. 521-526 BibTeX