Functional programming for loosely-coupled multiprocessors / (Record no. 72952)

000 -LEADER
fixed length control field 03826nam a2200517 i 4500
001 - CONTROL NUMBER
control field 6267295
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204622.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151229s1989 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262256520
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
082 00 - CLASSIFICATION NUMBER
Call Number 004/.35
100 1# - AUTHOR NAME
Author Kelly, Paul
245 10 - TITLE STATEMENT
Title Functional programming for loosely-coupled multiprocessors /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (253 pages) :
490 1# - SERIES STATEMENT
Series statement Research monographs in parallel and distributed computing
500 ## - GENERAL NOTE
Remark 1 Includes index.
520 ## - SUMMARY, ETC.
Summary, etc Recent 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.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267295
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- 1989.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [1989]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/29/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Functional programming (Computer science)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Multiprocessors.

No items available.