Cantitate/Preț
Produs

Synthesizing Synchronous Systems by Static Scheduling in Space-Time: Lecture Notes in Computer Science, cartea 362

Autor Björn Lisper
en Limba Engleză Paperback – 10 mai 1989
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 36670 lei

Nou

Puncte Express: 550

Preț estimativ în valută:
7022 7595$ 5851£

Carte tipărită la comandă

Livrare economică 11-25 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540511564
ISBN-10: 3540511563
Pagini: 276
Ilustrații: X, 266 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.