000 03758nam a2200505 i 4500
001 6267295
003 IEEE
005 20190220121645.0
006 m o d
007 cr |n|||||||||
008 151229s1989 maua ob 001 eng d
010 _z 88008390 (print)
020 _a9780262256520
_qelectronic
020 _z9780262610575
_qprint
020 _z0262610574
_qprint
035 _a(CaBNVSL)mat06267295
035 _a(IDAMS)0b000064818b429d
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aQA76.6
_b.K449 1989eb
082 0 0 _a004/.35
_219
100 1 _aKelly, Paul
_q(Paul H. J.)
_eauthor.
245 1 0 _aFunctional programming for loosely-coupled multiprocessors /
_cPaul Kelly.
264 1 _aCambridge, Massachusetts :
_bMIT Press,
_c1989.
264 2 _a[Piscataqay, New Jersey] :
_bIEEE Xplore,
_c[1989]
300 _a1 PDF (253 pages) :
_billustrations.
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
490 1 _aResearch monographs in parallel and distributed computing
500 _aIncludes index.
504 _aIncludes bibliographical references (p. 225-238).
506 1 _aRestricted to subscribers or individual electronic text purchasers.
520 _aRecent progress in VLSI provides massive parallelism but general purpose parallel computers remain elusive due to limited communications performance. This book proposes a new high level approach to programming that addresses the pragmatic issue of how a computation is distributed across a machine.The book's approach is based on functional programming and has significant advantages over existing comparable approaches, extending the domain of functional programming to include computer architectures in which communication costs are not negligible. It looks at how high-level functional programming languages can be used to specify, reason about, and implement parallel programs for a variety of multiprocessor systems, but in particular a class of loosely coupled multiprocessors whose operation can be described by a process network In these networks the nodes correspond to processes and the arcs to communications channels.A simple language called Caliban is described in which the functional program text is augmented with a declarative description of how processes are partitioned and mapped onto a network of processing elements. The notation gains expressive power by allowing these annotations to be generated by predicates defined in the functional language. Thus, common communications structures have simple and concise definitions as "network forming operators." The main objective of these annotations is to provide an abstract description of the process network specified by the program so that an efficient mapping of processes to processors can be carried out by the compiler.Paul H. J. Kelly is Research Assistant in the Department of Computing at Imperial College, London Functional Programming for LooselyCoupled Multiprocessors is included in the series Research Monographs in Parallel and Distributed Computing, copublished with Pitman Publishing.
530 _aAlso available in print.
538 _aMode of access: World Wide Web
588 _aDescription based on PDF viewed 12/29/2015.
650 0 _aFunctional programming (Computer science)
650 0 _aMultiprocessors.
655 0 _aElectronic books.
710 2 _aIEEE Xplore (Online Service),
_edistributor.
710 2 _aMIT Press,
_epublisher.
776 0 8 _iPrint version:
_z9780262610575
830 0 _aResearch monographs in parallel and distributed computing
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267295
999 _c39210
_d39210