26. ICPP 1997: Bloomington, IL, USA

Session 1A: Parallel Algorithms

• Chi-Hsiang Yeh, Behrooz Parhami:
  Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns. 4-11
  
• Hettihe P. Dharmasena, Ramachandran Vaidyanathan:
  An Optimal Multiple Bus Network for Fan-in Algorithms. 12-15
  
• Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang:
  Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. 16-19
  
• Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko:
  . Efficient Parallel Algorithms on Distance-Hereditary Graphs. 20-
  

Session 1B: Network Modeling

• James R. Anderson, Seth Abraham:
  Multidimensional Network Performance with Unidirectional Links. 26-33
  
• Fabrizio Petrini, Marco Vanneschi:
  Network Performance under Physical Constraints. 34-43
  
• Ronald I. Greenberg, Lee Guan:
  An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees. 44-48
  
• Michael Jurczyk:
  Performance and Implementation Aspects of Higher Order Head-of-Line Blocking Switch Boxes. 49-
  

Session 1C: Compilers I - Data Layout And Access

• Jenq Kuen Lee, Dan Ho, Y. C. Chuang:
  Data Distribution Analysis and Optimization for Pointer-Based Distributed Programs. 56-63
  
• Sudarsan Tandri, Tarek S. Abdelrahman:
  Automatic Partitioning of Data and Computations on Scalable Shared Memory Multiprocessors. 64-73
  
• Angeles G. Navarro, Emilio L. Zapata, Yunheung Paek, David A. Padua:
  Compiler Techniques for Effective Communication on Distributed-Memory Multiprocessors. 74-77
  
• Naraig Manjikian:
  Combining Loop Fusion with Prefetching on Shared-memory Multiprocessors. 78-
  

Session 2A: Embeddings and Routings

• Vivek Halwan, Füsun Özgüner:
  Efficient Multicast Algorithms in All-Port Wormhole-Routed Hypercubes. 84-91
  
• Ding-Ming Kwai, Behrooz Parhami:
  A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes. 92-95
  
• Jie Wu, Eduardo B. Fernández, Yingquiu Luo:
  Embedding of binomial trees in hypercubes with link faults. 96-99
  
• Hettihe P. Dharmasena, Ramachandran Vaidyanathan:
  An Optimal Multiple Bus Network for Fan-in Algorithms. 100-
  

Session 2B: Parallelism Management

• Krishna K. Sundararaman, Manoj Franklin:
  Multiscalar Execution along a Single Flow of Control. 106-113
  
• Hyunseung Choo, Hee Yong Youn, Gyung-Leen Park, Behrooz Shirazi:
  Efficient Processor Allocation Scheme for Multi Dimensional Interconnection Networks. 114-117
  
• Chung-yen Chang, Prasant Mohapatra:
  An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems. 118-121
  
• Hyong-Shik Kim, Soonhoi Ha, Chu Shik Jhon:
  Quantitative Analysis on Caching Effect of I-Structure Data in Frame-Based Multithreaded Processing. 122-
  

Session 2C: IO and Data Structures in Distributed Systems

• Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhary:
  Improving the Performance of Out-of-Core Computations. 128-136
  
• Pangfeng Liu, Jan-Jan Wu:
  A Framework for Parallel Tree-Based Scientific Simulations. 137-144
  
• J. A. Smith, Santosh K. Shrivastava:
  Fault-Tolerant Parallel Applications Using Queues and Actions. 145-149
  
• Yeh-Ching Chung, Ching-Hsien Hsu:
  Message Encoding Techniques for Efficient Arrary Redistribution. 150-
  

Panel 1: Wide-Spread Acceptance of General-Purpose Large-Scale Parallel Machines: Fact, Future, or Fantasy?

Session 3A: Scheduling I - Algorithms

• Jan Jonsson, Kang G. Shin:
  A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System. 158-165
  
• O-Hoon Kwon, Jong Kim, Sung Je Hong, Sunggu Lee:
  Real-Time Job Scheduling in Hypercube Systems. 166-169
  
• Yueh-O Wang, Nancy M. Amato, Donald K. Friesen:
  Hindsight Helps: Deterministic Task Scheduling with Backtracking. 170-173
  
• Min-You Wu, Wei Shu, Jun Gu:
  Local Search for DAG Scheduling and Task Assignment. 174-
  

Session 3B: Wormhole Networks

• Juan Miguel Martínez, Pedro López, José Duato, Timothy Mark Pinkston:
  Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks. 182-189
  
• Kuo-Pao Fan, Chung-Ta King:
  Turn Grouping for Efficient Barrier Synchronization in Wormhole Mesh Networks. 190-197
  
• Hyojeong Song, Boseob Kwon, Hyunsoo Yoon:
  Throttle and Preempt: A New Flow Control for Real-Time Communications in Wormhole Networks. 198-202
  
• Vara Varavithya, Prasant Mohapatra:
  Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks. 203-
  

Session 3C: Consistency and Communication

• Cristiana Bentes Seidel, Ricardo Bianchini, Claudio Luis de Amorim:
  The Affinity Entry Consistency Protocol. 208-217
  
• Sung-Eun Choi, Lawrence Snyder:
  Quantifying the Effects of Communication Optimizations. 218-222
  
• Jin-Soo Kim, Soonhoi Ha, Chu Shik Jhon:
  Reducing Overheads of Local Communications in Fine-grain Parallel Computation. 223-226
  
• Peter Frey, Harold W. Carter, Philip A. Wilsey:
  Parallel Synchronization of Continuous Time Discrete Event Simulators. 227-
  

Session 4A: Data Distribution

• Young Won Lim, Neungsoo Park, Viktor K. Prasanna:
  Efficient Algorithms for Multi-dimensional Block-Cyclic Redistribution of Arrays. 234-241
  
• Hemal V. Shah, José A. B. Fortes:
  Effects of Dynamic Task Distributions on the Performance of a Class of Irregular Computations. 242-
  

Session 4B: Memory Organizations

• Adrian Moga, Michel Dubois, Alain Gefflaut:
  Hardware Versus Software Implementation of COMA. 248-256
  
• V. Carl Hamacher, Hong Jiang:
  Performance and Configuration of Hierarchical Ring Networks for Multiprocessors. 257-265
  
• Youngsik Kim, Tack-Don Han, Shin-Dug Kim, Sung-Bong Yang:
  An Effective Memory--Processor Integrated Architecture for Computer Vision. 266-
  

Session 4C: Load Balancing and Scheduling

• Venkatram Krishnaswamy, Gagan Hasteer, Prithviraj Banerjee:
  Load Balancing and Workload Minimization Of Overlapping Parallel Tasks. 272-279
  
• Byung S. Yoo, Chita R. Das:
  Good Processor Management = Fast Allocation + Efficient Scheduling. 280-287
  
• Ishfaq Ahmad, Yu-Kwong Kwok, Min-You Wu, Wei Shu:
  Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH. 288-291
  
• Sissades Tongsima, Chantana Chantrapornchai, Edwin Hsing-Mean Sha, Nelson L. Passos:
  Probabilistic Rotation: Scheduling Graphs with Uncertain Execution Time. 292-
  

Session 5A: Prefetching in Multiprocessors

• Jonas Skeppstedt, Michel Dubois:
  Hybrid compiler/hardware prefetching for multiprocessors using low-overhead cache miss traps. 298-305
  
• Myoung Kwon Tcheun, Hyunsoo Yoon, Seung Ryoul Maeng:
  An adaptive sequential prefetching scheme in shared-memory multiprocessors. 306-313
  
• Sunil Kim, Alexander V. Veidenbaum:
  Stride-directed Prefetching for Secondary Caches. 314-
  

Session 5B: Local Area and Wireless Networks

• Mingyao Yang, Lionel M. Ni:
  Design of Scalable and Multicast Capable Cut-Through Switches for High-Speed LANs. 324-
  
• Sandeepan Sanyal, Laila Nahar, Sourav Bhattacharya:
  Real-time multicast in wireless communication. 500-
  

Session 5C: Fault-Tolerant Networks

• Pierre Sens:
  Performance Evaluation of Fault Tolerance for Parallel Applications in Networked Environments. 334-341
  
• Baback A. Izadi, Füsun Özgüner:
  Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube. 342-345
  
• Chungti Liang, Sourav Bhattacharya, Jack Tan:
  Design and Analysis of Fault-Tolerant Star Networks. 346-349
  
• Yinan N. Shen, Xiao-Tao Chen, Susumu Horiguchi, Fabrizio Lombardi:
  On the multiple fault diagnosis of multistage interconnection networks: the lower bound and the CMOS fault model. 350-
  

Panel 2: In Search of the "Killer Application"

Panel 3: Of languages and Libraries

Session 6A: Load Balancing

• Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
  Adaptive load-balancing algorithms using symmetric broadcast networks: performance study on an IBM SP2. 360-
  

Session 6B: Multicast Communication

• Ram Kesavan, Dhabaleswar K. Panda:
  Optimal Multicast with Packetization and Network Interface Support. 370-377
  
• Nidhi Agrawal, C. P. Ravikumar:
  An Euler Path Based Technique for Deadlock-free Multicasting. 378-384
  
• Yuanyuan Yang, Jianchao Wang:
  Performance Analysis and Simulation of Multicast Networks. 385-389
  
• Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng:
  Sufficient Conditions for Optimal Multicast Communication. 390-
  

Session 6C: Compilers II - Analysis, Allocation, and Mapping

• Jyh-Herng Chow, Vivek Sarkar:
  False Sharing Elimination by Selection of Runtime Scheduling Parameters. 396-403
  
• Akira Koseki, Yoshiaki Fukazawa, Hideaki Komatsu:
  A Register Allocation Technique Using Register Existence Graph. 404-411
  
• Deepankar Bairagi, Dharma P. Agrawal, Sandeep Kumar:
  Precise Call Graph Construction for OO Programs in the Presence of Virtual Functions. 412-416
  
• Hyuk-Jae Lee, José A. B. Fortes:
  Automatic generation of injective modular mappings. 417-
  

Session 7A: Applications

• Mark Bernd Kulaczewski, Howard Jay Siegel:
  Implementations of a Feature-Based Visual Tracking Algorithm on Two MIMD Machines Mark Bernd. 422-430
  
• Rohit Gupta, Mitchell D. Theys, Howard Jay Siegel:
  Background Compensation and an Active-Camera Motion Tracking Algorithm. 431-440
  
• Dilip Krishnaswamy, Prithviraj Banerjee:
  Exploiting task and data parallelism in parallel Hough and Radon transforms. 441-
  

Session 7B: Communication and Synchronization Issues

• Dale Seed, Anand Sivasubramaniam, Chita R. Das:
  Communication in Parallel Applications: Characterization and Sensitivity Analysis. 446-453
  
• Donglai Dai, Dhabaleswar K. Panda:
  How Much Does Network Contention Affect Distributed Shared Memory Performance?. 454-
  
• Kanad Ghose, Seth Melnick, Tom Gaska, Seth Goldberg, Arun K. Jayendran, Brian T. Stein:
  The Implementation of Low Latency Communication Primitives in the Snow Prototype. 462-461
  

Session 7C: Scheduling II - Software

• Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis, Hyunseung Choo:
  Decisive Path Scheduling: A New List Scheduling Method. 472-480
  
• Richard D. Dietz, Thomas L. Casavant, Todd E. Scheetz, Terry A. Braun, Mark S. Andersland:
  Modeling the impact of run-time uncertainty on optimal computation scheduling using feedback. 481-488
  
• Sanjeev Setia:
  Trace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers. 489-
  
• Haluk Topcuoglu, Salim Hariri:
  A Global Computing Environment for Networked Resources. 493-492
  

Last update Sun May 26 02:23:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page