A Code Mapping Scheme for Dataflow Software Pipelining - Guang R Gao
-25% ar kodu BOOKS
Piegāde 22-28 darba dienu laikā
30 dienu atgriešanas politika
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-resu ... Pilns apraksts
Jums varētu patikt arī
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altmans OpenAI
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Slanted 47 Digital Tools: Slanted Magazine
-25% ar kodu BOOKS
Nav noliktavā
TOP
The Art of Game Design: A Book of Lenses
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Automate the Boring Stuff with Python
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-25% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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.
Vairāk informācijas
| Autors | Guang R Gao |
|---|---|
| Izdevējs | Springer US |
| Series | The Springer International Series in Engineering and Computer Science |
| Izlaides gads | 1990 |
| Vāka tips | Cietais vāks |
| EAN | 9780792391302 |