CSDL - Proceedings I

PDF

List of Referees (PDF)

pp. ix

PDF

SESSION 1B:MODELSPARADIGM

Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs (Abstract)

Robert Snelick, National Institute of Standards and Technilogy, Maryland

Joseph Jaja, National Institute of Standards and Technilogy, Maryland

Raghu Kacker, National Institute of Standards and Technilogy, Maryland

Gordon Lyon, National Institute of Standards and Technilogy, Maryland

pp. 2-10

PDF

Comparing Data-Parallel and Message-Passing Paradigms (Abstract)

Alexander C. Klaiber, University of Washington

James L. Frankel, Thinking Machine Corporation, MA

pp. 11-20

PDF

Function-Parallel Computation in a Data-Parallel Environment (Abstract)

Alex L. Cheung, Sandia National Laboratories

Anthony P. Reeves, Cornell University

pp. 21-24

PDF

Automatic Parallelization Techniques for the EM-4 (Abstract)

Lubomir Bic, UC, Irvine

Mayez Al-Mouhamed, UC, Irvine

pp. 25-28

PDF

SESSION 2B: COMPILER

Automating Parallelism of Regular Computations for Distributed-Memory Multicomputers in the Paradigm Compiler (Abstract)

Ernesto Su, University of Illinois at Urbana-Champaign

Daniel J. Palerrno, University of Illinois at Urbana-Champaign

Prithviraj Banerjee, University of Illinois at Urbana-Champaign

pp. 30-38

PDF

Compilation Techniques for Optimizing Communication on Distributed-Memory Systems (Abstract)

Chun Gong, University of Pittsburgh

Rajiv Gupta, University of Pittsburgh

Rami Melhem, University of Pittsburgh

pp. 39-46

PDF

Meta-State Conversion (Abstract)

H.G. Dietz, Purdue University

G. Krishnamurthy, Purdue University

pp. 47-56

PDF

SESSION 3B:TOOLS

A Unified Model for Concurrent Debugging (Abstract)

S. I. Hyder, University of Texas at Austin

J. F. Werth, University of Texas at Austin

J. C. Browne, University of Texas at Austin

pp. 58-67

PDF

PARSA: A Parallel Program Scheduling and Assessment Environment (Abstract)

Behrooz Shirazi, Texas advanced Technology Program

Krishna Kavi, University of Texas at Arlington

A.R. Hurson, Pennsylvania State University

Prasenjit Biswas, Cyrix Corporation, TX

pp. 68-72

PDF

VSTA: A prolog-Based Formal Verifier for Systtolic Array Designs (Abstract)

Nam Ling, Santa Clara University, Santa Clara, CA.

Timothy Shih, Santa Clara University, Santa Clara, CA.

pp. 73-76

PDF

A Parallel Program Tuning Environment (Abstract)

Gary J. Nutt, University of Colorado, Boulder

pp. 77-81

PDF

Decremental Scattering for Data Transport Between Host and Hypercube Nodes (Abstract)

Mukesh Sharma, Lehigh University, Bethlehem, PA

Meghanad D. Wagh, Lehigh University, Bethlehem, PA

pp. 82-85

PDF

SESSION 4B: CACHE/MEMORY MANAGEMENT

Memory Reference Behavior of Compiler Optimized Programs on High Speed Architectures (Abstract)

John W. C. Fu, Intel Corporation, Folsom, CA

Janak H. Patel, University of Illinois at Urbana-Champaign

pp. 87-94

PDF

Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors (Abstract)

Karen A. Tomko, University of Michigan

Santosh G. Abraham, University of Michigan

pp. 95-102

PDF

Performance and Scalability Aspects of Directory-Based Cache Coherence in Shared Multiprocessors (Abstract)

Silvio Picano, Purdue University

David G. Meyer, Purdue University

Eugene D. III Brooks, Lawrence Livermore National Laboratory

Joseph E. Hoag, Lawrence Livermore National Laboratory

pp. 103-106

PDF

Compiling for Hierarchical Shared Memory Multiprocessors (Abstract)

J. D. Martens, Ohio State University

D. N. Jayasimha, Ohio State University

pp. 107-110

PDF

SESSION 58: MAPPING/SCHEDULING

Efficient Use of Dynamically tagged Directories Through Compiler Analysis (Abstract)

Trung N. Nguyen, University of Minnesota

Zhiyuan Li', University of Minnesota

David J. Lilja, University of Minnesota

pp. 112-119

PDF

Trailblazing: A Hierarchical Approach to Percolation Scheduling (Abstract)

Alexandru Nicolau, UC, Irvine,CA

Steven Novack, UC, Irvine,CA

pp. 120-124

PDF

Contention-Free 2D-Mesh Cluster Allocation in Hypercubes (Abstract)

Stephen W. Turner, Michigan State University

Lionel M. Ni, Michigan State University

Betty H.C. Cheng, Michigan State University

pp. 125-129

PDF

A Task Allocation Algorithm In a Multiprocessor Real-Time System (Abstract)

Jean-Pime BEAUVAIS, Ecole Cende & Nan teslUniversitE de Nantes, Cedex, France

Anne-Marie DEPLANCHE, Ecole Cende & Nan teslUniversitE de Nantes, Cedex, France

pp. 130-133

PDF

Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler (Abstract)

Shankar Ramaswamy, University of Illinois at Urbana-Champaign

Prithviraj Banerjee, University of Illinois at Urbana-Champaign

pp. 134-138

PDF

SESSION 68: COMPILER

Locality and Loop Scheduling on NUMA Multiprocessors (Abstract)

Hui Li, University of Toronto

Sudarsan Tandri, University of Toronto

Michael Stumm, University of Toronto

Kenneth C. Sevcik, University of Toronto

pp. 140-147

PDF

Compile-Time Charactirization Recurrent Patterns in Irregular Computations (Abstract)

Kalluri Eswar, Ohio State University

P. Sadayappan, Ohio State University

Chua-Huang Huang, Ohio State University

pp. 148-155

PDF

Investigating Properties of Code Transformations (Abstract)

Deborah Whitfield, Slippery Rock University

Mary Lou Soffa, University of Pittsburgh

pp. 156-160

PDF

Compiling Efficient Programs for Tightly-Coupled Distributed Memory Computers (Abstract)

PeiZong Lee, Academia Sinica, Taiwan

Tzung-Bow Tsai, Chung-cheng University, Taiwan

pp. 161-165

PDF

SESSION 7B: SIMD/DATA PARALLEL

Solving Dynamic and Irregular Problems on SIMD Architectures with Runtime Support (Abstract)

WEI SHU, State University of New York, Buffalo, NY

MIN-YOU WU, State University of New York, Buffalo, NY

pp. 167-174

PDF

Evaluation of Data Distribution Patterns in Distributed-Memory Machines (Abstract)

Edgar T. Kalns, Michigan State University

Hong Xu, Michigan State University

Lionel M. Ni, Michigan State University

pp. 175-183

PDF

Activity Counter: New Optimization for the dynamic scheduling of SIMD Control Flow (Abstract)

Ronun Keryell, Centre de Recherche en Infonnatique, Ecole des Mines de Paris, Cedex, France

Nicolas Paris, Hyperparallel Technologies, Ecole Polytechnique X-POLE, Cedex, France

pp. 184-187

PDF

SIMD Optimizations in a Data Parallel C (Abstract)

Maya Gokhale, Supercomputing Research Center, Bowie, MD

Phil Pfeiffer, East Stroudsburg University, PA

pp. 188-191

PDF

SESSION 8B : RESOURCE ALLOCATION/OS

An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems (Abstract)

Jianxun Ding, Texas A&M University

Laxmi N. Bhuyan, Texas A&M University

pp. 193-200

PDF

A Fair Fast Scalable Rea,der-Writer Lock (Abstract)

Orran Krieger, University of Toronto,Canada

Michael Stumm, University of Toronto,Canada

Ron Unrau, University of Toronto,Canada

Jonathan Hanna, University of Toronto,Canada

pp. 201-204

PDF

Experiments With Configurable Locks for Multiprocessors (Abstract)

Bodhisattwa Mukherjee, Georgia lnstitute of Technology

Karsten Schwan, Georgia lnstitute of Technology

pp. 205-208

PDF

On Resources Allocation in Binary n-Cube Network Systems (Abstract)

Nian-Feng Tzeng, University of Southwestern Louisiana

Gui-Liang Feng, University of Southwestern Louisiana

pp. 209-212

PDF

A Distributed Load Balancing Scheme for Data Parallel Applications (Abstract)

Walid R. Tout, Michigan State University

Sakti Pramanik, Michigan State University

pp. 213-216

PDF

Would You Run it Here or There? AHS: Automatic Heterogeneous Supercomputing (Abstract)

H. G. Dietz, Purdue University

W.E. Cohen, Purdue University

B.K. Grant, Purdue University

pp. 217-221

PDF

SESSION 9B: TASK GRAPH/DATA FLOW

A Concurrent Dynamic Task Graph (Abstract)

Theodore Johnson, University of Florida

pp. 223-230

PDF

Unified Static Scheduling on Various Models (Abstract)

Liang-Fang Chao, Princeton University

Edwin Hsing-Mean Sha, University of Notre Dame

pp. 231-235

PDF

Dataflow Graph Optimization for Dataflow Architectures a Dataflow Otimizing Compiler (Abstract)

Sholin Kyo, NEC Corporation, Japan

Shin'ichiro Okazaki, NEC Corporation, Japan

Masanori Mizoguchi, NEC Corporation, Japan

pp. 236-240

PDF

Increasing Instruct ion-level Parallelism through Multi-way Branching (Abstract)

Soo-Mook Moon, IBM Thomas J. Watson Research Center, NY

pp. 241-245

PDF

Optimizing Parallel Programs Using Affinity Regions (Abstract)

Bill Appelbe, Georgia Institue of Technology, Atlanta, GA

Batakrishnan Lakshmanan, Georgia Institue of Technology, Atlanta, GA

pp. 246-249

PDF

SESSION 10B: DATA DISTRIBUTION/PARTITIONING

A Model for Automatic Data Partitioning (Abstract)

Paul D. Hovland, University of Illinois at Urbana-Champaign

Lionel M. Ni, Michigan State Universiby

pp. 251-259

PDF

Multi-Level Communication Structure for Heirarchical Gain Aggregation (Abstract)

D. H Gill, The MITRE Corporation, McLean, Virginia

T.J Smith, The MITRE Corporation, McLean, Virginia

T.E Gerasch, The MITRE Corporation, McLean, Virginia

C.L McCreary, Auburn University, Alabama

pp. 260-264

PDF

Dependence-Based Complexity Metwircs for Distributed Programs (Abstract)

Jingde Cheng, Kyushu University

pp. 265-268

PDF

Automatically Mapping Sequential Objects to Concurrent Objects: The Mutual Exclusion Problem (Abstract)

David L. Sims, University of Cincinnati

Debra A. Hensgen, University of Cincinnati

pp. 269-272

PDF

Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers (Abstract)

Tzung-Shi Chen, National Central University, Taiwan

Jang-Ping Sheu, National Central University, Taiwan

pp. 273-277

PDF

SESSION 11B: MISCELLANEOUS

Improving RAID-5 Performance by Un-striping Moderate-Sized Files (Abstract)

Ronald K. McMurdy, Rensselaer Polytechnic Institute, Troy, New York

Badrinath Roysam, Rensselaer Polytechnic Institute, Troy, New York

pp. 279-282

PDF

On Performance and Efficiency of VLIW and Superscalar (Abstract)

Soo-Mook Moon, IBM Thomas J. Watson research, NY

kemal Ebcioglu, IBM Thomas J. Watson research, NY

pp. 283-287

PDF

Efficient Broadcast in All-Port Wormhole-Routed Hypercubes (Abstract)

Philip K. McKinley, Michigan State University

Christian Trefftz, Michigan State University

pp. 288-291

PDF

Implementing Speculative Parallelism in Possible Computational Worlds (Abstract)

Debra S. Jusak, Western Washington University

James Hearne, Western Washington University

Hilda Halliday, Western Washington University

pp. 292-296

PDF

System-Level Diagnosis Strategies for n-star Multiprocessor Systems (Abstract)

A. Kavianpour, DeVry Institute of Technology

pp. 297-300

PDF

On Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines (Abstract)

S. K. S. Gupta, Ohio State University Columbus

S. D. Kaushik, Ohio State University Columbus

S. Mufti, Ohio State University Columbus

S. Sharma, Ohio State University Columbus

C.-H. Huang, Ohio State University Columbus

P. Sadayappan, Ohio State University Columbus

pp. 301-305

PDF

Author Index

Author Index (PDF)

pp. 306