Code Mapping Scheme for Dataflow Software Pipelining

Name: Code Mapping Scheme for Dataflow Software Pipelining
Brand: Springer
SKU: 9780792391302
Price: 584.36 RON
Availability: InStock

Autor: Guang R. Gao

Limbă:

Legare: Copertă tare

Editura: Springer

Disponibilitate: În depozitul extern în cantități mici

Expediem în 13-18 zile

584.36 lei

This monograph evolved from my Ph. D dissertation completed at the Laboratory of Computer Science, M...

Informații despre carte

Autor

Guang R. Gao

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

1990

Pagini

249

EAN

9780792391302

ISBN

0792391306

Enbook ID

01398048

Editura

Springer

Greutate

1250

Dimensiuni

155 x 235 x 19

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Code Mapping Scheme for Dataflow Software Pipelining

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și