Preferred Language
Articles
/
bsj-10084
Efficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm

The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. Existing research used metaheuristic algorithm to solve tak scheduling problem, however, must of the existing metaheuristics used suffers from falling into local mina due to their inefficiency to avoid unfeasible region in the solution search space. Therefore, there is a dire need for an efficient metaheuristic algorithm for task scheduling.  This study proposed an FPA-ISFLA task scheduling model using hybrid flower pollination and improved shuffled frog leaping algorithms. The simulation results indicate that the FPA-ISFLA algorithm is superior to the PSO algorithm in terms of makespan time, resource utilization, and execution cost reduction, especially with an increasing number of tasks.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Sep 30 2017
Journal Name
Al-khwarizmi Engineering Journal
Robot Arm Path Planning Using Modified Particle Swarm Optimization based on D* algorithm

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

... Show More
Crossref (8)
Crossref
View Publication Preview PDF
Publication Date
Thu Nov 30 2023
Journal Name
Iraqi Journal Of Science
A Key Based Hybrid Approach for Privacy and Integrity in Multi-Cloud

    Before users store data in the cloud, many security issues must be addressed, as they will have no direct control over the data that has been outsourced to the cloud, particularly personal and sensitive data (health, finance, military, etc.). This article proposes a system based on chaotic maps for private key generation. A hybrid encryption for fast and secure cryptography. In addition to a multi-cloud storage with Pseudonymized file names to preserve user data privacy on the cloud while minimizing data loss. As well as a hash approach to check data integrity. AES in combination with RSA and fragmenting the file is used for the encryption. Integrity is cheeked using SHA-3. The experiments demonstrated that the key generation stra

... Show More
Scopus Crossref
View Publication
Publication Date
Mon May 11 2020
Journal Name
Baghdad Science Journal
A Cryptosystem for Database Security Based on TSFS Algorithm

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

Scopus (5)
Crossref (2)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Sun Sep 03 2023
Journal Name
Iraqi Journal Of Computers, Communications, Control & Systems Engineering (ijccce)
Efficient Iris Image Recognition System Based on Machine Learning Approach

HM Al-Dabbas, RA Azeez, AE Ali, IRAQI JOURNAL OF COMPUTERS, COMMUNICATIONS, CONTROL AND SYSTEMS ENGINEERING, 2023

View Publication
Publication Date
Wed Jul 29 2020
Journal Name
Iraqi Journal Of Science
Fog-based Spider Web Algorithm to Overcome Latency in Cloud Computing

The cloud-users are getting impatient by experiencing the delays in loading the content of the web applications over the internet, which is usually caused by the complex latency while accessing the cloud datacenters distant from the cloud-users. It is becoming a catastrophic situation in availing the services and applications over the cloud-centric network. In cloud, workload is distributed across the multiple layers which also increases the latency. Time-sensitive Internet of Things (IoT) applications and services, usually in a cloud platform, are running over various virtual machines (VM’s) and possess high complexities while interacting. They face difficulties in the consolidations of the various applications containing heterog

... Show More
Scopus (6)
Crossref (3)
Scopus Crossref
View Publication Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
Fusion: Practice And Applications
Optimizing Task Scheduling and Resource Allocation in Computing Environments using Metaheuristic Methods

Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment

... Show More
Scopus Crossref
View Publication
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

... Show More
Scopus (5)
Crossref (3)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Mon Apr 30 2018
Journal Name
Journal Of Theoretical And Applied Information Technology
An efficient artificial fish swarm algorithm with harmony search for scheduling in flexible job-shop problem

Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

... Show More
Scopus (3)
Scopus
View Publication Preview PDF
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing appli

... Show More
Scopus (9)
Crossref (6)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Tue Nov 30 2021
Journal Name
Iraqi Journal Of Science
ESJF Algorithm to Improve Cloud Environment: Cloud computing

Nowadays, after the technological development in societies, cloud computing has become one of the most important technologies. It provides users with software, hardware, and platform as remote services over the Internet. The increasing number of cloud users has caused a critical problem in how the clients receive cloud services when the cloud is in a state of instability, as it cannot provide required services and, thus, a delay occurs. Therefore, an algorithm was proposed to provide high efficiency and stability to work, because all existing tasks must operate without delay. The proposed system is an enhancement shortest job first algorithm (ESJF) using a time slice, which works by taking a task in the shortest time first and then the l

... Show More
Scopus (4)
Crossref (2)
Scopus Crossref
View Publication Preview PDF