Parallel Algorithms and Architectures

International Workshop Suhl, GDR, May 25-30, 1987; Proceedings
Herausgegeben:Albrecht, Andreas; Jung, Hermann; Mehlhorn, Kurt

• Broschiertes Buch

Produktbeschreibung

Contents: Invited Papers: H. Alt, T. Hagerup, K. Mehlhorn, F.P. Preparata: Deterministic simulation of idealized parallel computers on more realistic ones.- R. Dwyer, R. Kannan: Convex hull of randomly chosen points from a polytope.- J. Herath, T. Yuba, N. Saito: Dataflow computing.- E. Koerner, I. Tsuda, H. Shimizu: Parallel in sequence - Towards the architecture of an elementary cortical processor.- N.N. Mirenkov: Parallel algorithms and static analysis of parallel programs.- B. Monien, O. Vornberger: Parallel processing of combinatorial search.- Communications: A. Apostolico, C.S. Iliopoulos, R. Paige: An O(nlogn) cost parallel algorithms for the single function coarsest partition problem.- T. Asano, H. Umeo: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region.- L. Budach, E.G. Giessmann, H. Grassmann, B. Graw, C. Meinel: RELACS - A recursive layout computing system.- R. Creutzburg: Parallel linear conflict-free subtree access.- D. De Baer, J. Paredaens: A formal definition for systolic systems.- K. Diks: Parallel recognition of outerplanar graphs.- D. Ferment, B. Rozoy: Solutions for the distributed termination problem.- M. Gössel, B. Rebel: Memories for parallel subtree-access.- S. Matsui, Y. Kato, S. Teramura, T. Tanaka, N. Mohri, A. Maeda, M. Nakanishi: SYNAPSE: A multi-microprocessor Lisp machine with parallel garbage collector.- W. Rytter: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata.- W. Rytter, R. Giancarlo: Optimal parallel parsing of bracket languages.- D. Uhlig: On reliable networks from unreliable gates.- I. Vrto: Area-time tradeoffs for selection.- F. Wächter: Optimization of special permutation networks using simple algebraic relations.- Invited Papers: C.D. Thomborson, L.L. Deneen, G.M. Shute: Computing a rectilinear Steiner minimal tree in n0(n) time.- C.K. Yap: What can be parallelized in computational geometry?.- Communication: A. Konagaya, R. Nakazaki, M. Umemura: A co-operative programming environment for a back-end type sequential inference machine CHI.

Produktdetails

• Lecture Notes in Computer Science 269
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-18099-9
• 1987.
• Seitenzahl: 212
• Erscheinungstermin: 9. Dezember 1987
• Englisch
• Abmessung: 235mm x 155mm x 12mm
• Gewicht: 304g
• ISBN-13: 9783540180999
• ISBN-10: 3540180990
• Artikelnr.: 23113833

Autorenporträt

Andreas Albrecht wurde 1951 in Cottbus geboren. Er absolvierte eine Ausbildung zum Rinderzüchter und studierte Physik. Er veröffentlichte Prosa, Lyrik und Hörspiele. Der Autor lebt seit 1996 in München. 1997 erhielt er das Münchner Literaturstipendium und war Burgschreiber in Beeskow.

Inhaltsangabe

Deterministic simulation of idealized parallel computers on more realistic ones.- Convex hull of randomly chosen points from a polytope.- Dataflow computing.- Parallel in sequence - Towards the architecture of an elementary cortical processor.- Parallel algorithms and static analysis of parallel programs.- Parallel processing of combinatorial search trees.- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem.- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region.- RELACS - A recursive layout computing system.- Parallel linear conflict-tree subtree access.- A formal definition for systolic systems.- Parallel recognition of outerplanar graphs.- Solutions for the distributed termination problem.- Memories for parallel subtree-access.- Synapse: A multi-microprocessor lisp machine with parallel garbage collector.- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata.- Optimal parallel parsing of bracket languages.- On reliable networks from unreliable gates.- Area-time tradeoffs for selection.- Optimization of special permutation networks using simple algebraic relations.- Computing a rectilinear steiner minimal tree in $$n^{O(sqrt n )}$$ time.- What can be parallelized in computational geometry?.- A co-operative programming environment for a back-end type sequential inference machine CHI.