liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A hardware/software partitioning method based on graph convolution network
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. Guangdong Univ Technol, Peoples R China.
Guangdong Univ Technol, Peoples R China.
Guangdong Univ Technol, Peoples R China.
2021 (English)In: Design automation for embedded systems, ISSN 0929-5585, E-ISSN 1572-8080, Vol. 25, no 4, p. 325-351Article in journal (Refereed) Published
Abstract [en]

Hardware/software (HW/SW) partitioning is the crucial step in HW/SW co-design, which can significantly reduce the time-to-market and improves the performance of an embedded system. Due to that the majority of previous works have large exploration time and generate often low-quality solutions for large scale systems, we propose a fast HW/SW partitioning approach based on graph convolution network (GCN) to address this problem. To the best of our knowledge, it is a new partitioning method based on GCN which is a gradient-based optimization approach. It can aggressively speed up the partitioning process. To quantify the quality of solutions, the scheduling is integrated into the partitioning process. The experiment results show that not only does our proposed method outperform existing metaheuristics approaches in terms of the efficiency (e.g., 18x faster than Kernighan-Lin algorithm for the task graphs with 1000 nodes), but it also improves the quality of HW/SW partitioning (e.g., more than 10% acceleration ratio (AR) improvement for the 1000 nodes graphs).

Place, publisher, year, edition, pages
SPRINGER , 2021. Vol. 25, no 4, p. 325-351
Keywords [en]
HW; SW partitioning; Graph convolution network; Scheduling
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-181067DOI: 10.1007/s10617-021-09255-9ISI: 000712944200001OAI: oai:DiVA.org:liu-181067DiVA, id: diva2:1612468
Note

Funding Agencies|Science and Technology Planning Project of Guangdong Province of China [2019B010140002]

Available from: 2021-11-18 Created: 2021-11-18 Last updated: 2022-04-06

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Zheng, Xin
By organisation
Software and SystemsFaculty of Science & Engineering
In the same journal
Design automation for embedded systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 34 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf