000 04184nam a22005295i 4500
001 978-3-540-46762-5
003 DE-He213
005 20160624102018.0
007 cr nn 008mamaa
008 100729s1992 gw | s |||| 0|eng d
020 _a9783540467625
_9978-3-540-46762-5
024 7 _a10.1007/3-540-55160-3
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
245 1 0 _aReasearch Directions in High-Level Parallel Programming Languages
_h[electronic resource] :
_bMont Saint-Michel, France, June 17–19, 1991 Proceedings /
_cedited by Jean Pierre Banâtre, Daniel Métayer.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
300 _aVIII, 392 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v574
505 0 _aA 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 array revisited -- 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.
520 _aThis volume contains most of the papers presented at the workshop on research directions in high-level parallel programming languages, held at Mont Saint-Michel, France, in June 1991. The motivation for organizing this workshop came from the emergence of a new class of formalisms for describing parallel computations in the last few years. Linda, Unity, Gamma, and the Cham are the most significant representatives of this new class. Formalisms of this family promote simple but powerful language features for describing data and programs. These proposals appeared in different contexts and were applied in different domains, and the goal of the workshop was to review the status of this new field and compare experiences. The workshop was organized into four main sessions: Unity, Linda, Gamma, and Parallel Program Design. The corresponding parts ofthe volume are introduced respectively by J. Misra, D. Gelernter, D. Le M tayer, and J.-P. Ban tre.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
700 1 _aBanâtre, Jean Pierre.
_eeditor.
700 1 _aMétayer, Daniel.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540551607
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v574
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-55160-3
942 _2EBK5889
_cEBK
999 _c35183
_d35183