Fully static processor-optimal assignment of data-flow graphs
| Autor: | Yeh-Chin Ho, Jong-Chuang Tsay |
|---|---|
| Rok vydání: | 1997 |
| Předmět: |
Linear programming
business.industry Computer science Applied Mathematics Multiprocessing Graph theory Parallel computing Graph Data flow diagram Computer Science::Hardware Architecture Control flow analysis Signal Processing Electrical and Electronic Engineering business Computer Science::Operating Systems Integer programming Digital signal processing |
| Zdroj: | IEEE Signal Processing Letters. 4:146-148 |
| ISSN: | 1558-2361 1070-9908 |
| DOI: | 10.1109/97.575560 |
| Popis: | The data-flow graph (DFG) is an important graph-theoretic model for multiprocessor implementation of real-time digital signal processing (DSP) algorithms. Given a time schedule for a DFG, we consider the problem of the processor-optimal assignment for a fully static schedule. Previously, the solution of this problem was found by solving an integer programming problem. We propose a linear programming approach to solving the problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|