Recently Viewed

New

A Code Mapping Scheme for Dataflow Software Pipelining by Guang R. Gao 9780792391302

No reviews yet Write a Review
RRP: £89.99
Booksplease Price: £89.84
Booksplease saves you 0%

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9780792391302
MPN:
9780792391302
Available from Booksplease!
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Availability: Usually dispatched within 4 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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.

Book Information
ISBN 9780792391302
Author Guang R. Gao
Format Hardback
Page Count 249
Imprint Springer
Publisher Springer
Weight(grams) 1250g

Reviews

No reviews yet Write a Review

Booksplease  Reviews