A Code Mapping Scheme for Dataflow Software Pipelining - The Springer International Series in Engineering and Computer Science 125 (Paperback)
  • A Code Mapping Scheme for Dataflow Software Pipelining - The Springer International Series in Engineering and Computer Science 125 (Paperback)
zoom

A Code Mapping Scheme for Dataflow Software Pipelining - The Springer International Series in Engineering and Computer Science 125 (Paperback)

(author)
£99.99
Paperback 249 Pages / Published: 21/11/2012
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
This monograph evolved from my Ph. D dissertation completed at the Laboratory of Computer Science, MIT, during the Summer of 1986. In my dissertation I proposed a pipelined code mapping scheme for array operations on static dataflow architectures. The main addition to this work is found in Chapter 12, reflecting new research results developed during the last three years since I joined McGill University-results based upon the principles in my dissertation. The terminology dataflow soft- ware pipelining has been consistently used since publication of our 1988 paper on the argument-fetching dataflow architecture model at McGill University [43]. In the first part of this book we describe the static data flow graph model as an operational model for concurrent computation. We look at timing considerations for program graph execution on an ideal static dataflow computer, examine the notion of pipe lining, and characterize its performance. We discuss balancing techniques used to transform certain graphs into fully pipelined data flow graphs. In particular, we show how optimal balancing of an acyclic data flow graph can be formulated as a linear programming problem for which an optimal solution exists. As a major result, we show the optimal balancing problem of acyclic data flow graphs is reduceable to a class of linear programming problem, the net- work flow problem, for which well-known efficient algorithms exist. This result disproves the conjecture that such problems are computationally hard.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461367826
Number of pages: 249
Weight: 427 g
Dimensions: 235 x 155 x 15 mm
Edition: Softcover reprint of the original 1st ed. 199

You may also be interested in...

Beyond Software Architecture
Added to basket
Computer Systems Architecture
Added to basket
Articulating Design Decisions
Added to basket
Principles of Computer Hardware
Added to basket
Logic in Computer Science
Added to basket
The ZX Spectrum ULA
Added to basket
Digital Design: International Editions
Added to basket
Computer Systems
Added to basket
Enterprise Data Architecture
Added to basket

Please sign in to write a review

Your review has been submitted successfully.