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