Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility

A.L. Oláh; S.H. Gerez; S.M. Heemstra de Groot

doi:10.1109/CMPEUR.1992.218519

Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility

A.L. Oláh
, S.H. Gerez
, S.M. Heemstra de Groot

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

21 Downloads (Pure)

Abstract

A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.

Original language	English
Title of host publication	The 1992 International Conference on Computer Systems and Software Engineering CompEuro 92
Place of Publication	Piscataway, NJ
Publisher	IEEE
Pages	145-150
Number of pages	6
ISBN (Print)	0-8186-2760-3
DOIs	https://doi.org/10.1109/CMPEUR.1992.218519
Publication status	Published - 2 May 1992
Event	International Conference on Computer Systems and Software Engineering, CompEuro 1992 - The Hague, Netherlands Duration: 4 May 1992 → 8 May 1992

Conference

Conference	International Conference on Computer Systems and Software Engineering, CompEuro 1992
Abbreviated title	CompEuro 1992
Country/Territory	Netherlands
City	The Hague
Period	4/05/92 → 8/05/92

Access to Document

10.1109/CMPEUR.1992.218519

ArticleFinal published version, 451 KB

Cite this

@inproceedings{5ec1611a0e614d979dead82c6c09213b,

title = "Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility",

abstract = "A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.",

author = "A.L. Ol{\'a}h and S.H. Gerez and \{Heemstra de Groot\}, S.M.",

year = "1992",

month = may,

day = "2",

doi = "10.1109/CMPEUR.1992.218519",

language = "English",

isbn = "0-8186-2760-3",

pages = "145--150",

booktitle = "The 1992 International Conference on Computer Systems and Software Engineering CompEuro 92",

publisher = "IEEE",

address = "United States",

note = "International Conference on Computer Systems and Software Engineering, CompEuro 1992, CompEuro 1992 ; Conference date: 04-05-1992 Through 08-05-1992",

}

Oláh, AL, Gerez, SH & Heemstra de Groot, SM 1992, Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility. in The 1992 International Conference on Computer Systems and Software Engineering CompEuro 92. IEEE, Piscataway, NJ, pp. 145-150, International Conference on Computer Systems and Software Engineering, CompEuro 1992, The Hague, Netherlands, 4/05/92. https://doi.org/10.1109/CMPEUR.1992.218519

Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility. / Oláh, A.L.; Gerez, S.H.; Heemstra de Groot, S.M.
The 1992 International Conference on Computer Systems and Software Engineering CompEuro 92. Piscataway, NJ: IEEE, 1992. p. 145-150.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility

AU - Oláh, A.L.

AU - Gerez, S.H.

AU - Heemstra de Groot, S.M.

PY - 1992/5/2

Y1 - 1992/5/2

N2 - A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.

AB - A scheduling and allocation method is given for the high-level synthesis of DSP algorithms described by iterative data flow graphs. The method is based on the concept of scheduling ranges. It generates overlapped schedules, while performing retiming and loop folding implicitly. The scheduler operates on the input and output data transfers of the operations in the graph, allowing a trade-off of functional units against buses. For each transfer a scheduling range is computed and the optimal position within this range is found by modified force-directed scheduling. The method has obtained optimal results for well-known benchmark examples.

U2 - 10.1109/CMPEUR.1992.218519

DO - 10.1109/CMPEUR.1992.218519

M3 - Conference contribution

SN - 0-8186-2760-3

SP - 145

EP - 150

BT - The 1992 International Conference on Computer Systems and Software Engineering CompEuro 92

PB - IEEE

CY - Piscataway, NJ

T2 - International Conference on Computer Systems and Software Engineering, CompEuro 1992

Y2 - 4 May 1992 through 8 May 1992

ER -

Scheduling and Allocation for the High-level Synthesis of DSP Algorithms by Exploitation of Data Transfer Mobility

Abstract

Conference

Access to Document

Fingerprint

Cite this