2. Euro-Par 1996: Lyon, France

Invited Talks

• Ian T. Foster:
  High-Performance Distributed Computing: The I_WAY Experiment and Beyond. 3-10
  
• Pascale Guerdoux-Jamet, Dominique Lavenier, Charles Wagner, Patrice Quinton:
  Design and Implementation of a Parallel Architecture for Biological Sequence Comparison. 11-24
  
• William F. McColl:
  Universal Computing. 25-36
  
• Erhard Rahm:
  Dynamic Load Balancing in Parallel Database Systems. 37-52
  

Workshop 01: Programming Environment and Tools

• Steven T. Hackstadt, Allen D. Malony:
  Distributed Arry Query and Visualization for High Performance Fortran. 55-63
  
• Christian Clémençon, Akiyoshi Endo, Josef Fritscher, Andreas Müller, Brian J. N. Wylie:
  Annai Scalable Run-Time Support for Interactive Debugging and Performance Analysis of Large-Scale Parallel Programs. 64-69
  
• Michiel Ronsse, Luk Levrouw:
  On the Implementation of a Reply Mechanism. 70-73
  
• Lionel Brunie, Olivier Reymann:
  Concepts and Funtionalities of the DOSMOS-Trace Monitoring Tool. 74-77
  
• Thomas Ludwig, Michael Oberhuber, Roland Wismüller:
  An Open Monitoring System for Parallel and Distributed Programs. 78-83
  
• Roy Friedman, Maxim Goldin, Ayal Itzkovitz, Assaf Schuster:
  Millipede: Easy Parallel Programming in Available Distributed Environments (Extended Abstract). 84-87
  
• Jeffrey K. Hollingsworth, Barton P. Miller:
  An Adaptive Cost System for Parallel Program Instrumentation. 88-97
  
• Didier Badouel, Thierry Priol, Luc Renambot:
  SVMview: A Performance Tuning Tool for DSM-Based Parallel Computers. 98-105
  
• Sarah A. M. Talbot, Andrew J. Bennett, Paul H. J. Kelly:
  Cautions, Machine-Independent Performance Tuning for Shared-Memory Multiprocessors. 106-113
  
• Gilbert Cabillic, Isabelle Puaut:
  Dealing with Heterogeneity in Stardust: An Environment for Parallel Programming on Networks of Heterogeneous Workstations. 114-119
  
• Klaus Wolf, Ottmar Krämer-Fuhrmann:
  An Integrated Environment to Design Parallel Object-Oriented Applications. 120-127
  
• Al Geist, William Gropp, Steven Huss-Lederman, Andrew Lumsdaine, Ewing L. Lusk, William Saphir, Anthony Skjellum, Marc Snir:
  MPI-2: Extending the Message-Passing Interface. 128-135
  
• Isabelle Attali, Denis Caromel, Romain Guider, Andrew L. Wendelborn:
  Optimizing Sisal Programs: A Formal Approach. 136-144
  
• Lars S. Nyland, Jan Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner:
  A Refinement Methodology for Developing Data-Parallel Applications. 145-150
  
• Silvia A. Crivelli, Elizabeth R. Jessup:
  Task Parallelism: What a Tool Can Provide and What Should Be Left to the User. 151-154
  
• Loïc Prylli, Bernard Tourancheau:
  Efficient Block Cyclic Data Redistribution. 155-164
  
• Frederic Desprez, Pierre Ramet, Jean Roman:
  Optimal Grain Size Computation for Pipelined Algorithms. 165-172
  
• Dominique Sueur, Jean-Luc Dekeyser:
  Dynamic Redistribution on Heterogeneous Parallel Computers. 173-177
  
• Cliff Addison, Tim Oliver, Andy Sunderland:
  Supporting Distributed Sparse Matrix Objects. 178-183
  

Workshop 02: Routing and Communication in Interconnection Networks

• Matt Welsh, Anindya Basu, Thorsten von Eicken:
  Low-Latency Communication over Fast Ethernet. 187-194
  
• Melanie L. Fulgham, Lawrence Snyder:
  A Comparison of Input and Output Driven Routers. 195-204
  
• José Duato, Manuel P. Malumbres:
  Optimal Topology for Distributed Shared-Memory Multiprocessors: Hypercubes Again? 205-212
  
• Daniel G. Rice, José G. Delgado-Frias, Douglas H. Summerville:
  A Pattern-Associative Router for Interconnection Network Adaptive Algorithms. 213-217
  
• H. Bourdin, Afonso Ferreira, K. Marcus:
  On Stack-Graph OPS-Based Lightwave Networks. 218-221
  
• Volker Heun, Ernst W. Mayr:
  A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. 222-233
  
• H. K. Dai:
  The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. 234-242
  
• Dominique Barth:
  Bandwidth and Cutwidth of the Mesh of d-Ary Trees. 243-246
  
• Marcelo Moraes de Azevdeo, Nader Bagherzadeh, Shahram Latifi:
  Variable-Dilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing. 247-252
  
• Luis Díaz de Cerio, Miguel Valero-García, Antonio González:
  Overlapping Communication and Computation in Hypercubes. 253-257
  
• Miriam Di Ianni:
  Efficient Delay Routing (Extended Abstract). 258-269
  
• Christos Kaklamanis, Danny Krizanc:
  Multipacket Hot-Potato Routing on Processor Arrays. 270-277
  
• Myung-Kyun Kim, Hyunsoo Yoon, Seung Ryoul Maeng:
  A Necessary and Sufficient Condition for Proper Routing in Omega-Omega Network. 278-282
  
• Charles Delorme, Petrisor Panaite:
  Rubik Routing Permutations on Graphs. 283-286
  
• Shobana Balakrishnan, Füsun Özgüner:
  The Effect of Flow Control and Routing Adaptivity on Priority-Driven Traffic in Multiprocessor Networks. 287-298
  
• Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze:
  Routing on Networks of Optical Crossbars (Extended Abstract). 299-306
  
• Fabrizio Petrini, Marco Vanneschi:
  Latency and Bandwidth Requirements of Massively Parallel Programs: FFT as a Case Study. 307-312
  
• Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela:
  Induced Broadcasting Algorithms in Iterated Line Digraphs. 313-324
  
• Stephane Perennes:
  Lower Bounds on Broadcasting Time of de Bruijn Networks. 325-332
  
• Christian Laforest:
  Gossip in Trees under Line-Communication Mode. 333-340
  
• Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos:
  Tota; Exchange in Cayley Networks. 341-346
  
• Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos:
  Leaf Communications in Complete Trees. 347-352
  
• Satoshi Fujita, Christian Laforest, Stephane Perennes:
  A Gossip Algorithm for Bus Networks with Buses of Limited Length. 353-360
  
• Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn:
  Worm-Hole Gossiping on Meshes. 361-369
  
• Olivier Delmas, Stephane Perennes:
  Circuit-Switched Gossiping in 3-Dimensional Torus Networks. 370-373
  

Workshop 03: Automatic Parallelization and High Performance Compilers

• Alain Darte, Frédéric Vivien:
  On the Optimality of Allen and Kennedy's Algorithm for Parallel Extraction in Nested Loops. 379-388
  
• Doran Wilde, Sanjay V. Rajopadhye:
  Memory Reuse Analysis in the Polyhedral Model. 389-397
  
• Kunio Okuda:
  Cycle Shrinking by Dependence Reduction. 398-401
  
• Marta Jiménez, José M. Llabería, Agustin Fernández, Enric Morancho:
  A Unified Transformation Technique for Multilevel Blocking. 402-405
  
• Jean-Francois Collard, Martin Griebl:
  Array Dataflow Analysis for Explicitly Parallel Programs. 406-413
  
• Martin C. Rinard, Pedro C. Diniz:
  Semantic Foundations of Commutativity Analysis. 414-423
  
• Denis Barthou, Jean-Francois Collard, Paul Feautrier:
  Applicaions of Fuzzy Array Dataflow Analysis. 424-427
  
• Andreas Eberhart, Jinke Li:
  Simplifying Communication Induced by Operations of Block-Distributed Arrays. 428-431
  
• Michael F. P. O'Boyle, Rupert W. Ford, Andy Nisbet:
  Compiler Reduction of Invalidation Traffic in Virtual Shared Memory Systems. 432-440
  
• Jens Knoop:
  Partial Dead Code Elimination for Parallel Programs. 441-450
  
• Claude G. Diderich, Marc Gengler:
  Solving the Constant-Degree Parallelism Alginment Problem. 451-454
  
• Matthias Besch, Hans Werner Pohl:
  Topographic Data Mapping by Balanced Hypershere Tessellation. 455-458
  
• Thomas Brandes, Frederic Desprez:
  Implementing Pipelined Computation and Communication in an HPF Compiler. 459-462
  
• Michel Barreteau, Paul Feautrier:
  Efficient Mapping of Interdependent Scans. 463-466
  
• Martin Griebl, Christian Lengauer:
  Classifying Loops for Space-Time Mapping. 467-474
  

Workshop 04: Distributed Systems and Algorithms

• Toni Cortes, Sergi Girona, Jesús Labarta:
  PACA: A Cooperative File System Cache for Parallel Machines. 477-486
  
• Jim Smith, Santosh K. Shrivastava:
  A System for Fault-Tolerance Execution of Data and Compute Intensive Programs over a Network of Workstations. 487-495
  
• Ajay D. Kshemkalyani:
  A Framework for Viewing Atomic Events in Distributed Computations. 496-505
  
• Dae-Kyun Yoon, Jean-Luc Gaudiot:
  Worker-Based Parallel Computing on PVM. 506-509
  
• Antony I. T. Rowstron, Alan Wood:
  An Efficient Distributed Tuple Space Implementation for Networks of Workstations. 510-513
  
• Jenn-Wei Lin, Sy-Yen Kuo:
  A Highly Available Partition-Processing Protocol for Distributed Shared Memory Systems. 514-521
  
• Jesús Carretero, Felix Pérez, Pedro de Miguel, Francisco García, L. Alonso:
  I/O Data Mapping in ParFiSys: Support for High-Performance I/O in Parallel and Distributed Systems. 522-525
  
• Vicent Cholvi, José M. Bernabéu-Aubán:
  Correctness Proof for a Distributed Memory System. 526-531
  
• José M. Piquer:
  Distributed Shared Memory Based on Group Large Causality. 532-537
  

Workshop 05+21: Parallel Languages, Programming, and High-Level Control

• Rajesh Bordawekar, Alok N. Choudhary, J. Ramanujam:
  A Framework for Integrated Communication and I/O Placement. 541-552
  
• Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi:
  Formal Derivation of Parallel Program for 2-Dimensional Maximum Segment Sum Problem. 553-562
  
• Yvon Jégou:
  The Migrating Tasks: An Execution Model for Irregular Codes. 563-570
  
• Fabien Coelho:
  Discussing HPF Design Issues. 571-578
  
• Wei-Ngan Chin, John Darlington, Yike Guo:
  Parallelizing Conditional Recurrences. 579-586
  
• Hiroki Konaka, Yoshiaki Itoh, Takashi Tomokiyo, Munenori Maeda, Yutaka Ishikawa, Atsushi Hori:
  Adaptive Data Parallel Computation in the Parallel Object-Oriented Language OCore. 587-596
  
• Noemi de La Rocque Rodriguez, Cristina D. Ururahy, Roberto Ierusalimschy, Renato Cerqueira:
  The Use of Interpreted Languages for Implementing Parallel Algorithms on Distributed Systems. 597-600
  
• Peter Au, John Darlington, Moustafa Ghanem, Yike Guo, Hing Wing To, Jin Yang:
  Co-ordinating Heterogeneous Parallel Computation. 601-614
  
• Luc Moreau:
  Correctness of a Distributed-Memory Model for Scheme. 615-624
  
• Haruo Hosoya, Naoki Kobayashi, Akinori Yonezawa:
  Partial Evaluation Scheme for Concurrent Languages and Its Correctness. 625-632
  
• Raju Pandey, James C. Browne:
  Support for Implementation of Evolutionary Concurrent Systems in Concurrent Programming Languages. 633-645
  
• Laxmikant V. Kalé, Milind A. Bhandarkar:
  Structured Dagger: A Coordination Language for Message-Driven Programming. 646-653
  
• Ansgar Brüll, Herbert Kuchen:
  TPascal - A Language for Task Parallel Programming. 654-659
  
• Johan Lilius:
  OB(PN)²: An Object Based Petri Net Programming Notation (Extended Abstract). 660-663
  
• Farhad Arbab, C. L. Blom, F. J. Burger, C. T. H. Everaars:
  Reusable Coordinator Modules for Massively Concurrent Applications. 664-677
  
• Olivier Michel:
  Introducing Dynamicity in the Data-Parallel Language 8½. 678-685
  
• Andrew Douglas, Niklas Röjemo, Colin Runciman, Alan Wood:
  Astro-Gofer: Parallel Functional Programming with Co-ordinating Processes. 686-693
  
• Petros Kefalas, Ioannis P. Vlahavas:
  Multiple OR-Parallel Resolution: Meta-Level Control of Parallel Logic Programs. 694-703
  
• Jürgen Knopp:
  High Level Parallel Programming Based on Automatic Coordination. 704-709
  
• Silvia Breitinger, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Peña-Marí:
  Eden - The Paradise of Functional Concurrent Programming. 710-713
  
• Olivier Michel:
  A Straightforward Translation of D0L Systems in the Declarative Data-Parallel Language 8½. 714-717
  
• George Horatiu Botorog, Herbert Kuchen:
  Efficient Parallel Programming with Algorithmic Skeletons. 718-731
  
• Yann Le Guyadec, Emmanuel Melin, Bruno Raffin, Xavier Rebeuf, Bernard Virot:
  A Loosely Synchronized Execution Model for a Simple Data-Parallel Language (Extended Abstract). 732-741
  
• Alexander V. Shafarenko:
  A Nonannotative Approach to Distributed Data-Parallel Computing. 742-751
  
• Stefano Russo, Carlo Savy, Innes Jelly, Peter Collingwood:
  Petri Net Modelling of PARSE Designs. 752-761
  
• Franz Puntigam:
  Synchronization Expressed in Types of Communication Channels. 762-769
  
• J. P. Wray:
  Laws of Data Parallel Assignment. 770-774
  
• Ricardo Peña-Marí, Luis A. Galán:
  Proving Progress Properties of non Terminating Programs under Fairness Assumptions. 775-778
  

Workshop 06: Parallel Discrete Algorithms

• Paolo Ferragina:
  A Simple Parallel Dictionary Matching Algorithm. 781-788
  
• Axel Podehl, Thomas Rauber, Gudula Rünger:
  Scalability and Granularity Issues of the Hierarchical Radiosity Method. 789-798
  
• Jop F. Sibeyn:
  List Ranking on Interconnection Networks. 799-808
  
• Erik Urland:
  Parallel Algorithm for Computing the Fragment Vector in Steiner Triple Systems. 809-812
  
• A. S. Nepomniaschaya:
  Representation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors. 813-817
  
• Kam Hong Shum, Shuo-Yen Robert Li:
  Runtime Support for Replicated Parallel Simulators of an ATM Network on Workstation Clusters. 818-821
  
• Thomas Rauber, Gudula Rünger, Carsten Scholtes:
  Shared-Memory Implementation of an Irregular Particle Simulation Method. 822-827
  
• Vamsi Boppana, Prashant Saxena, Prithviraj Banerjee, W. Kent Fuchs, C. L. Liu:
  A Parallel Algorithm for the Technology Mapping of LUT-Based FPGAs. 828-831
  
• Fouzia Moussouni, Christian Lavault:
  Distributed String Matching Algorithm on the N-cube. 832-835