1. Euro-Par 1995: Stockholm, Sweden

Keynotes

• Gregory M. Papadopoulos:
  Mainstream Parallelism: Taking Sides on the SMP/MPP/Cluster Debate. 3
  
• Gert Smolka:
  The Oz Programming Model (Extended Abstract). 5-8
  
• Björn Engquist:
  Parallelism in Computational Algorithms and the Physical World. 9-11
  

Language Implementation I

• Paul Caspi, Alain Girault:
  Execution of Distributed Reactive Systems. 15-26
  
• Manuel V. Hermenegildo, Manuel Carro:
  Relating Data-Parallelism and (And-) Parallelism in Logic Programs. 27-41
  
• Enrico Pontelli, Gopal Gupta:
  On the Duality Between Or-parallelism and And-parallelism in Logic Programming. 43-54
  
• John Darlington, Yike Guo, Hing Wing To, Jin Yang:
  Functional Skeletons for Parallel Coordination. 55-66
  

Architecture Design

• Ronald C. Unrau, Michael Stumm, Orran Krieger:
  On the Scalability of Demand-Driven Parallel Systems. 69-81
  
• Sally A. McKee, William A. Wulf, Trevor C. Landon:
  Bounds on Memory Bandwidth in Streamed Computations. 83-99
  
• Derek Chiou, Boon Seong Ang, Robert Greiner, Arvind, James C. Hoe, Michael J. Beckerle, James E. Hicks, G. Andrew Boughton:
  START-NG: Delivering Seamless Parallel Computing. 101-116
  
• Olivier Maquelin, Herbert H. J. Hum, Guang R. Gao:
  Costs and Benefits of Multithreading with Off-the-Shelf RISC Processors. 117-128
  

Semantics and Tools

• Stéphane Genaud, Eric Violard, Guy-René Perrin:
  Transformation Techniques in PEI. 131-142
  
• Luc Bougé, David Cachera:
  On the Completeness of a Proof System for a Simple Data-Parallel Programming Language. 143-154
  
• Christian Clémençon, Josef Fritscher, M. J. Meehan, Roland Rühl:
  An Implementation of Race Detection and Deterministic Replay with MPI. 155-166
  
• Alain Fagot, Jacques Chassin de Kergommeaux:
  Formal and Experimental Validation of a Low Overhead Execution Replay Mechanism. 167-178
  

Interconnection Networks

• Thomas Römke, Markus Röttger, Ulf-Peter Schroeder, Jens Simon:
  On Efficient Embeddings of Grids into Grids in PARIX. 181-192
  
• Alf-Christian Achilles:
  Optimal Emulation of Meshes on Meshes of Trees. 193-204
  
• Sajal K. Das, Aisheng Mao:
  Optimal Embeddings in the Hamming Cube Networks. 205-216
  
• Ziqiang Liu:
  Hierarchical Adaptive Routing Under Hybrid Traffic Load. 217-228
  

Parallel Algorithms I

• Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
  Tight Bounds on Parallel List Marking. 231-242
  
• Welf Löwe:
  Optimization of PRAM-Programs with Input-Dependent Memory Access. 243-254
  
• Lin Chen:
  Optimal Circular Arc Representations. 255-266
  

Cache Systems

• Andreas Nowatzyk, Gunes Aybay, Michael C. Browne, Edmund J. Kelly, Michael Parkin, Bill Radke, Sanjay Vishin:
  Exploiting Parallelism in Cache Coherency Protocol Engines. 269-286
  
• Fong Pong, Andreas Nowatzyk, Gunes Aybay, Michel Dubois:
  Verifying Distributed Directory-Based Cahce Coherence Protocols: S3.mp, a Case Study. 287-300
  
• Se-Jin Hwang, Myong-Soon Park:
  Efficient Software Data Prefetching for a Loop with Large Arrays. 301-312
  

Loop Parallelization

• Martin Griebl, Jean-Francois Collard:
  Generation of Synchronous Code for Automatic Parallelization of while Loops. 315-326
  
• Dattatraya Kulkarni, Michael Stumm, Ronald C. Unrau:
  Implementing Flexible Computation Rules with Subexpression-level Loop Transformation. 327-338
  
• Rong-Yuh Hwang:
  Synchronization Migration for Performance Enhancement in a DOACROSS Loop. 339-350
  
• Marc Le Fur, Jean-Louis Pazat, Françoise André:
  An Array Partitioning Analysis for Parallel Loop Distribution. 351-364
  

Load Balancing and Parallel Algorithms II

• A. Erzmann, M. Hadeler, Christian Müller-Schloer:
  A Model for Efficient Programming of Dynamic Applications on Distributed Memory Multiprocessors. 367-378
  
• Pascal Bouvry, Jacques Chassin de Kergommeaux, Denis Trystram:
  Efficient Solutions for Mapping Parallel Programs. 379-390
  
• Thomas Rauber, Gudula Rünger:
  Optimal Data Distributions for LU Decomposition. 391-402
  
• Mark Minas:
  Detecting Quantified Global Predicates in Parallel Programs. 403-414
  

Compiling Techniques

• Chao-Tung Yang, Shian-Shyong Tseng, Cheng-Der Chuang, Wen-Chung Shih:
  Using Knowledge-Based Techniques for Parallelization on Parallelizing Compilers. 417-428
  
• Cécile Germain, Franck Delaplace:
  Automatic Vectorization of Communications for Data-Parallel Programs. 429-440
  
• Marc Pouzet:
  The Program Compaction Revisited: the Functional Framework. 441-456
  
• Ben Sloman, Tom Lake:
  Featherweight Threads and ANDF Compilation of Concurrency. 457-469
  

Applications

• John W. Romein, Henri E. Bal:
  Parallel N-Body Simulation on a Large-Scale Homogeneous Distributed System. 473-484
  
• Erhard Rahm, Thomas Stöhr:
  Analysis of Parallel Scan Processing in Shared Disk Database Systems. 485-500
  
• Adam R. Nolan, Bryan Everding:
  Polynomial Time Scheduling of Low Level Computer Vision Algorithms on Networks of Heterogeneous Machines. 501-512
  
• Bernard Girau:
  Mapping Neural Network Back-Propagation onto Parallel Computers with Computation/Communication Overlapping. 513-524
  

Language Implementation II

• James S. Larson, Barton C. Massey, Evan Tick:
  Super Monaco: Its Portable and Efficient Parallel Runtime System. 527-538
  
• Kazuaki Rokusawa, Akihiko Nakase, Takashi Chikayama:
  Quiescence Detection in a Distributed KLIC Implementation. 539-551
  
• Thomas Lindgren, Johan Bevemyr, Håkan Millroth:
  Compiler Optimizations in Reform Prolog: Experiments on the KSR-1 Multiprocessor. 553-564
  

Interconnection Networks II

• Muhammad Jaseemuddin, Zvonko G. Vranesic:
  Bidirectional Ring: An Alternative to the Hierarchy of Unidirectional Rings. 567-578
  
• Nitin K. Singhvi, Kanad Ghose:
  A Formal Study of the Mcube Interconnection Network. 579-591
  
• Shinichi Shionoya, Takafumi Aoki, Tatsuo Higuchi:
  Multiwave Interconnection Networks for MCM-based Parallel Processing. 593-607
  

Scheduling

• Sartaj Sahni:
  Scheduling Master-Slave Multiprocessor Systems. 611-622
  
• Atsushi Hori, Yutaka Ishikawa, Jörg Nolte, Hiroki Konaka, Munenori Maeda, Takashi Tomokiyo:
  Time Space Sharing Scheduling: A Simulation Analysis. 623-634
  
• Johann Rost, Franz-Josef Markus, Li Yan-Hua:
  "Agency Scheduling" A Model for Dynamic Task Scheduling. 635-646
  

Fault Tolerance and SIMD Arrays

• Mattias Johannesson:
  FFTs on a Linear SIMD Arrat. 649-660
  
• Jang-Ping Sheu, Yuh-Shyan Chen:
  Tolerating Faults in Faulty Hypercubes Using Maximal Fault-Free Subcube-Ring. 661-672
  
• Suresh Chalasani, Rajendra V. Boppana:
  Communication in Multicomputers with Nonconvex Faults. 673-684
  

Posters: Extended Abstracts

• Anatoly E. Doroshenko, Alexander B. Godlevsky:
  Parallelising Programs with Algebraic Programming Tools. 687-690
  
• Katalin Molnár:
  Parallel Prolog with Uncertainty Handling. 691-694
  
• Gerald Friedl, Marco Platzner, Bernhard Rinner:
  A Special-purpose Coprocessor for Qualitative Simulation. 695-698
  
• Catherine Barnes, Chris Wadsworth:
  Portable Software Tools for Parallel Architecture. 699-702
  
• Christoph Siegelin, Ulrich Finger, Ciaran O'Donnell:
  Boosting the Performance of Workstations through WARPmemory. 703-706
  
• Aleksander Laurentowski, Jakub Szymaszek, Andrzej Uszok, Krzysztof Zielinski:
  A Monitoring System for Software-Heterogeneous Distributed Environments. 707-710
  
• Gaétan Hains, John Mullins:
  A Metacircular Data-Parallel Functional Language. 711-714
  
• Jurij Silc, Borut Robic:
  Efficient Run-Time Program Allocation on a Parallel Coprocessor. 715-718
  
• Vladimir A. Evstigneev, Victor N. Kasyanov:
  A Program Manipulation System for Fine-Grained Architectures. 719-722
  
• P. Moravie, Hassane Essafi, C. Lambert-Nebout, J.-L. Basille:
  Real-Time Image Compression Using Data-Parallelism. 723-726
  
• Abdel-Halim Smai:
  Congestion Control in Wormhole Networks: First Results. 727-730