Parallel and Distributed Computing Theory and Practice: First Canada-France Conference Montréal, Canada, May 19–21, 1994 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors.
This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.

Author(s): Nicholas Pippenger (auth.), Michel Cosnard, Afonso Ferreira, Joseph Peters (eds.)
Series: Lecture Notes in Computer Science 805
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994

Language: English
Pages: 285
Tags: Operating Systems; Computer Communication Networks; Computation by Abstract Devices; Numerical Analysis; Computer Graphics

Juggling networks....Pages 1-12
Optimal parallel verification of minimum spanning trees in logarithmic time....Pages 13-22
The parallel complexity of algorithms for pattern formation models....Pages 23-34
On the parallel complexity of iterated multiplication in rings of algebraic integers....Pages 35-44
NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs....Pages 45-57
Concurrency in an O (log log N ) priority queue....Pages 59-71
Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract....Pages 73-80
Embedding 3-dimensional grids into optimal hypercubes....Pages 81-94
Distributed cyclic reference counting....Pages 95-100
Efficient reconstruction of the causal relationship in distributed systems....Pages 101-113
Scalable parallel computational geometry....Pages 115-119
Sorting and selection on arrays with diagonal connections....Pages 121-136
Work-Optimal thinning algorithm on SIMD machines....Pages 137-152
An efficient implementation of parallel A * ....Pages 153-168
Constant-time convexity problems on reconfigurable meshes....Pages 169-180
Deepness analysis: Bringing optimal fronts to triangular finite element method....Pages 181-196
Communications in bus networks....Pages 197-206
Fault-tolerant linear broadcasting....Pages 207-217
The minimum broadcast time problem....Pages 219-234
The complexity of systolic dissemination of information in interconnection networks....Pages 235-249
Representations of gossip schemes....Pages 251-265
On the multiply-twisted hypercube....Pages 267-278