Synthesizing Synchronous Systems by Static Scheduling in Space-Time (Record no. 35015)

000 -LEADER
fixed length control field 03247nam a22005295i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540461722
-- 978-3-540-46172-2
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 621.381
245 10 - TITLE STATEMENT
Title Synthesizing Synchronous Systems by Static Scheduling in Space-Time
Statement of responsibility, etc edited by Björn Lisper.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1989.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 266 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Preliminaries -- Output specification -- Formal expressions as schemes for evaluation -- Computational events and computation networks -- Compound events of computation -- A hardware model -- Schedules and performance criteria -- Index vectors and complexity -- Data dependent scheduling -- Applications -- Conclusions.
520 ## - SUMMARY, ETC.
Summary, etc The subject of this book is the synthesis of synchronous hardware. The purpose is to provide a firm mathematical foundation for the so-called space-time mapping methods for hardware synthesis that have been proposed during the last few years. Thus the treatment is fairly mathematical. In a space-time mapping method, an algorithm is described as a set of atomic events, with possible data dependencies between them. The task is to find a mapping, assigning a space-time coordinate to each event, so that causality is not violated and the solution is "good". Previous work in the area, if it provided any formalism at all, has relied mainly on uniform recurrence equations, extensions thereof, or on purely graph-theoretic formulations. In this project algebra is used instead and the close connection with single-assignment languages is stressed. Thus it is possible to generalize previous work and to give simple characterizations of the type of algorithms that can be implemented with space-time mappings. The results presented can be applied to hardware construction and compiler techniques for parallel computers.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Communication Networks.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Electronics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Engineering.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Electronics and Microelectronics, Instrumentation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Lisper, Björn.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-51156-3
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1989.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5721 http://dx.doi.org/10.1007/3-540-51156-3 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha