Skip to main content
SpringerLink
Log in

Synthesizing Synchronous Systems by Static Scheduling in Space-Time

  • Book
  • © 1989

Overview

Editors:
  1. Björn Lisper
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 362)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-10

  3. Preliminaries

    Pages 11-18

  4. Output specification

    Pages 19-21

  5. Formal expressions as schemes for evaluation

    Pages 22-24

  6. Computational events and computation networks

    Pages 25-30

  7. Compound events of computation

    Pages 31-46

  8. A hardware model

    Pages 47-66

  9. Schedules and performance criteria

    Pages 67-92

  10. Index vectors and complexity

    Pages 93-105

  11. Data dependent scheduling

    Pages 106-119

  12. Applications

    Pages 120-172

  13. Conclusions

    Pages 173-176

  14. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation