Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Hardware-software partitioning using three-level hybrid algorithm for system-on-chip platform

Bulletin of Electrical Engineering and Informatics · Vol. 10 No. 1 (2020) · hlm. 466–473

DOI
10.11591/eei.v10i1.2201
ISSN
2089-3191, 2302-9285
Terbit
2020-10-11
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en

Abstrak

This study discusses hardware-software partitioning, which is useful for system-on-chip (SoC) applications. Hardware-software partitioning attempts to obtain the lowest execution time by combining a hardware processor system and a field programmable gate array on the SoC platform in embedded system applications. A three-level hybrid algorithm called GAGAPSO is proposed in this study. The algorithm consists of two successive genetic algorithms (GAs) and one particle swarm optimization (PSO). The drawbacks of these two algorithms are GA has low convergence speed and PSO has premature convergence because of low diversity. These algorithms are combined in this study to achieve high-capacity global convergence and enhanced search efficiency. In this study, three algorithms are developed, namely, GA, GAPSO and GAGAPSO using MATLAB. These algorithms are evaluated on the basis of the number of nodes and the minimum cost that can be achieved. The number of nodes varies from 10 to 1000 nodes. The minimum cost and the number of iterations to achieve the minimum cost are recorded. Results show that GAGAPSO can converge faster than GA and GAPSO. Furthermore, GAGAPSO can achieve the lowest cost for all nodes.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 7 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universiti Sains Malaysia
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Mohamad Khairi IshakUniversiti Sains Malaysia1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Hardware-software partitioning using three-level hybrid algorithm for system-on-chip platform</dc:title><dc:creator>Tiong Reng Xian</dc:creator><dc:creator>Zaini Abdul Halim</dc:creator><dc:creator>Ching Chia Leong</dc:creator><dc:creator>Tan Jiunn Gim</dc:creator><dc:subject>hardware/software partitioning</dc:subject><dc:subject>system-on-chip</dc:subject><dc:subject>hybrid metaheuristic</dc:subject><dc:subject>genetic algorithm</dc:subject><dc:subject>particle swarm optimization</dc:subject><dc:subject>FPGA</dc:subject><dc:subject>embedded systems</dc:subject><dc:subject>execution time reduction</dc:subject><dc:subject>convergence rate</dc:subject><dc:subject>premature convergence</dc:subject><dc:description xml:lang="en">This study discusses hardware-software partitioning, which is useful for system-on-chip (SoC) applications. Hardware-software partitioning attempts to obtain the lowest execution time by combining a hardware processor system and a field programmable gate array on the SoC platform in embedded system applications. A three-level hybrid algorithm called GAGAPSO is proposed in this study. The algorithm consists of two successive genetic algorithms (GAs) and one particle swarm optimization (PSO). The drawbacks of these two algorithms are GA has low convergence speed and PSO has premature convergence because of low diversity. These algorithms are combined in this study to achieve high-capacity global convergence and enhanced search efficiency. In this study, three algorithms are developed, namely, GA, GAPSO and GAGAPSO using MATLAB. These algorithms are evaluated on the basis of the number of nodes and the minimum cost that can be achieved. The number of nodes varies from 10 to 1000 nodes. The minimum cost and the number of iterations to achieve the minimum cost are recorded. Results show that GAGAPSO can converge faster than GA and GAPSO. Furthermore, GAGAPSO can achieve the lowest cost for all nodes.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2020-10-11</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v10i1.2201</dc:identifier><dc:identifier>10.11591/eei.v10i1.2201</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 10 No 1 (2020); 466-473</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/2201/1911</dc:relation></oai_dc:dc>