3. PARLE 1991: Eindhoven, The Netherlands - Volume 1

Invited Lectures

• Thomas Johnsson:
  Parallel Evaluation of Functional Programs: The (v, G)-Machine Approach. 1-5
  
• Pilar de la Torre, Clyde P. Kruskal:
  Towards a Single Model of Efficient Computation in Real Parallel Machines. 6-24
  
• Philip C. Treleaven:
  Neural Computing and the GALATEA Project. 25-33
  

Submitted Presentations

• Herbert H. J. Hum, Guang R. Gao:
  A Novel High-Speed Memory Organization for Fine-Grain Multi-Thread Computing. 34-51
  
• Koen Langendoen, Henk L. Muller, Louis O. Hertzberger:
  Evaluation of Futurebus Hierarchical Caching. 52-68
  
• Jean Marie Filloque, Eric Gautrin, Bernard Pottier:
  Efficient Global Computations on a Processor Network with Programmable Logic. 69-82
  
• Philippe Hoogvorst, Ronan Keryell, Philippe Matherat, Nicolas Paris:
  POMP or How to Design a Massively Parallel Machine with Small Developments. 83-100
  
• Jonas Vasell, Jesper Vasell:
  The Function Processor: An Architecture for Efficient Execution of Recursive Functions. 101-118
  
• R. Milikowski, Willem G. Vree:
  The G-Line: A Distributed Processor for Graph Reduction. 119-136
  
• Gerard Tel, Friedemann Mattern:
  The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes. 137-149
  
• José M. Piquer:
  Indirect Reference Counting: A Distributed Garbage Collection Algorithm. 150-165
  
• Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
  Periodic Multiprocessor Scheduling. 166-178
  
• Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
  Embeddings of Shuffle-Like Graphs in Hyphercubes. 179-190
  
• Vincent Van Dongen:
  Mapping Uniform Recurrences onto Small Size Arrays. 191-208
  
• P. Ferianc, Ondrej Sýkora:
  Area Complexity of Multilective Merging. 209-218
  
• Xiaoxiong Zhong, Sanjay V. Rajopadhye:
  Deriving Fully Efficient Systolic Arrays by Quasi-Linear Allocation Functions. 219-236
  
• Catherine Mongenet:
  Affine Timings for Systems of Affine Recurrence Equations. 236-251
  
• Ian Parberry:
  On the Computational Complexity of Optimal Sorting Network Verification. 252-269
  
• Sajal K. Das, Wen-Bing Horng:
  Managing a Parallel Heap Efficiently. 270-287
  
• Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha:
  Parallel Complexity in the Design and Analysis on Conurrent Systems. 288-303
  
• Torben Hagerup, Arno Schmitt, Helmut Seidl:
  FORK: A High-Level Language for PRAMs. 304-320
  
• Ali R. Hurson, Bo Jin, Simin H. Pakzad:
  Neurl Network-Based Decision Making for Large Incomplete Database. 321-337
  
• Ahmed Louri:
  An Optical Content-Adressable Parallel Processor for Fast Searching and Retrieving. 338-354
  
• Guang R. Gao, Herbert H. J. Hum, Jean-Marc Monti:
  Towards an Efficient Hybrid Dataflow Architecture Model. 355-371
  
• R. Govindarajan, Sheng Yu:
  Data Flow Implementation of Generalized Guarded Commands. 372-389
  
• José Duato:
  On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies. 390-405
  
• Hermann Ilmberger, Sabine Thürmel:
  A Toolkit for Debugging Parallel Lisp Programs. 406-422