---

＜電子ブック＞
Synthesizing Synchronous Systems by Static Scheduling in Space-Time / by Björn Lisper
(Lecture Notes in Computer Science. ISSN:16113349 ; 362)

版	1st ed. 1989.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1989
本文言語	英語
大きさ	X, 266 p : online resource
著者標目	*Lisper, Björn author SpringerLink (Online service)
件　名	LCSH:Electronics LCSH:Computer networks  LCSH:Computer science FREE:Electronics and Microelectronics, Instrumentation FREE:Computer Communication Networks FREE:Theory of Computation
一般注記	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 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 HTTP:URL=https://doi.org/10.1007/3-540-51156-3

 類似資料