Read While You Wait - Get immediate ebook access, if available*, when you order a print book

The Springer International Series in Engineering and Computer Science

A Code Mapping Scheme for Dataflow Software Pipelining

Authors: Guang R. Gao

Free Preview

Buy this book

eBook $109.00
price for USA in USD (gross)
  • ISBN 978-1-4615-3988-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.99
price for USA in USD
  • ISBN 978-0-7923-9130-2
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $139.99
price for USA in USD
  • ISBN 978-1-4613-6782-6
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (13 chapters)

Table of contents (13 chapters)

Buy this book

eBook $109.00
price for USA in USD (gross)
  • ISBN 978-1-4615-3988-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.99
price for USA in USD
  • ISBN 978-0-7923-9130-2
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $139.99
price for USA in USD
  • ISBN 978-1-4613-6782-6
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
A Code Mapping Scheme for Dataflow Software Pipelining
Authors
Series Title
The Springer International Series in Engineering and Computer Science
Series Volume
125
Copyright
1991
Publisher
Springer US
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4615-3988-9
DOI
10.1007/978-1-4615-3988-9
Hardcover ISBN
978-0-7923-9130-2
Softcover ISBN
978-1-4613-6782-6
Series ISSN
0893-3405
Edition Number
1
Number of Pages
XXI, 249
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.