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

Guang R. Gao

ISBN 10: 0792391306 / ISBN 13: 9780792391302

Published by Springer, 1990

About this Item

Seller Inventory # I-9780792391302

Bibliographic Details

• Title: A Code Mapping Scheme for Dataflow Software Pipelining (The Springer International Series in Engineering and Computer Science, 125)
• Publisher: Springer
• Publication Date: 1990
• Language: English
• ISBN 10: 0792391306
• ISBN 13: 9780792391302
• Binding: Hardcover
• Condition: New

About this title

Synopsis

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.