Parle ’91 Parallel Architectures and Languages Europe

1. Front Matter

   Pages I-XXVIII

   PDF

2. Invited Lectures

   1. Parallel Evaluation of Functional Programs: The 〈v, G〉-machine approach (Summary)

      • Thomas Johnsson

      Pages 1-5

   2. Towards a Single Model of Efficient Computation in Real Parallel Machines

      • Pilar de la Torre, Clyde P. Kruskal

      Pages 6-24

   3. Neural Computing and the GALATEA Project

      • Philip Treleaven

      Pages 25-33

3. Submitted Presentations

   1. A Novel High-Speed Memory Organization for Fine-Grain Multi-Thread Computing

      • Herbert H. J. Hum, Guang R. Gao

      Pages 34-51

   2. Evaluation of Futurebus hierarchical caching

      • K. G. Langendoen, H. L. Muller, L. O. Hertzberger

      Pages 52-68

   3. Efficient Global Computations on a Processor Network with Programmable Logic

      • Jean Marie Filloque, Eric Gautrin, Bernard Pottier

      Pages 69-82

   4. POMP or How to design a massively parallel machine with small developments

      • Philippe Hoogvorst, Ronan Keryell, Philippe Matherat, Nicolas Paris

      Pages 83-100

   5. The Function Processor: An Architecture for Efficient Execution of Recursive Functions

      • Jonas Vasell, Jesper Vasell

      Pages 101-118

   6. The G-Line a Distributed Processor for Graph Reduction

      • R. Milikowski, W. G. Vree

      Pages 119-136

   7. The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract)

      • Gerard Tel, Friedemann Mattern

      Pages 137-149

   8. Indirect Reference Counting: A Distributed Garbage Collection Algorithm

      • José M. Piquer

      Pages 150-165

   9. Periodic Multiprocessor Scheduling

      • Jan Korst, Emile Aarts, Jan Karel Lenstra, Jaap Wessels

      Pages 166-178

   10. Embeddings of shuffle-like graphs in hypercubes

       • M. Baumslag, M. C. Heydemann, J. Opatrny, D. Sotteau

       Pages 179-190

   11. Mapping Uniform Recurrences onto Small Size Arrays

       • Vincent Van Dongen

       Pages 191-208

   12. Area Complexity of Multilective Merging

       • Pavel Ferianc, Ondrej Sýkora

       Pages 209-218

   13. Deriving Fully Efficient Systolic Arrays by Quasi-Linear Allocation Functions

       • Xiaoxiong Zhong, Sanjay Rajopadhye

       Pages 219-235

   14. Affine Timings for Systems of Affine Recurrence Equations

       • C. Mongenet

       Pages 236-251

   15. On the Computational Complexity of Optimal Sorting Network Verification

       • Ian Parberry

       Pages 252-269

   16. Managing a Parallel Heap Efficiently

       • Sajal K. Das, Wen-Bing Horng

       Pages 270-287

The innovative progress in the development oflarge-and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual "Parallel Architectures and Languages Europe" (PARLE) conferences aim at presenting current research material on all aspects of the theory, design, and application of parallel computing systems and parallel processing. At the same time, the goal of the PARLE conferences is to provide a forum for researchers and practitioners to ex­ change ideas on recent developments and trends in the field of parallel com­ puting and parallel programming. The first ~wo conferences, PARLE '87 and PARLE '89, have succeeded in meeting this goal and made PARLE a conference that is recognized worldwide in the field of parallel computation. PARLE '91 again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algo­ rithms and complexity, in addition to the central themes of parallel archi­ tectures and languages. The proceedings of the PARLE '91 conference contain the text of all con­ tributed papers that were selected for the programme and of the invited papers by leading experts in the field.

• Kernel
• Maß
• Trend
• algorithms
• calculus
• complexity
• databases
• logic
• neural networks
• parallel computing
• processor
• programming
• programming language
• scheduling

• Philips Research Laboratories, Eindhoven, The Netherlands

  Emile H. L. Aarts

• Department of Computer Science, University of Utrecht, Utrecht, The Netherlands

  Jan Leeuwen

• Eindhoven University of Technology, Eindhoven, The Netherlands

  Martin Rem

Policies and ethics