|
 |
| |
| |
An Upper Bound of the Throughput of Multirate Multiprocessor Schedules
Schoenen, Rainer
Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University Kontakt: Rainer Schoenen
In IEEE ICASSP, p. 6, ICASSP, 1997.
Publication Date: Apr, 1997
On page(s):6
ISBN:
|
 |
|
Multirate Dataflow Graphs
are used for modelling iterative
computations, allowing concurrency and arbitrary data rates at ports.
This model is often used for signal processing algorithms.
For static scheduling the iteration period bound
represents the final barrier for the computation speed,
the approximation of which
is often the goal of an implementation.
For the singlerate case (SR-DFG), where all rates are one, an explicit bound
exists and is subject of many published papers.
This work presents a bound for the multirate case,
which reduces to the known bound
if applied to an SR-DFG.
Assumptions made are a vectorized execution
and a blocked schedule that organizes multiple iterations inside one
period (also called execution cycle).
The influence of characteristic properties in the multirate case
is emphasized.
|
|
|
|
|
|
|
An Upper Bound of the Throughput of Multirate Multiprocessor Schedules  149 KB or here |
|
@INPROCEEDINGS{Schoenen97icassp,
AUTHOR = {Schoenen, R.},
TITLE = {An Upper Bound of the Throughput of Multirate Multiprocessor Schedules},
YEAR = {1997},
MONTH = {Apr},
PAGES = {6},
ADDRESS = {ICASSP},
BOOKTITLE = {IEEE ICASSP},
AFFILIATION = {Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University},
URL = {http://www.comnets.rwth-aachen.de}
}
|
|
|
| | Letzte Änderung: 8.05.2008 12.16 | |
