Opposition Strategy with Harris Hawk Algorithm for Task Scheduling in Edge Computing

Dimensions

Padmakala, S. and Khond, Smita and Al-Farouni, Mohammed and Punitha, S. and Kaliappan, S. (2024) Opposition Strategy with Harris Hawk Algorithm for Task Scheduling in Edge Computing. In: UNSPECIFIED.

Full text not available from this repository.

Abstract

Edge computing (EC) nodes face increasing task loads. This study presents Opposition-Based Learning with Harris Hawk Optimization (OHHO) for task scheduling in dynamic EC environments. OBL discards suboptimal solutions, improving adaptability. Dynamic Priority Task Scheduling Algorithm (DPTSA) balances load by priority and resource availability. OHHO achieved 0.1 mJ energy, 1s makespan, 45ms delay, outperforming DQN and PSO-GWO approaches. © 2025 Elsevier B.V., All rights reserved.

Item Type: Conference or Workshop Item (Paper)
Subjects: Computer Science > Artificial Intelligence
Computer Science > Computer Science Applications
Computer Science > Information Systems
Computer Science > Information Systems and Management
Computer Science > Computer Networks and Communications
Engineering > Control and Optimization
Divisions: Engineering and Technology > Vinayaka Mission's Kirupananda Variyar Engineering College, Salem, India > Computer Science and Engineering
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 27 Nov 2025 07:09
URI: https://ir.vmrfdu.edu.in/id/eprint/2086

Actions (login required)

View Item
View Item
Altmetric
['Plugin/Screen/EPrint/Box/Plumx:title' not defined]