A Heuristic Framework to Organize Heterogenous Network Embedded Systems

This paper introduces a heuristic method to process sequencing in Heterogeneous Distributed Embedded Systems (HDES). This suggested study discusses the Genetic Algorithm (GA) and Ant Colony Optimization (ACO) enhanced using the greedy algorithm added to the system, which consists of numerous Heterogeneous Embedded Machines (HEMs) operating as a group. Customers have the ability to make use of their computing capacity remotely. The connectivity options on various kinds of buses are considered to identify the best option. Novel meta-heuristic data based on transporting reliant is proposed to increase the chance of ACO generating task prioritization. Furthermore, a greedy approach for machine assignment is used to carry out task planning. Simulations using arbitrary task graphs in the HEM collection show that the Enhanced Greedy Ant Colony Optimization (EGACO) process exceeds each of the others by 33% in terms of outcome eminence.

Publication Details

Journal
Journal on Electronic and Automation Engineering
Published
2025-07-19
DOI
https://doi.org/10.46632/jeae/1/2/8
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Heuristic Framework to Organize Heterogenous Network Embedded Systems

Journal on Electronic and Automation Engineering
Distributed and Parallel Computing Systems
article

A Heuristic Framework to Organize Heterogenous Network Embedded Systems

article en

Abstract

This paper introduces a heuristic method to process sequencing in Heterogeneous Distributed Embedded Systems (HDES). This suggested study discusses the Genetic Algorithm (GA) and Ant Colony Optimization (ACO) enhanced using the greedy algorithm added to the system, which consists of numerous Heterogeneous Embedded Machines (HEMs) operating as a group. Customers have the ability to make use of their computing capacity remotely. The connectivity options on various kinds of buses are considered to identify the best option. Novel meta-heuristic data based on transporting reliant is proposed to increase the chance of ACO generating task prioritization. Furthermore, a greedy approach for machine assignment is used to carry out task planning. Simulations using arbitrary task graphs in the HEM collection show that the Enhanced Greedy Ant Colony Optimization (EGACO) process exceeds each of the others by 33% in terms of outcome eminence.

Journal on Electronic and Automation EngineeringVol. 1(2)
Openalex Percentile: Top 78%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.