Scheduling Algorithms Implementation For
Scheduling Algorithms Implementation For
Authors’ contributions
This work was carried out in collaboration among all authors. All authors read and approved the final
manuscript.
Article Information
DOI: 10.9734/AJRCOS/2021/v11i430269
Editor(s):
(1) Prof. M. A. Jayaram, Siddaganga Institute of Technology, India.
Reviewers:
(1) Neelesh Jain, Sagar Institute of Research & Technology, India.
(2) R. Jemima Priyadarsini, Bishop Heber College, India.
Complete Peer review History: [Link]
ABSTRACT
The term "Real-Time Operating System (RTOS)" refers to systems wherein the time component is
critical. For example, one or more of a computer's peripheral devices send a signal, and the
computer must respond appropriately within a specified period of time. Examples include: the
monitoring system in a hospital care unit, the autopilot in the aircraft, and the safety control system
in the nuclear reactor. Scheduling is a method that ensures that jobs are performed at certain
times. In the real-time systems, accuracy does not only rely on the outcomes of calculation, and
also on the time it takes to provide the results. It must be completed within the specified time frame.
The scheduling strategy is crucial in any real-time system, which is required to prevent overlapping
execution in the system. The paper review classifies several previews works on many
characteristics. Also, strategies utilized for scheduling in real time are examined and their features
compared.
36
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
requirements, different scheduling methods can yet definite fashion utilizing a large number of
be used [37]. For time critical jobs, the flight tiny and diverse sizes of memory allocation/de-
software running on the operating system in real allocation [52, 53].
time, particularly on satellite systems [38].
Real time systems are systems that rely on two
Embedded real-time systems are expanding elements. The first is the logical outcome of
progressively in order to run high-performance, computing and the second is the moment when
multi-core architectural applications [39]. Efficient the results are produced [54, 55]. A process to
task plan models in these systems are extremely finish its execution takes a certain period and the
important to ensure that most of the jobs may be system will fail if the time is over for the process.
planned within their deadline to deliver the Two real-time planning approaches exist: (1)
desired performance [40]. dynamic static (2). The priorities remain the
same for a job in the static algorithm
In the next Internet era, it is greatly wanted to and priorities are set at conception, with
reduce energy consumption of integrated dynamic priority being assigned in due course
computers [41]. One of the most efficient ways [56].
for both dynamic and static processor energy
usage is Minimum Energy Point Tracking [42]. In The Realtime systems are in which the accuracy
the past several years, earlier studies suggested of the output depends not only on the logical
a number of MEPT techniques. Although edge conclusions of the calculations, but on the time of
computing applications generally demand low the output [57]. This indicates that the results
energy tasks with real-time guarantees. The must be generated within the specified time
problem is the time complexity in which to period [58]. The time limit for the system to reply
recognize MEPs and change voltages, which is termed the time limit. Deadline fulfilment in any
frequently prohibits the planning of tasks in real real-time system is an essential characteristic
time [43]. [59]. The ETS enables to complete applications
in real time to fulfil their deadline utilizing the
Robot Operating System (ROS) supports scheduling mechanism [60]. The planning
insulating defects, quicker development and approach is the core of any real-time system that
modularity, and the core reusability, thereby makes decisions regarding the execution of tasks
providing a broad and de facto standard for on the system in order to prevent overlap of any
independent driving systems [44]. The GPUs sort [61].
also allow high-performance computation and
are thus utilized for autonomous driving [45]. As A major feature of the RTOS is the level of
real time processing requirements rise, coherence about its length of time required for an
techniques are being developed for meeting the application to be accepted and completed, the
real-time limit for ROS and GPUs [46, 47]. variability of which called 'jitter.' A 'hard' real-time
Regrettably, algorithms are not under OS (Hard RTOS) is less jittered than a 'soft' real-
investigation, which describe the ROS transport time OS (Soft RTOS) [62]. The late answer in a
(publish/subscribe) model that may be restricted hard RTOS is incorrect, but a late response in a
in execution, resulting to time waiting and a soft RTOS is okay [63]. The main objective for
reduction of the reaction of the system as a design is a soft or hard performance category
whole [48]. In addition, ROS GPU workloads are rather than a high output [64]. An RTOS that
also influenced by the ROS transport model typically or generally meet a time limit is a Soft
since the time is taken to set up the central Real-time OS, while it is a Difficult Real-time OS
processing unit (CPU) [49]. if it meets a time limit deterministically [65]. An
RTOS has a sophisticated programming
Effective time operating systems (RTOS) should algorithm [66]. Scheduler flexibility allows the
encourage the protocols of resource access to orchestration of process priorities by a larger,
limit the maximum delay of priority inversions. computer system, although a real-time OS is
Such protocols must be implemented lightly more often used to address a small number of
since their performance impacts planning [50, applications [67]. Key elements in a real-time OS
51]. are minimum interrupt latency and minimum
thread latency; with a real-time OS, it's more
An essential challenge in soft re-timing system appreciated how quickly or reliably it reacts than
designs is the handling of algorithms that handle how much work it can do in a particular time
a large number of comparable data in a dynamic period [68].
37
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
38
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
39
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
practical tests were undertaken. Each task set scheduling, adding significant overhead and
has between one and nine operations. The data reducing task execution performance. The
set comprises 7500 task sets. Each process set algorithm's next areas of optimization will aim to
uses between 0.5 and 5 percent of the CPU. It minimize task transfer and context switching.
was validated against a 500-time unit to ensure
that both algorithms were accurate. Nasri et al. [99],The purpose of this study was to
demonstrate how the Non-preemptive
Capodieci et al. [96], showcased the rescheduling may be made more useful by using
development of a sample real-time scheduler for a first-in-first-out (FIFO) scheduling strategy
GPU functions on an embedded System on a combined with a unique reduction tuning
Chip (SoC) based on NVIDIA's cutting-edge process. This methodology allows the FIFO to
Architectures used in self-driving cars. The recreate a given viable scheduler, such as the
scheduling acts as a software segmentation layer one used by CW-EDF, resulting in a high degree
on top of the NVIDIA hypervisor, taking use of of schedule ability and relatively modest runtime
current-generation architectural features like as overheads. Memory overheads are also kept to a
pixel-level and thread-level preemption. We were minimum by using a modest number of offsets
able to construct and test a GPU activity per process. The runtime overhead, memory
scheduler that uses the Earliest Deadline First usage, and schedule ability ratio of the approach
(EDF) method. That provided Using a Constant are all examined using a preliminary result on an
Bandwidth Server, you may isolate your Arduino Uno board.
bandwidth. Using such an architecture (CBS).
Our research focused on alternative Abeni et al. [100], proposed a new hierarchical
programming paradigms for APIs computing, scheduler for Linux that is optimized for
which enabled to describe CPU and GPU container-based virtualization and can be utilized
submittal of a request with more detailed with LXC container that have multiple virtual
scheduling data. A full experimental CPUs. The provided scheduler is constructed by
characterization is offered to demonstrate the changing the real-time control group’s
considerable increase in scheduling of recurrent mechanism in such a way that the SCHED
real time GPU operations. DEADLINE policy is utilized to schedule each
group's real-time run queues. Experiments
Yang et al. [97], a hierarchy scheduling approach demonstrate that a real-time application
for DAG jobs with bounded deadlines was scheduled inside an LXC container using the
presented. Hierarchical scheduling separates the new scheduler operates in the manner expected
scheduling of computing resources from the by previous theoretical CSF analysis. Our control
scheduling of workloads, resulting in a groups scheduler proved to be simpler to setup
significantly more effective resource sharing and produced superior outcomes, while also
solution without regard for task kinds. We having the ability to use less real-time
demonstrate the feasibility of our suggested computing capacity inside the system, so
hierarchical scheduling on a practical platform reducing runs.
with an acceptable runtime overhead.
Additionally, we conduct extensive tests to Baital and Chakrabarti [101], proposed an
determine the schedule ability of our hierarchical improved scheduling algorithm in which random
scheduling system, and the findings indicate that tasks with varying periodicity and execution time
our suggested technique performs admirably. are generated at different time intervals. Energy
consumption is a critical design consideration in
Cao and Bian [98], using a homogeneous real-time systems, particularly battery-powered
multicore CPU, we suggested a DAG job systems. We extended our scheduling work to
scheduling technique. This is a refinement of the heterogeneous multicore systems (HMS)
stretching method. The original method is architectures, in which real-time tasks are
enhanced by adding the ability to pick subtasks distributed to the appropriate cores while still
for conversion and by improving the computation meeting the task deadline. They proved that the
of release time and deadline. This method has a heterogeneous multicore scheduler paradigm
substantially greater success rate than the may be utilized to create commercially
original approach in terms of scheduling. accessible heterogeneous multicore processors.
Nevertheless, owing to the segmentation of They validated the model using generated task
tasks, a high number of task migrations and sets and discovered that our model performs
context switches occur throughout task exceptionally well in all cases and significantly
40
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
reduces the system's energy consumption when Chen et al. [105], The results reported here
compared to some popular and novel scheduling establish the existence of Preemptive, fixed-
techniques. priority real time systems now have a new
scheduling side-channel (RTS). Systems that are
Chen et al. [102], develop a lightweight real time examples of this kind include automobile
scheduling method that is based on job systems, aviation system, electricity generation
duplication, RTSATD, with objective of lowering plants and industrial control systems. Notably,
both the time required to complete and the capturing this timing information is difficult
financial expense associated with cloud-based because to schedule runtime changes, the
big-data workflow processing. RTSATD's system's incorporation of several interrelated
performance is assessed using simulated and activities, and the normal limitations (e.g
real-world processes. Testing findings indicate deadline) inherent in the development of RTS.
that the suggested method beats two current Schedule-Leak methods reveal how to exploit
algorithms in terms of project length (by up to this side-channel successfully. On genuine
28.73 %) and resource consumption (up to 46.31 operating systems, a comprehensive
percent). implementation is shown (in Real-time-Linux and
Free RTOS). Schedule Leak's facts about the
Dauphin et al. [103], On parallel, heterogeneous, time period may considerably help other, more
Non-Uniform Memory Architecture (NUMA) sophisticated attackers in fulfilling their
systems, a hybrid technique for scheduling and objectives.
memory management of periodical dataflow apps
was proven. The task ordering and memory Malik et al. [106], suggested a novel For the
allocation for each Processing Element are proper execution and administration of real-time
distributed and computed concurrently in Odyn. hard and soft activities in embedding IoT
Additionally, He provides a strategy for devices, an adaptable and intelligent scheduling
preventing deadlocks induced by efforts to create mechanism is required. The reposed schedule
buffers in memory that are larger than the method prioritizes the performance of critical
available space. This method reduces the real-time tasks with a high degree of priority
requirement for backtracking, which is a feature activities above the distribution of CPU resources
of dynamic scheduling algorithms. It is based on to potentially hungry, in overloaded instances,
static calculation of exclusion relations among soft real-time processes. This was accomplished
buffers in an application. They demonstrate via the use of two astute deletions: Urgency
Odyn's efficacy on a test bench that simulates Measure (UM) and Failure Measure (FM). By
the interactions of concurrent applications leveraging the available CPU unit for optimal
generated randomly. Additionally, they CPU usage and rapid reaction times, the
demonstrate their technique for avoiding suggested methodology decreases the rate of
deadlocks through a variety of use cases. tasks missed and jobs starved. The findings
demonstrate that the suggested approach
Riasetiawan and Ashari [104], proposed a outperforms the other techniques in terms of task
schedule for the functioning of multiple landslide starvation rate reduction and CPU usage
sensors Separately, data processing is increase.
transferred to an IoT device using FIFO and
Round Robin scheduling. Only the performance Doan and Tanaka [107], suggested a novel way
of FIFO and Round Robin algorithms in of scheduling that is adaptable and intelligent for
scheduling incoming processes in real time on an the effective execution and administration of real-
IoT OS is discussed by the authors. Taking into time hard and soft tasks in embedded IoT
account the waiting time and response time. The devices. The reposed scheduling method
analysis is expected to result in a short response prioritizes the execution of high-priority hard-real-
time and waiting time, allowing for the selection time activities preceding the distribution of CPU
of an appropriate algorithm to complement the resources to potentially hungry, in overloaded
IoT architecture for landslide detection. The FIFO instances, soft real-time processes. This was
and Round Robin algorithms are implemented in accomplished via the use of two intelligent
the Raspberry Pi 3 Model B IoT device via erasures: Urgency-Measure (UM) and Failure-
Raspbian and Arches Ubuntu are two different Measure (FM). By leveraging the available CPU
operating systems. A 64-bit 64-bit ARM Cortex- unit for optimal CPU usage and rapid reaction
A53 64-bit processor operating at 1.2GHz time, the suggested methodology decreases the
powers the Raspberry Pi 3 Model B. rate of tasks missed and jobs starved. The
41
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
findings demonstrate that the suggested constraints associated with flying time-
approach outperforms the other techniques in constrained UAVs.
terms of task starvation rate reduction and CPU
usage increase. Chen et al. [111], has removed a significant
constraint associated with newly established
D'souza and Rajkumar [108], presented the dependency graph approaches, namely just one
Cycle Tandem static frequency-scaling crucial section per task (DGA). Under terms of
methodology for co-optimization of the CPU and computational complexity, shown that even in
hardware accelerators operating frequencies. extremely limited settings, the multiprocessor
Consider different energy management situations synchronization issue is NP-complete. Suggest a
where the accelerator or CPU frequency may or Provide the approximation ratio(s) for the
may not be configurable, and present the Cycle resulting computation time based on a
Solo family of algorithms for such situations systematic proposed design based on the DGA
based on practical considerations of real-world by leveraging current algorithms designed for job
platforms. Additionally, when multi-core shop scheduling. The results of the evaluation in
processors are utilized in combination with Section 6.2 show that the methodology is quite
hardware accelerators, partitioning solutions effective for real-time task systems based on
should be investigated to lower operation frames.
frequency. Experiments suggest that some
strategies may result in large energy savings. Utkarsh et al. [112], a completely distributed
Additionally, we offer a case study using the model-predictive and computational intelligence
NVIDIA TX2 embedded platform to demonstrate program that enables micro grid devices to
the energy reductions that our suggested function autonomously with little communication
solutions may achieve. exchange, hence eliminating the need for a
central controller. The proposed distributed
Nguyen et al. [109], suggested Real time algorithm's convergence features are evaluated
scheduling of Household Appliances' Quality and compared to those of a state-of-the-art
learning, a well-known value iterative distributed algorithm, and numerical simulations
reinforcement learning methodology, is used to for various situations are conducted to
calculate operational time (RSOTHA-QL). The demonstrate that the proposed distributed
RSOTHA-QL procedure is a two-step procedure. approach may be implemented to real-world
The first step involves Q learning agents micro grids.
engaging with the smart home system with the
purpose of receiving a reward. Additionally, the Lee et al. [113], It is advised that a real time
incentive value is used to arrange the operating schedule study of transiently powered CPUs with
duration of home App in next step, ensure that a NVMs be performed. To begin, quantitatively
energy consumption is kept to a minimum. The analyze the energy harvester's charging and
second phase addresses discontent caused by discharging behaviors and extract the system's
the scheduling of the operating time of the home compute capabilities in the time interval domain.
user's domestic appliances by dividing them in to Then, using real time calculus, we establish
Three categories: 1) deferrable, 2) non- whether or not a particular multi-task workload
deferrable, and3) controlled. It is discovered that can be scheduled using the earliest possible
the operating period of household appliances is deadline first (EDF) or fixed-priority (FP)
effectively planned in order to considerably scheduling rules. Furthermore, the work
minimize energy usage and user discontent. examined how the threshold voltage parameter
selection influences schedulability and then
Khan et al. [110], demonstrated the efficacy of developed a practical threshold selection
our suggested DRL algorithm, for scheduling technique to improve schedulable.
energy harvesting times during UAV-assisted Comprehensive simulations are used to validate
,D2D communication. The terms of EE and the suggested technique's efficacy. In
complexity, offered approaches outperform comparison to the naïve selection approach, the
benchmarks. The energy harvesting time strategy consistently improves schedule ability
scheduling game may be resolving extremely across a range of workloads.
fast by exploiting the benefits of deep learning.
The findings indicate that the DRL method may El Ghor et al. [114], The challenge of real-time
be a viable solution for a real time app, given the scheduling of many processors at the systems
energy storage constraints and the times with an It was investigated if an energy reservoir
42
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
Table 1. Summary of literature review related to Scheduling Algorithms for Real Time Operating Systems
No. Ref. RTOS Type Operating Significant Results Future Work Suggestions
and System
Year
1 [95] Soft RTOS Real time Data Set Includes 7500 task sets. Each procedure is an individual job. In the coming, we may suggest a new method that incorporates LST and
2018 operating systemprocessor load SJF. Load and demand will make it function well.
2 [96] Soft RTOS embedded For quickly executing aperiodic jobs, we give them a null, or small, In the near, we hope to introduce more complex reclamation techniques
2018 System deadline. This allows the aperiodic jobs to preempt already executing jobs. for GPUs' excess bandwidth, which will make more flexible selections of
GPU task budgets possible.
3 [97] Hard A Hierarchical Our hierarchical scheduling implementation was assessed and findings Future directions for this study abound. Let's first look into scheduling
2018 RTOS Scheduling showed it to be promising. many DAG jobs on several virtual platforms under various platforms.
Approach Also, DAG task scheduling models with resource sharing is a worthwhile
consideration. Secondly, we want to use power scheduling techniques for
DAG.
4 [98] Hard Multi-core This method's scheduling success rate is much higher than the original Next up are tasks and context switching for the algorithm.
2020 RTOS Processors approach.
5 [99] Hard Arduino board With respect to code size, FIFO-OT scheduler footprints are likewise less The aggregate minimum amount of offsets for all jobs and extended
2018 RTOS than OE's. systems with release jitter.
6 [100] Soft RTOS Linux Kernel Experimental findings reveal that real-time LXC-based scheduling In the upcoming, we want to experiment with the suggested scheduler in
2019 performed under the new scheduler behaved as expected by current CSF a multi-CPU container-based simultaneous real-time activity setting.
analyses.
7 [101] Hard Multicore systems Our approach works very well in all instances, and greatly decreases The additional feature will help implement dependent task sets.
2019 RTOS energy usage when compared to certain popular and novel schedules.
8 [102] Hard Geo-Distributed The testing findings show that the suggested algorithm offers 28.73% Therefore, fault-tolerant huge data processing scheduling should be one
2020 RTOS Clouds more completion time reduction and 46.31% greater resource usage than of the noteworthy approaches to pursue.
the other alternatives.
9 [103] RTOS Dataflow Authors show the usefulness of Odyn on a test bench that replicates A suggests research project is to calculate the appropriate memory
2019 Applications random program interactions We illustrate the stalemate avoidance assignments for PEs, depending on their performance requirements.
strategy in several scenarios.
12 [106] Hard and IoT Devices The study found that the suggested approach outperformed the other One of the drawbacks of the suggested solution is that it requires time to
2019 Soft Real Embedded techniques, considerably lowering task starvation and boosting CPU collect sufficient training data.
Time Hybrid usage.
13 [107] Soft RTOS Real-time The outcomes from our simulation demonstrate that our technique has In addition, using a hardware accelerator may minimize the runtime
2018 embedded decreased time complexity while still maintaining schedulability, task overhead of the method. This inquiry is in the realm of practice and
systems. preemption, and task migration. segmented near-optimal techniques.
43
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
No. Ref. RTOS Type Operating Significant Results Future Work Suggestions
and System
Year
14 [108] Hard Cyber-physical Lastly, we implement the Cycle Solo and Cycle Tandem algorithms to full- Multi-core systems are where the rate of each processor core may be
2018 RTOS systems partitioned multi-core CPUs, where all CPU cores should be tuned to the separately adjusted in the next. Systems which feature numerous
same rate. accelerators may also be considered.
15 [109] Soft RTOS neural networks The findings show that the DRL method may be applicable for real-time In the approach, we will handle more complex challenges by
2020 applications even if energy storage and flight duration are limited. simultaneously optimizing power allocation, trajectory planning, and
numerous UAV scenarios.
16 [110] Hard Smart Home The suggested scheduling technique improves on the LST based Future research will use deep Q knowledge and artificial neural networks
2018 RTOS Appliances scheduling when it comes to decreasing energy use and lowering to simulate a complex multiple-home user situation.
unhappiness for the house us.
17 [111] Soft RTOS Multicore systems Using created task sets, the model was verified and shown to perform Our next projects will be focused on validating the scheduling model,
2020 brilliantly and dramatically lower energy usage in comparison to a few ensuring it is fault tolerant and reliability conscious.
popular and novel scheduling approaches.
18 [112] Soft RTOS Network of Smart in the simulation game, there are huge benefits to reactive power trading, Not mentioned
2018 Micro grids including dynamic price adjustments between micro grids.
19 [113] Hard Wireless Sensor This article examines the schedulability of transiently supplied CPUs with Additionally, minimizing the threshold voltage searching overhead without
2020 RTOS Network NVMs in real time. Quantified analysing the behaviour of the energy approximation remains a future studies objective.
harvester across time intervals permits real-time multi-task execution time
analysis using the RTC.
20 [114] Hard Ambient energy Our method delivers substantial performance improvement when The next study will concentrate on an evaluation of the performance of
2018 RTOS compared to EDF. EH-RA comparison to EDF, which uses the bin-packing methodology.
44
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
45
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
46
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
Journal of Electronic and Computer tracker. SMS reminder system: Design and
Engineering. 2018;11:35-58. implementation; 2020.
25. Sadeeq MA, Abdulazeez AM. Neural 36. Malallah H, Zeebaree SR, Zebari RR,
networks architectures design, and Sadeeq MA, Ageed ZS, Ibrahim IM, et al.
applications: A review. 2020 International A comprehensive study of kernel (issues
Conference on Advanced Science and and concepts) in different operating
Engineering (ICOASE). 2020;199-204. systems. Asian Journal of Research in
26. Ageed ZS, Ibrahim RK, Sadeeq M. Unified Computer Science. 2021;16-31.
ontology implementation of cloud 37. Sadeeq MA, Zeebaree SR, Qashi R,
computing for distributed systems. Current Ahmed SH, Jacksi K. Internet of things
Journal of Applied Science and security: A survey. in 2018 International
Technology. 2020;82-97. Conference on Advanced Science and
27. Zeebaree S, Ameen S, Sadeeq M. Social Engineering (ICOASE). 2018;162-166.
media networks security threats, risks and 38. Ismael HR, Ameen SY, Kak SF, Yasin HM,
recommendation: A case study in the Ibrahim IM, Ahmed AM, et al. Reliable
kurdistan region. International Journal of communications for vehicular networks.
Innovation, Creativity and Change. Asian Journal of Research in Computer
2020;13:349-365. Science. 2021;33-49.
28. Sulaiman MA, Sadeeq M, Abdulraheem 39. Yasin HM, Zeebaree SR, Sadeeq MA,
AS, Abdulla AI. Analyzation study for Ameen SY, Ibrahim IM, Zebari RR, et al.
gamification examination fields. Technol. IoT and ICT based smart water
Rep. Kansai Univ. 2020;62:2319-2328. management, monitoring and controlling
29. Sadeeq M, Abdulla AI, Abdulraheem AS, system: A review. Asian Journal of
Ageed ZS. Impact of electronic commerce Research in Computer Science. 2021;42-
on enterprise business. Technol. Rep. 56.
Kansai Univ. 2020;62:2365-2378. 40. Abdulla AI, Abdulraheem AS, Salih AA,
30. Salih A, Zeebaree ST, Ameen S, Alkhyyat Sadeeq M, Ahmed AJ, Ferzor BM, et al.
A, Shukur HM. A survey on the role of Internet of things and smart home security.
artificial intelligence, machine learning and Technol. Rep. Kansai Univ. 2020;62:2465-
deep learning for cybersecurity attack 2476.
detection. 2021 7th International 41. Abdulraheem AS, Salih AA, Abdulla AI,
Engineering Conference “Research & Sadeeq M, Salim N, Abdullah H, et al.
Innovation amid Global Pandemic"(IEC). Home automation system based on IoT;
2021;61-66. 2020.
31. Alzakholi O, Shukur H, Zebari R, Abas S, 42. Salih AA, Zeebaree S, Abdulraheem AS,
Sadeeq M. Comparison among cloud Zebari RR, Sadeeq M, Ahmed OM.
technologies and cloud performance. Evolution of mobile wireless
Journal of Applied Science and communication to 5G revolution.
Technology Trends. 2020;1:40-47. Technology Reports of Kansai University.
32. Abdullah DM, Ameen SY, Omar N, Salih 2020;62:2139-2151.
AA, Ahmed DM, Kak SF, et al. Secure data 43. Dino HI, Zeebaree S, Salih AA, Zebari RR,
transfer over internet using image Ageed ZS, Shukur HM, et al. Impact of
steganography. Asian Journal of Research process execution and physical memory-
in Computer Science. 2021;33-52. spaces on OS performance. Technology
33. Ageed Z, Mahmood MR, Sadeeq M, Reports of Kansai University.
Abdulrazzaq MB, Dino H. Cloud computing 2020;62:2391-2401.
resources impacts on heavy-load parallel 44. Hamdi SJ, Ibrahim IM, Omar N, Ahmed
processing approaches. IOSR Journal of OM, Rashid ZN, Ahmed AM, et al. A
Computer Engineering (IOSR-JCE). comprehensive study of malware detection
2020;22:30-41. in android operating systems.
34. Kareem FQ, Ameen SY, Salih AA, Ahmed 45. Ibrahim IM. Task scheduling algorithms in
DM, Kak SF, Yasin HM, et al. SQL cloud computing: A review. Turkish Journal
injection attacks prevention system of Computer and Mathematics Education
technology. Asian Journal of Research in (TURCOMAT). 2021;12:1041-1053.
Computer Science. 2021;13-32. 46. Ageed ZS, Ahmed AM, Omar N, Kak SF,
35. Sallow A, Zeebaree S, Zebari R, Mahmood Ibrahim IM, Yasin HM, et al. A state of art
M, Abdulrazzaq M, Sadeeq M. Vaccine survey of nano technology:
47
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
48
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
49
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
50
Ismael et al.; AJRCOS, 11(4): 35-51, 2021; Article [Link].73758
Peer-review history:
The peer review history for this paper can be accessed here:
[Link]
51