CONPAR 1992: Lyon, France

Networks

• Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
  Tolerating Faults in Synchronization Networks. 1-12
  
• Pavel Tvrdík:
  On Incomplete Hypercubes. 13-24
  
• Naoki Hamanaka, Junji Nakagoshi, Teruo Tanaka:
  Reducing Network Hardware Quantity by Employing Multi-Processor Cluster Structure in Distributed Memory Parallel Processors. 25-30
  
• Sotirios G. Ziavras:
  Connection Machine Results for Pyramid Embedding Algorithms. 31-36
  
• Volker Hatz:
  Interconnection Networks Based on Block Designs. 37-42
  
• V. David, C. Fraboul, J. Y. Rousselot, Pierre Siron:
  Partitioning and Mapping Communication Graphs on a Modular Reconfigurable Parallel Architecture. 43-48
  
• Hans Z. Munthe-Kaas:
  Generalized Shuffle-Exchange Networks. 49-54
  

Software Tools

• Eric Leu, André Schiper:
  Execution Replay: A Mechanism for Integrating a Visualization Tool with a Symbolic Debugger. 55-66
  
• Andreas Bauch, Thomas Kosch, Erik Maehle, Wolfgang Obelöer:
  The Software-Monitor DELTA-T and Its Use for Performance Measurements of Some Farming Variants on the Multi-Transputer System DAMP. 67-78
  
• Thomas Bemmerl, Peter Braun:
  Visualization of Message Passing Parallel Programs. 79-90
  
• Nashat Mansour, Geoffrey Fox:
  Parallel Physical Optimization Algorithms for Data Mapping. 91-96
  
• Jonathan D. Becher, Kent Beck:
  Profiling on a massively Parallel Computer. 97-102
  
• Roger D. Hersch, B. Tonelli, Bernard Krummenacher:
  A Multiprocessor Multiwindow Visualization Subsystem. 103-108
  
• Anton Beranek:
  Data Race Detection Based on Replay for Parallel Applications. 109-114
  
• Jean-Marc Adamo, Christophe Bonello, L. Trejo:
  The C_NET Programming Environment: An Overview. 115-120
  
• Max Lemke, Daniel J. Quinlan:
  P++, a C++ Virtual Shared Grids Based Programming Environment for Architecture-Independent Development of Structured Grid Applications. 121-126
  
• D. K. Arvind, J. Knight:
  Detection of Concurrency-Related Errors in Joyce. 127-132
  

Distributed Algorithms

• Christian Lavault:
  Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal). 133-144
  
• Jörg Schepers:
  Invariance Properties in Distributed Systems. 145-156
  
• Mikhail Makhaniok, Reinhard Männer:
  Synchronization of Parallel Processes in Distributed Systems. 157-162
  
• Pierre Moukeli:
  Statistical Probabilistic Clock Synchronization Algorithm. 163-168
  

Dedicated Architectures

• Wieslaw Lucjan Nowinski:
  A SIMD Architecture for Medical Imaging. 169-180
  
• Rong Lin, Stephan Olariu:
  Computing the Inner Product on Reconfigurable Buses with Shift Switching. 181-192
  
• Stephen P. S. Lam:
  A Novel Sorting Array Processor. 193-204
  

Numerical Applications

• Graham Horton, Ralf Knirsch, Hermann Vollath:
  The Time-Parallel Solution of Parabolic Partial Differencial Equations Using the Frequency-Filtering Method. 205-216
  
• Michael Griebel, W. Huber, Ulrich Rüde, T. Störtkuhl:
  The Combination Technique for Parallel Sparse-Grid-Preconditioning or -Solution of PDEs on Workstation Networks. 217-228
  
• Michael Schäfer, Michael M. Gutzmann, Markus Schwehm:
  Comparing the DAP, Meiko and Suprenum with a Fluid Dynamic Benchmark. 229-240
  
• Christo A. Kabakchiev, Vera P. Behar:
  Parallel Detection Algorithm of Radar Signals. 241-246
  

Systolic Algorithms

• Rumen Andonov, Patrice Quinton:
  Efficient Linear Systolic Array for the Knapsack Problem. 247-258
  
• Jingling Xue:
  On the Loading, Recovery and Access of Stationary Data in Systolic Arrays. 259-264
  
• Jean Frédéric Myoupo, Anne-Cécile Fabret:
  Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. 265-270
  

Parallel Linear Algebra

• Bruno Lang:
  Reducing Symmetric Banded Matrices to Tridiagonal Form - A Comparison of a New Parallel Algorithm with Two Serial Algorithms on the iPSC/860. 271-282
  
• Bob Wilkinson, Lawrence S. Mulholland:
  An Implementation of the BLAS on the i860: A RISC Approach to Software for RISC Devices. 283-294
  
• Pierre Charrier, Jean Roman:
  Partitioning and Mapping for Parallel Nested Dissection on Distributed Memory Architectures. 295-306
  
• Nai-Kuan Tsao:
  On the Accuracy of Solving Triangular Systems in Parallel-III. 307-318
  
• Patrick Amestoy, Michel J. Daydé, Iain S. Duff, Pierre Morère:
  Linear Algebra Calculations on the BBN TC2000. 319-330
  
• G. Chen, H. B. Keller, S. H. Lui, Bernard Roux:
  Parallel Homotopy Algorithm for Large Sparse Generalized Eigenvalue Problems: Application to Hydrodynamic Stability Analysis. 331-342
  
• Przemyslaw Stpiczynski:
  Parallel Algorithms for Solving Linear Recurrence Systems. 434-348
  
• Ilan Bar-On, Ophir Munk:
  A New Parallel Factorization A = DD^tBC for Band Symmetric Positive Definite Matrices. 349-354
  
• L. C. Waring, Maurice Clint:
  Computation of the Eigenvalues of Real Symmetric Matrices Using a Processor Farm. 355-360
  
• J. Mark Bull, T. L. Freeman:
  Numerical Performance of an Asynchronous Jacobi Iteration. 361-366
  
• Emina I. Milovanovic, Igor Z. Milovanovic, Mile K. Stojcev:
  Matrix Inversion Algorithm for Linear Array Processor. 367-372
  
• Serge G. Petiton, Christine Weill-Duflos:
  Massively Parallel Preconditioners for the Sparse Conjugate Gradient Method. 373-378
  
• S. J. Thomas:
  A Block Algorithm for Orthogonalization in Elliptic Norms. 379-385
  

Architectures

• Geraldo Lino de Campos:
  Asynchronous Polycyclic Architecture. 387-398
  
• Peter L. Bird, Nigel P. Topham, Sathiamoorthy Manoharan:
  A Comparison of Two Memory Models for High Performance Computers. 399-404
  
• A. B. Ruighaver:
  A Decoupled Multicomputer Architecture with Optical Full Interconnection. 405-410
  
• Abdelaziz Mzoughi, Mustapha Lalam, Daniel Litaize:
  Very High Speed Vectorial Processors Using Serial Multiport Memory as Data Memory. 411-416
  
• J. A. Keane, K. R. Mayes:
  Resource Management on a Packet-Based Parallel Graph Reduction Machine. 417-422
  
• Ramaswamy Govindarajan, Shashank S. Nemawarkar:
  A Large Context Multithreaded Architecture. 423-428
  

Shared Virtual Memory

• Hermann Hellwagner:
  On the Practical Efficiency of Randomized Shared Memory. 429-440
  
• Zakaria Lahjomri, Thierry Priol:
  KOAN: A Shared Virtual Memory for the iPSC/2 Hypercube. 441-452
  
• Stephan Murer, Philipp Färber:
  A Scalable Distributed Shared Memory. 453-466
  

Load Balancing

• Jean-Louis Roch, A. Vermeerbergen, Gilles Villard:
  Cost Prediction for Load Balancing: Application to Algebraic Computations. 467-478
  
• Konstantin Shteimann, Dror G. Feitelson, Larry Rudolph, Iaakov Exman:
  Envelopes in Adaptive Local Queues for MIMD Load Balancing. 479-484
  
• Erik Tärnvik:
  Dynamo - A Portable Tool for Dynamic Load Balancing on Distributed Memory Multicomputers. 485-490
  

Data Parallelism

• Jean-Luc Levaire:
  Semantics and Compilation of the Data-Parallel Switch Statement. 491-502
  
• Hassane Essafi, Marc Pic, Didier Juvin:
  kappa-Project - First Step: To Improve Data Manipualtions and Representations on Parallel Computers. 503-508
  
• Vyacheslav B. Muchnick, Alexander V. Shafarenko:
  F-Code: A Portable Software Platform for Data-Parallel Languages. 509-514
  

Parallel Algorithms

• Marc Gengler, Giovanni Coray:
  A Parallel Best-First B&B with Synchronization Phases. 515-526
  
• Hongzhong Wu:
  On Tests of Uniform Tree Circuits. 527-538
  
• Jingsen Chen, Christos Levcopoulos:
  Improved Parallel Sorting of Presorted Sequences. 539-544
  
• Thibault Duboux, Afonso Ferreira, Michel Gastaldo:
  MIMD Dictionary Machines: From Theory to Practice. 545-550
  
• Frank Klingspor, Dietmar Luhofer, Thomas Rottke:
  Parallel Searching for 3D-Objects. 551-556
  
• Jean-Louis Roch, Gilles Villard:
  Parallel gcd and Lattice Basis Reduction. 557-564
  
• Selim G. Akl, Ke Qiu:
  Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks. 565-570
  

Image Processing

• Hugo Embrechts, Dirk Roose:
  Parallel Algorithms for the Distance Transformation. 571-582
  
• Reinier van Kleij, Frido Kuijper:
  A Multiprocessor System for Displaying Quadric CSG Models. 583-588
  
• Stephan Olariu, James L. Schwing, Jingyuan Zhang:
  Efficient Image Computations on Reconfigurable Meshes. 589-594
  
• Jean-Luc Levaire, Stéphane Ubéda:
  A Multiscale Parallel Thinning Algorithm. 595-600
  

Compiling and Scheduling

• Apostolos Gerasoulis, Tao Yang:
  Static Scheduling of Parallel Programs for Message Passing Architectures. 601-612
  
• Vincent Van Dongen, Guang R. Gao, Qi Ning:
  A Polynomial Time Method for Optimal Software Pipelining. 613-624
  
• Franco Gasperoni, Uwe Schwiegelshohn:
  Scheduling Loops on Parallel Processors: A Simple Algorithm with Close to Optimum Performance. 625-636
  
• Edward J. Kushner:
  Automatic Parallelization of Grid-Based Applications for the iPSC/860. 637-645
  
• Pierre David:
  Semantic Analysis for Parallelizing C. 647-652
  
• Hong-Jin Yeh:
  A Task Scheduling Algorithm for the Parallel Expression Evaluation in a Reconfigurable Fully Digit On-Line Network. 653-658
  
• Michael Barnett, Christian Lengauer:
  Unimodularity Considered Non-Essential. 659-664
  

Simulation and Performance Analysis

• Michael M. Gutzmann, Klaus Steffan:
  PEPSIM-ST: A Simulator Tool for Benchmarking. 665-676
  
• Roldan Pozo:
  Performance Modeling of Sparse Matrix Methods for Distributed Memory Architectures. 677-688
  
• Thomas Schnekenburger, Michael Friedrich, Andreas Weininger, Thomas Schoen:
  ParSim: A Tool for the Analysis of Parallel and Distributed Programs. 689-700
  
• Jean-Yves Berthou, Philippe Klein:
  Estimating the Effective Performance of Program Parallelization on Shared Memory MIMD Multiprocessors. 701-706
  
• Jean Duprat, Mario Fiallos Aguilar:
  On the Simulation of Pipelining of Fully Digit On-Line Floating-Point Adder Networks on Massively Parallel Computers. 707-712
  

Parallel Artificial Intelligence

• Kifah R. Tout, David J. Evans:
  A Parallel Expert System Using a Backward Chaining Strategy. 713-718
  
• Hélène Paugam-Moisy:
  Optimal Speedup Conditions for a Parallel Back-Propagation Algorithm. 719-724
  
• H. Bourzoufi, Gilles Goncalves, Bernard Toursel:
  A Time-Bounded Binding Access with Low Task-Switching Cost in an OR-Parallel Prolog. 725-730
  

Dataflow Architectures

• Theo Ungerer, Eberhard Zehendner:
  Threads and Subinstruction Level Parallelism in a Dataflow Architecture. 731-736
  
• Boyan Bonchev, Miroslav Iliev:
  A Hybrid Dataflow Architecture with Multiple Tokens. 737-742
  
• Shigeru Kusakabe, Takahide Hoshide, Rin-ichiro Taniguchi, Makoto Amamiya:
  Parallelism Control Scheme in a Dataflow Architecture. 743-748
  

Parallel Programming

• Herwig Unger, Khaled Ben Achour:
  A Petri-Net-Based Method to the Design of Parallel Programs for a Multiprocessor System. 749-754
  
• Fethi A. Rabhi:
  A Parallel Structure for Static Iterative Transformation Algorithms. 755-760
  
• James M. Boyle, Maurice Clint, Stephen Fitzpatrick, Terence J. Harmer:
  The Construction of Numerical Mathematical Software for the AMT DAP by Program Transformation. 761-767
  
• Dennis Gannon, Jenq Kuen Lee, Srinivas Narayana:
  On Using Object-Oriented Parallel Programming to Build Distributed Algebraic Abstractions. 769-774
  

Posters

• V. Demian, J. C. Mignot:
  Implementation of the Self-Organizing Feature Map on Parallel Computers. 775-776
  
• Herbert Kuchen, Holger Stoltze, Friedrich Lücking:
  Candela - A Topology Description Language. 777-778
  
• Boris Shukhman:
  Parallelism in Generation of Sequences for Monte Carlo Simulation. 779-780
  
• Chen Pin, E. V. Krishnamurthy:
  Data Parallel Evaluation-Interpolation Algorithm for Solving Functional Matrix Equations. 781-782
  
• Sabine R. Öhring:
  Dynamic Tree Embeddings into de Bruijn Graphs. 783-784
  
• Rudolf Berrendorf:
  Memory Access in Shared Virtual Memory. 785-786
  
• Jim Weston, Maurice Clint, C. W. Bleakney:
  Parallel Implementations of Jacobi's Algorithm for the Eigensolution of Large Matrices Using Array Processors. 787-788
  
• Bernd Schütz, Reinhard Rauscher:
  A Parallel Architecture for a VLSI-Hardware-Realization. 789-790
  
• Lichen Zhang, Michel Galindo, Daniel Marquie, Yves Raynaud:
  Generating Physical Channel Access Protocol Data Unit of CCSDS Recommendation by Use of the Transputers and OCCAM. 791-792
  
• Farhad Arbab, Ivan Herman, Pål Spilling:
  Manifold: Concepts and Implementation. 793-794
  
• Marie-Christine Eglin-Leclerc, Jacques Julliand, Guy-René Perrin:
  How to Compile Systems of Recurrence Equations into Networks of Communicating Processes. 795-796
  
• M. Bahi:
  Parallel Algorithms Simulation Applied to Differential-Algebraic Systems and Electrical Network Application. 797-798
  
• Zaher Mahjoub, F. Karoui-Sahtout:
  Optimal Performances and Scheduling for Parallel Algorithms with Equal Cost Tasks. 799-800
  
• Gary S. H. Tan, Wei-Ngan Chin:
  Load Balancing in a Neighbourhood-Based Multiprocessor. 801-802
  
• Danny Crookes, A. P. McHale, N. Beney:
  A DAP-Based Implementation of a Portable Parallel Image Processing Machine. 803-804
  
• Joaquim Gabarró:
  The Design of a Parallel Algorithm to Solve the Word Problem for the Free Partially Commutative Groups. 805-806
  
• Marián Vajtersic:
  A VLSI Multigrid Poisson Solver Amenable to Biharmonic Equation. 807-808
  
• P. J. Kulkarni, N. R. Phadnis, Vishwas Udpikar:
  Monochrome Image Coding Using Hierarchical Closed Loop Vector Quantizer on a Multiprocessing System. 809-810
  
• Suresh Srinivas, R. Kent Dybvig:
  Superscalar Floating-Point Vector Computation in Scheme. 811-812
  
• Alak Kumar Datta, Ranjan K. Sen:
  An Efficient Parallel Algorithm for Maximal Matching. 813-814
  
• Jean-Marc Adamo, N. Alhafez:
  Minimal, Adaptive and Deadlock-Free Routing for Multiprocessors. 815-816
  
• Frederic Desprez, Bernard Tourancheau:
  A Theoretical Study of Reconfigurability for Numerical Algorithms on a Reconfigurable Network. 817-818
  
• Annick Fron:
  Multiprocessor Simulation Using Object-Oriented Programming. 819-820
  
• Mile K. Stojcev, Igor Z. Milovanovic, Emina I. Milovanovic, G. S. Jovanovic:
  Real-Number Codes for Fault-Tolerant Matrix Inversion on Processor Arrays. 821-822
  
• Jürgen W. Meyer:
  Automatic Mapping of Parallel Programs onto Processor Networks. 823-824
  
• Peter Zaversek, Peter Kolbezen:
  Dynamic Allocation on the Transputer Network. 825-826
  
• Peter Arbenz, Michael Oettli:
  Block Implementations of the Symmetric QR and Jacobi Algorithms. 827-828
  
• Ralf Knirsch, Klaus Hofmann:
  An Improved Parallel Algorithm for the Solution of Molecular Dynamics Problems on MIMD Multiprocessors. 829-830
  
• Neucimar Jerônimo Leite, Gilles Bertrand:
  Computational Models for Image Processing: Towards a Concise Parallel Language. 831-832
  
• Jie Wu, Eduardo B. Fernández:
  Broadcasting in Faulty Cube-Connected-Cycles with Minimum Recovery Time. 833-834
  
• El-Ghazali Talbi, Pierre Bessière, Juan Manuel Ahuactzin, Emmanuel Mazer:
  Parallel Robot Motion Planning in a Dynamic Environment. 835-836
  
• Lewis M. Mackenzie, Mohamed Ould-Khaoua, Rob J. Sutherland, T. Kelly:
  A Hypergraph-Based Interconnection Network for Large Multicomputers. 837-838
  
• Miltos D. Grammatikakis, Jung-Sing Jwo:
  Greedy Permutation Routing on Caylay Graphs. 839-840
  
• Jean-Marc Adamo, L. Trejo:
  Experimenting upon the CG Algorithm Within the C_NET Programming Environment. 841-842
  
• Dominique Barth:
  An Algorithm of Broadcasting in the Mesh of Trees. 843-844
  
• Lei Zhou:
  Complexity Estimation in the PIPS Parallel Programming Environment. 845-846
  
• Nikolay A. Anisimov, Aleksey Kouvalenko, Pavel Postupalski, Aleksey Simanchuk:
  A Graphical Petri Net Based Editor for a Visualization of Distributed and Parallel Systems. 847-848
  
• Bernd Freisleben, Thilo Kielmann:
  Automatic Parallelization of Divide-and-Conquer Algorithms. 849-850