0
Your cart

Your cart is empty

Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design

Buy Now

A Code Mapping Scheme for Dataflow Software Pipelining (Paperback, Softcover reprint of the original 1st ed. 1991) Loot Price: R2,951
Discovery Miles 29 510
A Code Mapping Scheme for Dataflow Software Pipelining (Paperback, Softcover reprint of the original 1st ed. 1991): Guang R. Gao

A Code Mapping Scheme for Dataflow Software Pipelining (Paperback, Softcover reprint of the original 1st ed. 1991)

Guang R. Gao

Series: The Springer International Series in Engineering and Computer Science, 125

 (sign in to rate)
Loot Price R2,951 Discovery Miles 29 510 | Repayment Terms: R277 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: The Springer International Series in Engineering and Computer Science, 125
Release date: November 2012
First published: 1991
Authors: Guang R. Gao
Dimensions: 235 x 155 x 15mm (L x W x T)
Format: Paperback
Pages: 249
Edition: Softcover reprint of the original 1st ed. 1991
ISBN-13: 978-1-4613-6782-6
Categories: Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General
LSN: 1-4613-6782-4
Barcode: 9781461367826

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners