Parallel and Distributed Computing: Theory and Practice
Theory and Practice. First Canada-France Conference, Montreal, Canada, May 19 - 21, 1994. Proceedings
Published on 2. May 1994
Book
Paperback/Softback
XI, 285 pages
978-3-540-58078-2 (ISBN)
Description
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.
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.
More details
Series
Edition
1994 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XI, 285 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
452 gr
ISBN-13
978-3-540-58078-2 (9783540580782)
DOI
10.1007/3-540-58078-6
Schweitzer Classification
Content
Juggling networks.- Optimal parallel verification of minimum spanning trees in logarithmic time.- The parallel complexity of algorithms for pattern formation models.- On the parallel complexity of iterated multiplication in rings of algebraic integers.- NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs.- Concurrency in an O (log log N) priority queue.- Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract.- Embedding 3-dimensional grids into optimal hypercubes.- Distributed cyclic reference counting.- Efficient reconstruction of the causal relationship in distributed systems.- Scalable parallel computational geometry.- Sorting and selection on arrays with diagonal connections.- Work-Optimal thinning algorithm on SIMD machines.- An efficient implementation of parallel A*.- Constant-time convexity problems on reconfigurable meshes.- Deepness analysis: Bringing optimal fronts to triangular finite element method.- Communications in busnetworks.- Fault-tolerant linear broadcasting.- The minimum broadcast time problem.- The complexity of systolic dissemination of information in interconnection networks.- Representations of gossip schemes.- On the multiply-twisted hypercube.