3. CONPAR 1994: Linz, Austria

Keynote Addresses

• Kai Hwang:
  Scalability and Programmability of Massively Parallel Processors. 1-4
  
• Ian T. Foster, Carl Kesselman:
  Language Constructs and Runtime Systems for Compositional Parallel Programming. 5-16
  
• Monica S. Lam:
  Locality Optimizations for Parallel Machines. 17-28
  

Performance Analyis and Monitoring

• Bernd Mohr, Darryl Brown, Allen D. Malony:
  TAU: A Portable Parallel Program Analysis Environment for pC++. 29-40
  
• Harald Wabnig, Günter Haring, Dieter Kranzlmüller, Jens Volkert:
  Communication Pattern Based Performance Prediction on the nCUBE 2 Multiprocessor System. 41-52
  
• Alois Ferscha, James Johnson:
  Performance Oriented Development of SPMD Programs Based on Task Structure Specifications. 53-65
  
• Siegfried Grabner, Dieter Kranzlmüller:
  Monitoring for Detecing Bugs and Blocking Communication. 66-75
  
• Luk Levrouw, Koenraad Audenaert:
  Minimizing the Log Size for Execution Replay of Shared-Memory Programs. 76-87
  
• Wolfgang Kastner, Stefan Stöckler, René Zeitlberger:
  GOLD MINE: Specification Language for Event-Based Monitoring. 88-99
  

Parallel Program Development

• Luc Bougé, Yann Le Guyadec, Gil Utard, Bernard Virot:
  On the Expressivity of a Weakest Precondition Calculus for a Simple Data-Parallel Programming Language. 100-111
  
• Eric Violard, Guy-René Perrin:
  Reduction in PEI. 112-123
  
• D. K. Arvind, B. R. J. McConnell:
  Towards the Synthesis of Asynchronous Concurrent Programs. 124-135
  
• A. Max Geerling:
  Formal Derivation of SIMD Parallelism from Non-Linear Recursive Specifications. 136-147
  
• Stephen Fitzpatrick, Terence J. Harmer, James M. Boyle:
  Deriving Efficient Parallel Implementations of Algorithms Operating on General Sparse Matrices Using Automatic Program Transformation. 148-159
  
• Stephan Kindermann:
  Flexible Program and Architecture Specification for Massively Parallel Systems. 160-171
  
• Stanislav Sedukhin, Igor S. Sedukhin:
  Systematic Approach and Software Tool for Systolic Design. 172-183
  
• Lawrence Lau, Mike Rezny, John Belward, Kevin Burrage, Bert Pohl:
  ADVISE - Agricultural Developmental Visualisation Interactive Software Environment. 184-195
  
• Ulrich Detert, Michael Gerndt:
  TOP² Tool Suite for the Development and Testing of Parallel Applications. 196-207
  

Parallel Algorithms and Complexity Models

• Margarita Amor, María J. Martín, Dora Blanco Heras, Oscar G. Plata, Francisco F. Rivera, Francisco Argüello:
  Vectorization of the Radix r Self-Sorting FFT. 208-217
  
• Maurice Clint, Jim Weston, J. B. Flannagan:
  Efficient Gram-Schmidt Orthogonalisation on an Array Processor. 218-228
  
• Mile K. Stojcev, Emina I. Milovanovic, Milan D. Mihajlovic, Igor Z. Milovanovic:
  Parallel Algorithm for Inverting Tridiagonal Matrix on Linear Processor Array. 229-240
  
• Tudor Jebelean:
  Systolic Algorithms for Long Integer GCD Computation. 241-252
  
• Beniamino Di Martino, Giulio Iannello:
  Parallelization of Non-Simultaneous Iterative Methods for Systems of Linear Equations. 253-264
  
• Thomas Rauber, Gudula Rünger:
  Hypercube Implementation and Performance Analysis for Extrapolation Models. 265-276
  
• Wolf Zimmermann, Welf Löwe:
  An Approach to Machine-Independent Parallel Programming. 277-288
  
• Steven David Prestwich:
  On Logic Program Parallelisation Strategies. 289-300
  
• Selim G. Akl, Lorrie Fava Lindon:
  Paradigms Admitting Superunitary Behaviour in Parallel Computation. 301-312
  
• Carla Limongelli, Roberto Pirastu:
  Exact Solution of Linear Systems over Rational Numbers by Parallel p-adic Arithmetic. 313-323
  
• Hoon Hong, Hans-Wolfgang Loidl:
  Parallel Computation of Modular Multivariate Polynominal Resultants on a Shared Memory Machine. 325-336
  
• Yoshio Tanaka, Shogo Matsui, Atsushi Maeda, Masakazu Nakanishi:
  Partial Marking GC. 337-348
  
• Stavros D. Nikolopoulos:
  Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. 349-358
  
• Michèle Dion, Marc Gengler, Stéphane Ubéda:
  Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. 359-370
  
• Jingsen Chen:
  Parallel Heap Construction Using Multiple Selection. 371-380
  
• Ian Gorton, Toong Shoon Chan, Innes Jelly:
  Engineering High Quality Parallel Software Using PARSE. 381-392
  
• Alfred Spalt, Edith Spiegl, Thomas Meikl:
  Massively Parallel Volume Rendering. 393-404
  
• Wolfgang Stürzlinger, Christoph Wild:
  Parallel Visibility Computations for Parallel Radiosity. 405-413
  

Parallel Architectures and Abstract Machines

• Mateo Valero, Montse Peiron, Eduard Ayguadé:
  Memory Access Synchronization in Vector Multiprocessors. 414-425
  
• Mazin S. Yousif, Chita R. Das:
  A Switch Cache Design for MIN-Based Shared-Memory Multiprocessors. 426-437
  
• R. Kattner, M. Eger, Christian Müller-Schloer:
  Modeling Cache Coherence Overhead with Geometric Objects. 438-448
  
• Stefan Lüpke:
  Accelerated Access to Shared Distributed Arrays on Distribued Memory Systems by Access Objects. 449-460
  
• Rudolf Berrendorf, Michael Gerndt, Zakaria Lahjomri, Thierry Priol:
  A Comparison of Shared Virtual Memory and Message Passing Programming Techniques Based on a Finite Element Application. 461-472
  
• Renate Dohmen:
  Comparison Between a Message Passing and a Global Shared Memory Parallel Computer by Means of a Concrete Monte-Carlo Algorithm. 473-484
  
• R. Milikowski, Willem G. Vree:
  Non-homogeneous Parallel Memory Operations in a VLIW Machine. 485-496
  
• Torsten Bülck, Achim Held, Werner E. Kluge, Stefan Pantke, Carsten Rathsack, Sven-Bodo Scholz, Raimund Schröder:
  Experience with the Implementation of a Concurrent Graph Reduction System on an nCube/2 Platform. 497-508
  
• Patrick Lincoln, José Meseguer, Livio Ricciulli:
  The Rewrite Rule Machine Node Architecture and Its Performance. 509-520
  
• Kevin Hammond, James S. Mattson Jr., Simon L. Peyton Jones:
  Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer. 521-532
  
• Wolfgang Schreiner:
  Virtual Tasks for the PACLIB Kernel. 533-544
  
• Jean-Yves Le Gall, François Simon:
  MUSE: a Message Passing Concurrent Computer for On-Board Space Systems. 545-556
  
• R. S. Hogg, David W. Lloyd, W. I. Hughes:
  Self-Timed Communication Strategies for Massively Parallel Systolic Architectures. 557-567
  

Parallel Languages and Compiler Technology

• Nikolay N. Mirenkov:
  VIM Language Paradigm. 569-580
  
• Ming-Dong Feng, Yaoqing Gao, Chung-Kwong Yuen:
  Distributed Linda Tuplespace Algorithms and Implementations. 581-592
  
• Peter R. Bailey, Malcolm C. Newey, David Sitsky, Robin Stanton:
  Supporting Coarse and Fine Grain Parallelism in an Extension of ML. 593-604
  
• Christophe Calvin, Laurent Colombet, Frederic Desprez, B. Jargot, Philippe Michallon, Bernard Tourancheau, Denis Trystram:
  Towards Mixed Computation/Communication in Parallel Scientific Libraries. 605-615
  
• Ross A. Bagley, Philip A. Wilsey, Nael B. Abu-Ghazaleh:
  Composing Functional Unit Blocks for Efficient Interpretation of MIMD Code Sequences on SIMD Processors. 616-627
  
• Josep Llosa, Mateo Valero, José A. B. Fortes, Eduard Ayguadé:
  Using Sacks to Organize Registers in VLIW Machines. 628-639
  
• Ramaswamy Govindarajan, Erik R. Altman, Guang R. Gao:
  A Framework for Resource-Constrained Rate-Optimal Software Pipelining. 640-651
  
• Jean-Yves Berthou:
  Design of a Meta-Parallelizer for Large Scientific Applications. 652-663
  
• Barbara M. Chapman, Piyush Mehrotra, John Van Rosendale, Hans P. Zima:
  A Software Architecture for Multidisciplinary Applications: Integrating Task and Data Parallelism. 664-676
  
• Martin Griebl, Christian Lengauer:
  On Scanning Space-Time Mapped While Loops. 677-688
  
• Mourad Raji Werth, Paul Feautrier:
  Optimizing Communications by Using Compile Time Analysis. 689-700
  
• Rumen Andonov, Sanjay V. Rajopadhye:
  Optimal Tile Sizing. 701-712
  
• Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert:
  Evaluating Array Expressions on Massively Parallel Machines with Communication/ Computation Overlap. 713-724
  
• S. P. Johnson, Cos S. Ierotheou, Mark Cross, P. F. Leggett:
  User Interaction and Symbolic Extensions to Dependence Analysis. 725-736
  
• Vadim Maslov, William Pugh:
  Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise. 737-748
  

Networks and Routing

• Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel:
  Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks. 749-760
  
• Roman Trobec, Izidor Jerebic:
  Optimization of Diagnostic Examination. 761-772
  
• Guihai Chen, Francis C. M. Lau:
  Laying Out Midimew Networks with Constant Dilation. 773-784
  
• Pierre Fraigniaud, Cyril Gavoille:
  Optimal Interval Routing. 785-796
  
• Afonso Ferreira, Alfredo Goldman vel Lejbman, Siang W. Song:
  Broadcasting in Bus Interconnection Networks. 797-807
  
• Dominique Désérable:
  Broadcasting in the Arrowhead Torus. 808-819
  

Scheduling in Distributed Memory Systems

• Ismail Haritaoglu, Cevdet Aykanat:
  An Efficient Mapping Heuristic for Mesh-Connected Parallel Architectures Based on Mean Field Annealing. 820-831
  
• Markus Schwehm, Thomas Walter:
  Mapping and Scheduling by Genetic Algorithms. 832-841
  
• Jürgen W. Meyer:
  Self-Organizing Processes. 842-853
  
• Thierry Le Sergent, Bernard Berthomieu:
  Balancing Load under Large and Fast Load Changes in Distributed Computing Systems - A Case Study. 854-865
  
• A. Elleuch, Rushed Kanawati, Traian Muntean, El-Ghazali Talbi:
  Dynamic Load Balancing Mechanisms for a Parallel Operating System Kernel. 866-877
  
• Jean-Louis Roch, A. Vermeerbergen, Gilles Villard:
  A New Load-Prediction Scheme Based on Algorithmic Cost Functions. 878-889