0% found this document useful (0 votes)
52 views

Implementation of Task Scheduling Algorithms of Multiprocessor and Mixed Critical Systems-2

This document discusses task scheduling algorithms for multiprocessor and mixed critical systems. It addresses two key challenges - overcoming limitations of modern programming languages to support time-sensitive applications in multicore systems, and developing task scheduling strategies in multicore systems to reduce runtime overhead and improve support for mixed critical systems. The introduction provides background on real-time embedded systems and discusses research problems in scheduling algorithms for optimal resource allocation and quality of service guarantees on multiprocessor architectures.

Uploaded by

charanssit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views

Implementation of Task Scheduling Algorithms of Multiprocessor and Mixed Critical Systems-2

This document discusses task scheduling algorithms for multiprocessor and mixed critical systems. It addresses two key challenges - overcoming limitations of modern programming languages to support time-sensitive applications in multicore systems, and developing task scheduling strategies in multicore systems to reduce runtime overhead and improve support for mixed critical systems. The introduction provides background on real-time embedded systems and discusses research problems in scheduling algorithms for optimal resource allocation and quality of service guarantees on multiprocessor architectures.

Uploaded by

charanssit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Research and Applications: Embedded System

Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Implementation of Task Scheduling Algorithms of Multiprocessor


and Mixed Critical Systems

Suhas G. K.1*, Charan K.V.2


1,2
Associate Professor, Shridevi Institute of Engineering & Technology, Tumakuru-572106

*Corresponding Author
E-Mail Id: [email protected]

ABSTRACT
The advent of multi-core architecture rises many challenges, issues and opportunities.
Multicores have significantly increased performance of embedded real-time systems and high
performance systems. It has also created a greater impact in the way of software development
from application software’s to operating system kernels. An increasing number of high
performance systems are programmed using modern programming languages due to parallel
programming revolution created by the multicores. The cost reduction trends in modern
embedded systems induces functional consolidation which results in development of mixed
critical systems (MCS). Two critical challenges are addressed in this research work are one is
overcoming the limitations of modern programming languages to support for developing time
sensitive applications in multicore systems. Another one is developing task scheduling strategy
in multicore systems to decrease the runtime overhead as well as improving support for mixed
critical systems.

Keywords: About four key words or phrases in alphabetical order, separated by commas

INTRODUCTION problem of efficient resource scheduling


The scheduling concept is integral part of for optimal resource allocation to ensure
embedded real-time system design and better quality of service for real-time
analysis. Real-time system quality also applications in multiprocessor
depends on the type of scheduling architectures have been unresolved in the
mechanism used in the system design. We real time system field. Real-time
identify two types of candidate algorithms embedded systems as showninFig1.1are
for multicore systems one is responsible key technological components in many
for ensuring the deterministic real-time application domains like (i) Avionics (ii)
response of the time sensitive tasks in Medical embedded devices, (iii)
mixed critical systems [2], another one Automotive (iv) Defense and (v)
helps for developing application with Telecommunication systems etc. When
time-sensitive tasks using modern building a real-time system with hardware
programming languages [5,6]. and software to obtain deterministic
response, every part of the system has to
It is also considered by researchers and ensure predictable timing including the
system designers from many years for embedded operating system and
solving open problems in these algorithms. identifiable segments of it. Evaluating
Researchers in the Real-time systems field modern programming languages for it’s
are contributing from several decades for suitability to be used for real-time
empowering embedded operating systems embedded application development on
using new technologies and adding widely adopted multiprocessor embedded
extensions to the kernel source. The systems, the literature provides many

HBRP Publication Page 1-11 2022. All Rights Reserved Page 1


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

challenges and shortcomings with respect handle the radioactive other


to real-time system development support. dangerous materials.
The inherent problems drives research
towards enhancing real-time computing by RTOS vs General Purpose OS
using real-time scheduling algorithms. The real-time operating systems are
intentionally used to support operations of
 In Automotive, the embedded the real-time applications by guaranteeing
real-time system are used for a certain capability within a specified time
controlling the breaks and engines of constraint. There are basically three main
the vehicle for smooth traveling diff erences compared to general purpose
experience. operating systems (GPOS) Determinism,
 In Avionics, the embedded real-time Task scheduling and Pre-Emptiveness.
systems are used for the flight
navigation and avoiding accidents. Determinism
 It is also used in health-care system Goal of the RTOS is supporting real-time
for monitoring patient condition by applications to obtain deterministic
regulating heart beats and blood response time. Deterministic timing means
pressure of the patient. They can also we can predict task response time during
be used for entertaining patient with designing of system. Tasks worst case
Television, electronic games and execution time in RTOS can be
music. pre-defined. Unlike RTOS in GPOS
 Embedded real-time system can also Latency is not a concern but it support for
be found in air-traffic control system equally sharing the computational power
(ATC) to provide advisory services to among all task in a system to guarantee the
flights for ensuring its safe landing at system throughput instead of deterministic
the destination airport. This is response time.
achieved by assigning unique arrival
time for each aircraft. Task Scheduling
 The real time systems are integral In computer operating system, task
components in industries. Consider an scheduling is one of the basic functionality
example of industrial robots which are in process management. It is a method of
capable of automating assembly and assigning some specified work to
repair operations in a unmanned resources to finish the work. This kind of
sector of the factory. scheduling activity is carried out by a
 The military aircraft contain real-time scheduler. General purpose operating
embedded systems for performing systems are used to run diff erent
many kind of mixed critical applications and multiple processes
functionalities including navigation, simultaneously in the same platform.
communication, display screens, and
weapon control system. It also ensures all running tasks will
 Supervisory Control and Data receive fair amount of processing time.
Acquisition (SCADA) also uses real While executing the tasks sometimes
time systems. In SCADA systems raw priority of the lower priority tasks will be
data is collected from the sensors that boosted more than the priority of the
are placed at diff erent geographical several higher priority tasks. The RTOS
points, this data is processed and mainly uses preemptive scheduling based
stored in a separate database. • on task priority, which is essential for
Nuclear power stations are the consistent execution of high priority tasks.
unmanned areas where robots used to

HBRP Publication Page 1-11 2022. All Rights Reserved Page 2


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Ensuring time bounded operations all tasks. An infinite loop is used for
system calls are deterministic. preemptive scheduling of tasks in RTOS.
Each task acts as an independent program
 All kernel operations can be placed in a loop between ready and finish
pre-empted in RTOS. place. According to certain events or
 Priority inversion problem is tokens or flags action will takes place but
prevented in RTOS using certain task will not return to the scheduling point
mechanisms. unlike function does?

Pre-Emptiveness The embedded system means a software is
Operating system schedules the higher embedded on hardware as one of the
priority task by preempting the many important component. They are widely
lower priority tasks, all operations of lower used in small automation to larger avionic
priority tasks are blocked due to embedded systems. The complexity of
preemption. It is used to solve problem of embedded system software is increasing as
more latency for higher priority task which the complexity of embedded system
designer may not want. The worst case hardware is also improving. Earlier 8 bit
latency or time delay in execution is embedded systems are not using operating
diff erent for every task in a system. Higher systems inside but modern 8 bit devices
priority task latency is much smaller are using small kernels as shown in Figure
compared to latency of the lower priority 2.

Fig. 1: Real time embedded systems examples.

Fig. 2: Spectrum of embedded devices.

HBRP Publication Page 1-11 2022. All Rights Reserved Page 3


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

The embedded system means a software is rise in the adoption of single core
embedded on hardware as one of the processors. Multicore architectures have
important component. They are widely got a momentum due to limitations in
used in small automation to larger avionic using high speed single core processor.
embedded systems. The complexity of This shift from single core to multicore
embedded system software is increasing as processors [4] is a very big challenge in
the complexity of embedded system computing field for embedded real-time
hardware is also improving. Earlier 8 bit systems developers and designers for
embedded systems are not using operating example consider existing old legacy
systems inside but modern 8 bit devices systems using uniprocessor assumptions
are using small kernals as shown in Figure for its development.
2.
There are systems developed many years
Multicore architecture has become the ago and maintained by developers, and
trend of high performance processors. they cannot be replaced very easily due to
Multicore or Multi-processors introduces huge investments for developing such
parallelization revolution in software or systems. Another important aspect while
hardware. Figure 3 shows exponential shifting to multicore is task allocation
growth of multi core processors and initial among diff erent cores to improve
point of its evolution. This trend is performance of such multicore platforms.
continuing, moving from multi cores to Here partitioning algorithm is presented to
many cores but according to Ambdhal’s efficiently allocating tasks of the systems
law speed up factor is a limiting element to diff erent cores. The partitioning
for chip manufactures for increasing technique also used to increase
number of cores in the processors. performance of the system by ensuring its
According to power usage and problems correctness.
related to thermal will hiders [7] a further

Fig. 3: Multicore processors tren.

LITERATURE SURVEY focused on only periodic tasks having


Owen R. Kelly and Haken Aydlin same degree of importance or criticality.
identified that Multi core processors Research eff orts for scheduling mixed
overcome many drawbacks of criticality tasks on Real-time
uniprocessor system. The emergence of multiprocessor system are relatively new.
multi core systems also received increased Experiments are performed to evaluate
attention for developing multiprocessor performance of the diff erent algorithms
scheduling algorithms of both uncritical used for priority assignment and its
and multi critical real-time applications. A schedulability tests. Simulator is
majority of the research on task scheduling developed using Java language to generate
approaches in real-time systems have synthetic kind of mixed-critical task sets

HBRP Publication Page 1-11 2022. All Rights Reserved Page 4


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

along with some of the varied parameters the tasks, reacting to this events by
in a larger range for representing a various switching the scheduling modes.
embedded hard real-time application using
this eff orts. The results obtained by this Without aff ecting system’s safety
experiments shows that by combing implementing this kind of runtime
priority assignment algorithm developed mechanism efficiently is very important for
by Audsley’s with Bertogna et al. any scheduler to identify runtime events
schedulability test surpass other and respond in a timely fashion. This paper
approaches. According to Lukas Sigrist find out alternative implementations to
and Georgia. The mixed criticality these mechanisms and evaluates
scheduling problem and several policies to empirically how much it aff ects the
overcome the problem is rising due to use runtime overhead on the scheduling of
of multi-cores in embedded system mixed-critical applications. Two
deployments and multicritical applications scheduling schemes are implemented one
are co-hosting in the same embedded is flexible time-triggered FTTS and
platform. Scheduling policies to overcome another one is PEDF-VD (partitioned
mixed critical scheduling problem EDF-VD). The runtime overhead of both
employs certain runtime monitoring proposed scheduling technique is
mechanisms and handles certain measured on an Intel @ Xeon Phi having
exceptional events including task 60 cores and Intel @ core i5 on 4 cores.
overruns. Special events will be handled in Extensively executing user generated task
a timely fashion without compromising the sets on avionic applications of avionic
safety of the system. industry, the observation is the runtime
overheads also cannot be neglected on
This paper introducing alternative massively increased cores with multi core
implementations of the runtime architectures due to which they loss
mechanism in mixed criticality systems. schedulability upto 97%. Runtime
This mechanisms are empirically mechanisms evaluation is the early phase
evaluated on their runtime overheads. Two of the design and incorporating it’s
such policies are improved is flexible time overheads in schedulability analysis is
triggered scheduling and Partitioned becoming necessary step in the
EDF-VD. There runtime overhead is mixed-critical systems design. The need
measured on 60 core Xeon Phi and 4 core for small overheads bounded within a rang
Xeon Phi processor. The usage of motivates the development of new
multicore systems is significantly improved architecture that are timing
increasing for embedded systems this predictable and it’s runtime environments
includes safety critical systems like are targeting for mixed critical
military, Automobiles, medical, avionics. applications. Response time analysis of the
Deploying applications having diff erent mixed critical system is carried out by S.K.
critical levels in the same embedded Baruah, A. Burns and R.I. Davis in [7].
system requires proper isolation among
those tasks. This kind of conditions creates Certification requirement is a major
mixed critical task scheduling problem. challenge for many of the safety critical
There are certain recently proposed embedded systems using tasks having
techniques and policies exist they employ multiple critical levels. In many cases only
mechanisms in runtime to monitor few of the system functionality are safety
execution of the tasks, identify exceptional critical and hence require certification. The
conditions or events like overrunning of rest of the functions are they do not require
any certification or they are very less

HBRP Publication Page 1-11 2022. All Rights Reserved Page 5


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

critical in nature. The runtime monitoring architectures, which is having many units
is very challenging and scheduling of processing on a unique chip, has raised
analysis of such systems of such systems is the interest in solving many problems for
very complex in mixed criticality systems. developing such systems. As a result of
The paper contains novel implementation this, task scheduling technique for multi
technique for fixed priority scheduling of core and many core architectures now a
multi criticality systems on uniprocessors. days have obtained a huge amount of
The proposed scheme monitors the jobs attention. In past decade there are many
during run-time. An optimal scheme for scheduling techniques have been
task priority assignment is developed and developed. Many cases have received only
sufficient amount of response time analysis 50 % of least upper bound in the system
is also derived. The proposed novel idea is utilization, this is very pessimistic.
dominate all previously implemented Investigation of schedulability of the
schemes. Benefits of the proposed scheme real-time tasks on this multi core and many
is also evaluated. There are three kind of core systems, Theoretical schedulability
priority assignment techniques as shown tests can be used. However, task sets with
below good system utilization bound, one of the
 Partitioning the criticality (PC), it is best alternative method is exhaustive
most commonly used scheme also simulation of the system. RealtssMP is
called as criticality monotonic priority also one of the simulation tool among few
assignment scheme. Here task having tools to conduct such simulations of
higher criticality will be assigned a scheduling algorithms and also perform
higher priority. schedulability analysis. Simulation tools is
 Static mixed criticality (SMC), all also proved to be beneficial in the
jobs of a task can execute only up to evolution of the algorithms in terms of its
its bounded execution time but it performance and developing new
cannot execute further any more time. scheduling techniques or algorithms. This
Tn such cases they are aborted and kind of tools also used as an educational
scheduled again when it is safe to tools for academic purpose. Alejandro
execute. Here priorities of the jobs Alonso, Emilio Salazar, and Miguel A. de
cannot change once assigned. Miguel identified tool set for developing
 Adaptive mixed criticality (AMC), the mixed critical partitioned system in.
proposed priority assignment Virtualized mixed-criticality multicore
technique is used in adaptive mixed systems exhibit new challenges for its
criticality. Run time monitoring of the development and it is becoming active
tasks and switching its priority levels research now a days. There is an added
enhances its performance compared to complexity exist: Now it is required to find
static critical systems. unlike SMC exactly how to partition the tasks and
here job is not withdrawn from the assign those tasks to partitions. Here many
execution if it exceeds representative issues are discussed including application
execution time instead of that its criticality level, dependability and security
priority will be enhanced allowing it requirement and timing requirement etc.
to finish its execution The MultiPARATES tool depends on
model driven engineering’s (MDE’s) that
According to Ramirez and Arnoldo since is more appropriate approach in this
from few couple of years Real-time settings, it supports or helps in bridging the
systems have been dependent on gap between partitioning and design
multiprocessor architectures. However, issues. How systems are developed now a
the significant improvement in multi core days can be changed by MDE.

HBRP Publication Page 1-11 2022. All Rights Reserved Page 6


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Generally, modeling technique have advantages and also presents possible


showing their benefits when adopted to problems. Toolset Architecture the major
embedded systems. These kind of components of the toolset and flow of data
advantages can be achieved by reusing is shown in Figure 4 System modeling: It
with intensively abstracting or generating is the main input tool of a system. It is
all boiler plate codes automatically. comprised of 3 models for preparing the
Integrating so much functionality on a executing platform, the advantages and
single hardware to exploits its power of certain kind of restrictions to be used
processing hardware leads to many during partitioning.

Fig. 4: Overall tool set architecture.

Maxime Cherony, Anne-Marie and purpose. It is one of the limitations is. It


Pierre-Emmanuel Hladik [3] have never shows real-time task scheduling
enlightened issues about need of behavior in detail on a system, but enough
simulators for numerous modern task amount of good insights on possible
scheduling algorithms. consequences and tendencies can be
Modernhardwarearchitecturesaredesigned identified. In two level hierarchical
withdiff erentspecificationssuchascache scheduling algorithm (2LHiSA) [8] author
and memory access platforms. We need to has improved
design tools for studying those hardware. theruntimeperformanceandtotalsystemutili
zationusingEDFatbothtopleveland local
Using accurate simulators otherwise even levels. Lower runtime complexity in fixed
real-time platform having multiprocessors priority algorithms for job scheduling on
can be used to execute tasks. Here, it multi core processor architecture can be
requires scheduler to be developed in a C obtained using earliest deadline first
or Assembly language and incorporated it scheduling scheme. However, EDF also
into an operating system. This is lot of time not an optimal algorithm in multiprocessor
consuming, as well as various realistic architecture. The author introduced a novel
tasks need to be generated for evaluation migration based scheduling algorithm with
purpose in laboratory. It is also preferred certain restrictions for task migration on
to use Average simulator to accurately multiprocessor systems. The proposed
simulate the behavior of hardware and system divides the multiprocessor
software components of the system that scheduling problem into two levels of
influences on its performance. schedulers. It work in two phases.

This kind of simulators are useful in Partitioning a task in which task is


prototyping the system, it does not require statically assigned to a particular
real-time implementation of the operating processor, it cannot migrate to any other
system and its tasks. However, simulator processor during execution. Those task
allows for the extensively experimenting that cannot be assigned to any processor
with diff erent use cases. Or Diff erent kind due to bin-packing problem they are
of matrix can also be used for the analysis qualified for migration to any processor.

HBRP Publication Page 1-11 2022. All Rights Reserved Page 7


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Underutilizationofprocessorsisavoidedbyu level hierarchical scheduling it is based on


singadditionalprocessorgrouping phase, restriction in task migration. The
sum of the unused processor time from experimental evaluation is provided for
each group of processors is equal to theoretical scheduling analysis. THe
processing ability of one processor. Figure STORM simulator is used for performing
5 shows local level scheduler with no the experiments. Number of task
migrations. Figure 7 shows Global level preemptions and migrations have been
scheduler with full migration. Figure 8 reduced compared to Pfair and ASEDZL
shows two level scheduling with restricted algorithms.
migration. Figure 6 shows proposed two

Table 2.4: Various Multiprocessor task scheduling Algorithms and it’s challenge
Algorithm Mechanism used Features Challenges and limitations
EDF Uses dynamic Priority Assignment CPU utilization is full It is more difficult to implement
and deadline based scheduling
criteria
RM Uses static Priority Assignment and Simple to implement It does not work for multicore
period based scheduling criteria processors
LLF Uses dynamic Priority Assignment CPU utilization is full It is more difficult to implement
and Laxity based scheduling criteria. and efficient in all
conditions
U-EDF It uses vertical EDF (G-EDF) and It is optimal for task It will not work for sporadic
horizontal EDF with slight variation preemptions, migrations tasks because prior knowledge
in EDF have been reduced of the task arrival times is
required
Pfair Set of sub tasks have been created Optimal scheduling of It uses more assumptions, less
using a large task, Within the time periodic tasks on unicore practical.
interval they must execute all and multicore
subtasks. processors.
HLFEL First simple algorithm for statically Scheduling technique Communication time is
scheduling task graph, Priorities of used for parallel neglected.
task is decided by certain static level processing.
attributes.
ISH Same as HLFET but it uses idle Scheduling technique It will not consider all kinds of
times created by processors due to used for parallel static attributes.
partial scheduling. processing
MCP Task priorities are determined based It gives higher It will neglect communication
on as late as possible (ALAP’S) performance to tasks cost when computing task
attribute. which is having priorities.
minimum start time.
ETF Earliest start times of the task is Scheduling technique It will not minimize the duration
determined and particular task used for parallel of scheduling at each step
having smaller time to start is processing
selected. It is also uses static level
attributes.
DLS Priorities of tasks are determined Scheduling technique Scheduling list is not maintained
based on dynamic level attributes used for parallel during scheduling process.
instead of static level attributes. processing.

CNPT Criticality node (CN’s) is used as a Performance is greater It will not consider other
task priorities, works in two phases and complexity is less. dynamic and static attributes
Listing and processor assignment.
EDZL Zero laxity jobs are given the top More number of task It will not guarantee that
priority sets meet their deadline arbitrary deadline independent
sporadic tasks will be scheduled
successfully

HBRP Publication Page 1-11 2022. All Rights Reserved Page 8


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Fig. 5: Task scheduling with no migration.

Fig. 5: Proposed 2lHiSA.

Fig. 7: Task scheduling with full migration.

HBRP Publication Page 1-11 2022. All Rights Reserved Page 9


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

Fig. 8: Task scheduling with restricted migration.

CONCLUSION REFERENCES
The advent of multi-core architecture rises 1. Chen, S., Mulgrew, B., & Grant, P. M.
many challenges, issues and opportunities. (1993). A clustering technique for
Multicores have significantly increased digital communications channel
performance of embedded real-time equalization using radial basis function
systems and high performance systems. networks. IEEE Transactions on
neural networks, 4(4), 570-590.
It has also created a greater impact in the 2. Duncombe, J. U. (1959). Infrared
way of software development from navigation—Part I: An assessment of
application software’s to operating system feasibility. IEEE Trans. Electron
kernels. An increasing number of high Devices, 11(1), 34-39.
performance systems are programmed 3. Lin, C. Y., Wu, M., Bloom, J. A., Cox,
using modern programming languages due I. J., Miller, M. L., & Lui, Y. M. (2000,
to parallel programming revolution created May). Rotation-, scale-, and
by the multicores. translation-resilient public
watermarking for images. In Security
The cost reduction trends in modern and watermarking of multimedia
embedded systems induces functional contents II (Vol. 3971, pp. 90-98).
consolidation which results in SPIE.
development of mixed critical systems 4. Suhas, G. K., Devananda, S. N.,
(MCS). Two critical challenges are Jagadeesh, R., Pareek, P. K., & Dixit,
addressed in this research work are one is S. (2021). Recommendation-Based
overcoming the limitations of modern Interactivity Through Cross Platform
programming languages to support for Using Big Data. In Emerging
developing time sensitive applications in Technologies in Data Mining and
multicore systems. Information Security (pp. 651-659).
Springer, Singapore.
Another one is developing task scheduling 5. GK, M. S., Verma, V. K., Devananda,
strategy in multicore systems to decrease S. N., BR, C. R., Manchale, P., &
the runtime overhead as well as improving Pareek, P. K. An Exploration on
support for mixed critical systems. Recommendation Based Interactivity

HBRP Publication Page 1-11 2022. All Rights Reserved Page 10


Research and Applications: Embedded System
Volume 5 Issue 3
e-ISSN: 2582-2993
DOI: https://doi.org/10.5281/zenodo.7326272

through Multiple Platforms in Big 8. Hossain, M. D., Kabir, M. A., Anwar,


Data. A., & Islam, M. Z. (2021). Detecting
6. GK, D., SN, D., Pareek, P., & MS, N. autism spectrum disorder using
M. (2021, April). A Altmetrics machine learning techniques. Health
analysis in social media using Bigdata. Information Science and Systems, 9(1),
In Proceedings of the International 1-13.
Conference on Innovative Computing
& Communication (ICICC). Cite as:
7. NR, D., GK, S., & Kumar Pareek, D. Suhas G. K., & Charan K.V. (2022).
(2022). A Framework for Food Implementation of Task Scheduling
recognition and predicting its Algorithms of Multiprocessor and
Nutritional value through Convolution Mixed Critical Systems. Research and
neural network. Applications: Embedded System, 5(3),
1–11.
https://doi.org/10.5281/zenodo.7326272

HBRP Publication Page 1-11 2022. All Rights Reserved Page 11

You might also like