Tallenna
A Code Mapping Scheme for Dataflow Software Pipelining
Kirjailija:
nidottu, 2012
englanti
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.
- Kirjailija
- Guang R. Gao
- Painos
- Softcover reprint of the original 1st ed. 1991
- ISBN
- 9781461367826
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 21.11.2012
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 249
