4. PARLE 1992: Paris, France

Invited Lecture

• Colin J. Skelton, Carsten Hammer, M. Lopez, Mike Reeve, Paul Townsend, Kam-Fai Wong:
  EDS: A Parallel Computer System for Advanced Information Processing. 1-18
  

Implementation of Parallel Programs

• Ying Liu, Ambuj K. Singh, Rajive Bagrodia:
  A Decompositional Approach to the Design of Efficient parallel Programs. 21-36
  
• Jyrki Katajainen:
  Space-Efficient Parallel Merging. 37-49
  

Graph Theory

• Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto:
  On Embedding Interconnection Networks into Rings of Processors. 53-62
  
• John R. W. Glauert:
  Asynchronous Mobile Processes and Graph Rewriting. 63-78
  

Architecture I

• Franck Cappello, Jean-Luc Béchennec, Jean-Louis Giavitto:
  PTAH: Introduction to a New Parallel Architecture for Highly Numeric Processing. 81-96
  
• Peter Osmon, Tom Stiemerling, Tony Valsamidis, Andy Whitcroft, Tim Wilkinson, Nick Williams:
  The Topsy Project: a Position Paper. 97-112
  

Optimal Algorithms

• Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz:
  Optimal Algorithms for Disemination of Information in Generalized Communication Modes. 115-130
  
• Sajal K. Das, Calvin Ching-Yuen Chen:
  Efficient Parallel Algorithms on Interval Graphs. 131-143
  

Architecture II

• T. Collette, Hassane Essafi, Didier Juvin, J. Kaiser:
  SYMPATIX: a SIMD computer performing the low and intermediate levels of image processing. 147-161
  
• Vladimir Getov:
  1-Dimensional Parallel FFT Benchmark on SUPRENUM. 163-174
  

Graph Theory and Performance

• Abdel Aziz Farrag, Robert Dawson, Qi Yao:
  On Designing Fault-Tolerant Extensions With Optimal Fanout For Complete Bipartite Networks. 177-191
  
• Xiaoxiong Zhong, Virginia Mary Lo:
  Application-Specific Deadlock Free Wormhole Routing on Multicomputers. 193-208
  

Invited Lectures

• Michel Dubois, Luiz André Barroso, Yung-Syau Chen, Koray Öner:
  Scalability Problems in Multiprocessors with Private Caches. 211-230
  
• Pierre Chavel, Jean Taboury:
  Promises and Issues in Optical Computing. 231-242
  

Parallel Software Components

• Jean Paul Bahsoun, Louis Féraud:
  A Model to Design Reusable Parallel Software Components. 245-260
  
• Laurent Thomas:
  Extensibility and Reuse of Object-Oriented Synchronization Components. 261-275
  

Data Base Optimization

• Myra Spiliopoulou, Michael Hatzopoulos, Costas Vassilakis:
  Using Parallelism and Pipeline for the Optimisation of Join Queries. 279-294
  
• Robert Marek, Erhard Rahm:
  Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems. 295-310
  

Data Parallelism

• Hua Bi:
  Explicit Expression of Multidimensional Data Parallelism. 313-328
  
• Jean-Marc Jézéquel, F. André Bergheul, F. André:
  Programming Massively Parallel Architectures with Sequential Object Oriented Languages. 329-344
  

Formal Methods

• Michael F. P. O'Boyle, G. A. Hedayat:
  A New Program Transformation to Minimise Communication in Distributed Memory Architecture. 347-362
  
• Martin Rudalics:
  Distributed Termination Enforcement. 363-378
  

Systolic Approach

• Fuyau Lin, Timothy K. Shih:
  Verification of Systolic Architecture Designs. 381-396
  
• Hervé Le Verge:
  Reduction Operators in ALPHA. 397-411
  

Functional Programming I

• Luc Moreau:
  An operational semantics for a parallel functional language with continuations. 415-430
  
• Christian Queinnec:
  A Concurrent and Distributed Extension of Scheme. 431-446
  

Fine Grain Parallelism

• Yves Robert, Siang W. Song:
  New Techniques for Cycle Shrinking. 449-464
  
• Guohua Jin, Fujie Chen:
  Loop Restructuring Techniques For Thrashing Problem. 465-480
  

Functional Programming II

• Eric T. Freeman, Daniel P. Friedman:
  Characterizing the Paralation Model using Dynamic Assignment. 483-496
  
• Stuart Cox, Shell-Ying Huang, Paul Kelly, Junxian Liu, Frank Taylor:
  An Implementation of Static Functional Process Networks. 497-512
  

Invited Lecture

• Alain J. Martin:
  Translating Concurrent Programs into VLSI Chips. 515-532
  

Prolog I

• Michael J. Wise:
  Message-Brokers and Communicating Prolog Processes. 535-549
  
• Costas Mourlas, Constantin Halatsis:
  Extensions to a Parallel Prolog System to Support Real-Time Applications. 551-565
  

Data Flow Systems

• Lubomir Bic, John M. A. Roy, Mark Nagel:
  Declarative Programming for Conventional MIMD Multiprocessors. 569-583
  
• Qi Ning, Guang R. Gao:
  Minimizing Loop Storage Allocation for An Argument-Fetching Dataflow Architecture Model. 585-600
  

Prolog II

• Khayri A. M. Ali, Roland Karlsson:
  Performance of Muse on the BBN Butterfly TC2000. 603-616
  
• Gopal Gupta, Vítor Santos Costa:
  And-Or Parallelism in Full Prolog with Paged Binding Arrays. 617-632
  

Network Efficiency

• José Duato:
  Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions. 635-650
  
• Gregory V. Wilson:
  Using Opportunistic Combining Networks to Reduce Contention in Multicomputers. 651-666
  

Architecture III

• Mohamed S. Baig, Tarek A. El-Ghazawi, Nikitas A. Alexandridis:
  Mixed-Mode Multicomputers with Load Adaptability. 669-683
  
• Yasuo Hidaka, Hanpei Koike, Hidehiko Tanaka:
  Architecture of Parallel Management Kernel for PIE64. 685-700
  

Parallel Algorithms

• Mohammad Reza Meybodi:
  Concurrent Data Structures for Hypercube Machine. 703-724
  
• Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
  Repeated Matrix Squaring for the Parallel Solution of Linear Systems. 725-732
  

Cache Systems

• Jean-Marc Kuntz:
  Performance Evaluation of Cache Memories in Tightly Coupled Multiprocessor Systems. 735-750
  
• Senthil Krishnamoorthy, Alok N. Choudhary:
  An Evaluation of Set-Associativity in Two-Level Caches for Shared Memory Multiprocessors. 751-766
  

Implementation of Parallel Languages

• eva Kühn, Franz Puntigam:
  Reliable Communication in VPL. 769-782
  
• Paul Anderson, David Bolton, Paul H. J. Kelly:
  Paragon Specifications: Structure, Analysis and Implementation. 783-798
  

Invited Lecture

• Anoop Gupta:
  Stanford DASH Multiprocessor: The Hardware and Software Approach. 801-805
  

Parallel Scheduling in Data Base Systems

• Paul W. P. J. Grefen, Peter M. G. Apers:
  Dynamic Action SCheduling in a Parallel Database System. 809-824
  
• Carla Chachaty, Pascale Borla-Salamet, Mike Ward:
  A Compositional Approach for the Design of a Parallel Query Processing Language. 825-840
  

Semantic Models

• Ferroudja Cherief:
  Back and Forth Bisimulations On Prime Event Structures. 843-858
  
• Jean Fanchon:
  Dynamic Concurrent Processes. 859-874
  

Parallel Data Base Machines

• Felipe Cariño, Pekka Kostamaa:
  Exegesis of DBC/1012 and P-90 - Industrial Supercomputer Database Machines. 877-892
  
• Simon H. Lavington, M. E. Waite, Jerome Robinson, Neil Dewhurst:
  Exploiting Parallelism in Primitive Operations on Bulk Data Types. 893-908
  

Language Semantics

• Koenraad De Bosschere, Jean-Marie Jacquet:
  Comparative Semantics of µLog. 911-926
  
• Gurdip Singh, Arthur J. Bernstein:
  A Framework for Parallel Composition of Protocols. 927-942
  

Posters

• Sergei Gorlatch:
  A Case Study: Parallel Program Development for a Recursive Numerical Algorithm. 945-946
  
• Frederick Knabe:
  A Distributed Protocol for Channel-Based Communication with Choice. 947-948
  
• Sylvie Damy, Guy-René Perrin:
  A Refinement of Communicating Processes. 949-950
  
• Paul Caspi, Alain Girault:
  Distributing Finite Transition Systems Extended Abstract. 950-951
  
• Riccardo Capobianchi, Rachid Guerraoui, Agnes Lanusse, Pierre Roux:
  Coping with the Process Proliferation Problem in Concurrent Object-Based Language Implementations. 953-954
  
• Joaquim Gabarró, Ricard Gavaldà:
  Correctness of flat data parallel algorithms: an axiomatic approach and examples. 955-956
  
• Zbigniew Chamski:
  Generating Memory-Efficient Imperative Data Structures from Systolic Programs. 957-958
  
• Jean-Paul Carrara, Jean-Luc Basille, Jean-François Larue, Didier Juvin:
  Geometric Transforms on Parallel Architecture. 959-960
  
• Péter Kacsuk:
  Implementing Cut in a Distributed Data Driven OR-Parallel Prolog Environment. 961-962
  
• N. de Beaucoudrey, A. Bellemain, D. Phalippou, P. Chavel, D. Fortin, Iaakov Exman, Larry Rudolph, J. P. Schnell, J. P. Pocholle:
  Optical Interconnects for Parallel Systems: Demonstration on an Optical Link with Multiple-Quantum-Well Opto-Electronic Arrays. 963-964
  
• Shan Fan Liu, Mary Lou Soffa:
  Parallel Task Assignment by Graph Partitioning. 965-966
  
• Antonius Klingler, Volker Penner:
  Parallelizing Recursive Logic Programs through Decomposition. 967-968
  
• Dominique Houzet, Jean-Luc Basille, Jean-Yves Latil:
  Performance Analysis of the Network of the GFLOPS Parallel Architecture. 969-970
  
• William E. Weihl, Eric A. Brewer, Adrian Colbrook, Chrysanthos Dellarocas, Wilson C. Hsieh, Anthony D. Joseph, Carl A. Waldspurger, Paul Wang:
  PRELUDE: A System for Portable Parallel Software. 971-973
  
• Nikitas J. Dimopoulos, M. Chowdhury, Radhakrishnan Sivakumar, Vassilios V. Dimakopoulos:
  Routing in Hypercycles. Deadlock Free and Backtracking Strategies. 973-974
  
• G. R. Justo, Peter H. Welch:
  Serialisation as a Paradigm for the Engineering of Parallel Programs. 975-976
  
• Jérôme Perret, Philippe Gautron:
  SIMCDL: Simulating Parallel Programming in a Sequential Environment. 977-978
  
• Günter Karjoth:
  XFSM: A Format Model of Communicating State Machines for Implementation Specification. 979-980
  
• Jonathan M. Nash, Peter M. Dew:
  XPRAM Model and Programming Interface. 981-982