Research Directions in High-Level Parallel Programming Languages
Editat de Jean Pierre Banatre, Daniel Le Métayeren Limba Engleză Paperback – 12 feb 1992
Preț: 327.27 lei
Preț vechi: 409.09 lei
-20%
Puncte Express: 491
Preț estimativ în valută:
57.87€ • 66.36$ • 50.02£
57.87€ • 66.36$ • 50.02£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540551607
ISBN-10: 3540551603
Pagini: 400
Ilustrații: VIII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540551603
Pagini: 400
Ilustrații: VIII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A perspective on parallel program design.- UNITY to UC: A case study in the derivation of parallel programs.- Reasoning about synchronic groups.- An industrial experience in the use of UNITY.- On the UNITY design decisions.- Flexible program structures for concurrent programming.- Current research on Linda.- Expressing fine-grained parallelism using concurrent data structures.- Persistent Linda: Linda + transactions + query processing.- Parallel logic programming using the Linda model of computation.- Lucinda — A polymorphic Linda.- A rationale for programming with Ease.- Intermediate uniformly distributed tuple space on transputer meshes.- Mixing concurrency abstractions and classes.- Coordination applications of Linda.- The chemical reaction model.- to Gamma.- Parallel programming with bags.- Implementation of Gamma on the connection machine.- Parallel programming with pure functional languages.- Parallel programming in maude.- Parallel program design.- The palindrome systolic arrayrevisited.- The synthesis of systolic programs.- Synthesizing delay insensitive circuits from verified programs.- A distributed implementation of a task pool.- Invariance and contraction by infinite iterations of relations.- Constructing a parallel sort program on hypercube by using Distributively Callable Procedures.