<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">31223</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.031223</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Energy-Efficient Scheduling Based on Task Migration Policy Using DPM for&#x00A0;Homogeneous MPSoCs</article-title>
<alt-title alt-title-type="left-running-head">Energy-Efficient Scheduling Based on Task Migration Policy Using DPM for Homogeneous MPSoCs</alt-title>
<alt-title alt-title-type="right-running-head">Energy-Efficient Scheduling Based on Task Migration Policy Using DPM for Homogeneous MPSoCs</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Khan</surname><given-names>Hamayun</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>hamayun.khan@superior.edu.pk</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Ud din</surname><given-names>Irfan</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Ali</surname><given-names>Arshad</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alshmrany</surname><given-names>Sami</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electrical Engineering, Faculty of Engineering &#x0026; Technology Superior University Lahore</institution>, <addr-line>54000</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, Faculty of Computer Science &#x0026; IT Superior University Lahore</institution>, <addr-line>54000</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>Faculty of Computer and Information Systems, Islamic University of Madinah</institution>, <addr-line>Al Madinah Al Munawarah, 42351</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Hamayun Khan. Email: <email>hamayun.khan@superior.edu.pk</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-16"><day>16</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>74</volume>
<issue>1</issue>
<fpage>965</fpage>
<lpage>981</lpage>
<history>
<date date-type="received"><day>12</day><month>4</month><year>2022</year></date>
<date date-type="accepted"><day>22</day><month>6</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Khan et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Khan et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_31223.pdf"></self-uri>
<abstract>
<p>Increasing the life span and efficiency of Multiprocessor System on Chip (MPSoC) by reducing power and energy utilization has become a critical chip design challenge for multiprocessor systems. With the advancement of technology, the performance management of central processing unit (CPU) is changing. Power densities and thermal effects are quickly increasing in multi-core embedded technologies due to shrinking of chip size. When energy consumption reaches a threshold that creates a delay in complementary metal oxide semiconductor (CMOS) circuits and reduces the speed by 10&#x0025;&#x2013;15&#x0025; because excessive on-chip temperature shortens the chip&#x2019;s life cycle. In this paper, we address the scheduling &#x0026; energy utilization problem by introducing and evaluating an optimal energy-aware earliest deadline first scheduling (EA-EDF) based technique for multiprocessor environments with task migration that enhances the performance and efficiency in multiprocessor system-on-chip while lowering energy and power consumption. The selection of core and migration of tasks prevents the system from reaching its maximum energy utilization while effectively using the dynamic power management (DPM) policy. Increase in the execution of tasks the temperature and utilization factor <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> on-chip increases that dissipate more power. The proposed approach migrates such tasks to the core that produces less heat and consumes less power by distributing the load on other cores to lower the temperature and optimizes the duration of idle and sleep times across multiple CPUs. The performance of the EA-EDF algorithm was evaluated by an extensive set of experiments, where excellent results were reported when compared to other current techniques, the efficacy of the proposed methodology reduces the power and energy consumption by 4.3&#x0025;&#x2013;4.7&#x0025; on a utilization of 6&#x0025;, 36&#x0025; &#x0026; 46&#x0025; at 520 &#x0026; 624 MHz operating frequency when particularly in comparison to other energy-aware methods for MPSoCs. Tasks are running and accurately scheduled to make an energy-efficient processor by controlling and managing the thermal effects on-chip and optimizing the energy consumption of MPSoCs.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Dynamic power management</kwd>
<kwd>dynamic voltage &#x0026; frequency scaling</kwd>
<kwd>dynamic thermal management</kwd>
<kwd>multiprocessor system on chip</kwd>
<kwd>complementary metal oxide semiconductor reliability</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>The dissipation of energy becomes the captious design constraint of system-on-chip (SoCs) over the past decade as it limits the performance, reliability and battery life. Due to advancements in computational embedded devices and increasing multi-task execution than ever before [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
<p>MPSoC is widely deployed in high-performance computing and application-specific embedded systems such as gaming and aerospace-based systems for real-time response. It contains high-performance ARM Cortex-A7, ARM Cortex-A15 and an energy-efficient INTEL PXA-270 processor [<xref ref-type="bibr" rid="ref-2">2</xref>]. Introduced a technique that reduces resistance and energy because lack of concentration can affect the reliability and life span of the chip as well as overall systems performance [<xref ref-type="bibr" rid="ref-3">3</xref>]. Due to the high processing of tasks temperature on the chip increases. Various mechanisms are used to reduce the thermal effects due to high heat and decrease the performance of the system because high heat causes the chip to be damaged. A central processing unit is working as the main processing unit for performing the instructions read and write operation. CPU unit is placed in all the modern embedded systems [<xref ref-type="bibr" rid="ref-4">4</xref>]. The processing unit needs to be updated with time if the processing unit has a higher processing speed it can execute and manage intense tasks efficiently at short intervals of time. Advancement in the processing unit makes our system run heavy tasks but it can have some issues e.g., Dimension, cost, energy, power utilization, performance, reliability and processing speed. Switching of the task is the major issue with the evolvement of the processor [<xref ref-type="bibr" rid="ref-5">5</xref>]. DPM mainly deals with the development of policies that analyze the run time behavior of the system to reduce the power consumption of the MPSoC system [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>Introduced simulated annealing based (<inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mrow><mml:mtext>LPPWU</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>Sa</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>) optimization strategies for reducing the energy and solving the system-level low power design problems [<xref ref-type="bibr" rid="ref-7">7</xref>]. Proposed a dynamic thermal management (DTM) based energy optimization technique for the MPSoC platform with dynamic voltage and frequency scaling (DVFS) enabled homogeneous processors. These are one of the most reliable techniques to reduce and stabilize the temperature of the multi-core system. In a multi-core system, an exponential decrease in the temperature also reduces the power utilization [<xref ref-type="bibr" rid="ref-8">8</xref>]. Introduced homogeneous multiprocessing often known as symmetric multiprocessing (SMP) is a common type of multiprocessing in computer systems, in which two or more identical processors share a single main memory for process execution [<xref ref-type="bibr" rid="ref-9">9</xref>]. Introduced dynamic thermal management (DTM) based technique that efficiently manages the thermal responses of a processing system. Many techniques are combined to manage temperature and thermal responses including DVFS, DPM and Dynamic voltage scaling (DVS). These techniques are very useful but they cause some reliability and performance issues. They are mostly used to resolve on-chip power dissipation problems [<xref ref-type="bibr" rid="ref-10">10</xref>]. Modern MPSoCs are based on CMOS chips. The switching frequency regulates how often the switches occur. Double-edge-triggered flip-flops can be utilized to minimize dynamic power for MPSOC technology. An embedded device&#x2019;s power consumption is categorized as <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">dynamic</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">static</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> [<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>The accumulative power of a CPU is the &#x2211; of the <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">dynamic</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> because of switching and the <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">static</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> occurs due to leakage of power. The primary factor in CMOS circuits is dynamic power dissipation that occurs because of transistor switching. <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">dynamic</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> can be calculated using <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">dynamic</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>f</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>f</mml:mi></mml:math></disp-formula></p>
<p>Load capacitance is denoted as <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the number of circuit transitions while supplied voltage is denoted as <italic>V</italic> which is equivalent to switching voltage. <italic>f</italic> is the clock frequency while <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the threshold voltage. <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>R</mml:mi></mml:math></inline-formula> is a constant and reduction in supply voltage is represented as <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as shown in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>. <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the total number of logic gates in the CMOS circuit. The total power of the CMOS circuit is represented in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">total</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:msup><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>3.</mml:mn></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Most of the embedded computing circuits aim to give maximum performance while using minimum power. In static power, the dissipation of power occurs when the circuit is not changing states due to leakage current. The short circuit power is utilized when both positive channel metal-oxide-semiconductor (PMOS) and negative channel metal-oxide-semiconductor (NMOS) have switched ON for a short period unless the path between supply voltage is directed with the ground [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
</sec>
<sec id="s2"><label>2</label><title>Literature Review</title>
<p>A decrease in the chip size of a multi-core processor certainly increases the number of transistors on a chip more rapidly than before. The chip can require more energy due to which a gradual increase in power density is observed that affects the reliability of a multi-core processor [<xref ref-type="bibr" rid="ref-13">13</xref>]. Scheduling and task allocation techniques are facing issues during the migration of tasks to balance and manage power on multiprocessor systems. <xref ref-type="table" rid="table-1">Tab. 1</xref> represents the comparison of various online and offline DPM-based scheduling techniques [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Summary of offline &#x0026; online DPM approaches</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Algorithm</th>
<th align="left">Speed set</th>
<th align="left">Periodicity</th>
<th align="left">Scheduler</th>
<th align="left">Dynamic slack</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">HSCTB1</td>
<td align="left">Continuous</td>
<td align="left">A-periodic</td>
<td align="left">Offline EDF</td>
<td align="left">No</td>
</tr>
<tr>
<td align="left">HSCTB2</td>
<td align="left">Discrete</td>
<td align="left">A-periodic</td>
<td align="left">Offline EDF/FP</td>
<td align="left">Implicit</td>
</tr>
<tr>
<td align="left">LC-EDF</td>
<td align="left">Discrete</td>
<td align="left">Periodic</td>
<td align="left">Online EDF</td>
<td align="left">Implicit</td>
</tr>
<tr>
<td align="left">Energy Saving-RHS</td>
<td align="left">Continuous</td>
<td align="left">Periodic</td>
<td align="left">Offline Rate Monotonic</td>
<td align="left">Implicit</td>
</tr>
<tr>
<td align="left">ERTH</td>
<td align="left">Discrete</td>
<td align="left">Sporadic</td>
<td align="left">Online EDF</td>
<td align="left">Explicit</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows that higher power consumption can increases higher temperature and higher resistance eventually causing lower possible speed and hotspots that cause the permanent failure of the device [<xref ref-type="bibr" rid="ref-15">15</xref>].</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>High utilization effects on system on chip (SOC)</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-1.png"/></fig>
<p>Introduced a technique that increases the life span of the chip by reducing the consumption of power in multiprocessors-based systems. DPM-based technique affects the performance of the processor by suddenly switching the system from idle to running state. An efficient dynamic power management policy keeps both the reliability and performance while considering power degradation within allowed limits. Designs of these policies are considered to be an active and burning research topic in the field of MPSoC while designing embedded systems few challenges occur such as size, cost, power consumption and reliability [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<sec id="s2_1"><label>2.1</label><title>Dynamic Power Management</title>
<p>DPM technique selectively turns off all those components that are not in use. DPM is used in several portable systems but its applications are not yet explored because of the complexity of interfacing heterogeneous components. The fundamental problem in the implementation of DPM techniques is the non-uniform workload during the execution of the task. To solve this problem DPM uses a predictive algorithm that predicts the future workload by using different predictive models. It covers several system-level DPM approaches to save energy. DTM technique is used to find an optimal solution to avoid peak temperature which causes hotspots on chips [<xref ref-type="bibr" rid="ref-17">17</xref>]. Energy is not directly affected by temperature but when temperature increases from the threshold value some cooling mechanism is required to reduce the temperature of the system. Cooling mechanisms consume energy to reduce the temperature [<xref ref-type="bibr" rid="ref-18">18</xref>]. In a single-core processor if we increase the frequency by 50&#x0025; that roughly increases the power consumption two times while in dual-core systems power consumption increases by 30&#x0025; if we increase the supply voltage by keeping the frequency constant. Due to this power increases more rapidly because power is directly proportional to the square of supply voltage [<xref ref-type="bibr" rid="ref-19">19</xref>]. DPM allows MPSoCs to minimize power and energy consumption by optimizing the dynamic power. We can reduce the frequency which saves a considerable amount of power but causes performance degradation in the multiprocessor. In the same way, as the supply voltage decreases the dynamic power is reduced almost four times but it has an overhead by reducing the supply voltage. An increase in circuit delay occurs so the circuit cannot operate at the same frequency. If we decrease the supply voltage and frequency the dynamic power decreases cubically but an increase in the execution period occurs linearly that degrading the performance of the chip [<xref ref-type="bibr" rid="ref-20">20</xref>].</p>
<p>DPM is a design technology that reconfigures the whole computing system dynamically in such a way that requested services can be provided with the minimum number of active CPUs with suitable performance levels [<xref ref-type="bibr" rid="ref-21">21</xref>]. Proposed a dynamic voltage and frequency scaling technique that is used to improve the performance and consider the load balancing issue in multi-cores of a processor. DVFS technique dynamically set the workload on the cores for this an irregular parallel divide and conquer algorithm is used to equally share the workload that reducing 31&#x0025; of energy consumption at 400&#x2005;MHz&#x00A0;[<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<p>When task execution is interrupted in modern CPUs during the transition to a low-power state each low-power state <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:math></inline-formula> is defined by its power consumption <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> while the time and resource requirements of entering or leaving that state are represented as <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>s</mml:mi></mml:math></inline-formula> taking the sum of both the transition overheads of initial and final is necessary to get the total energy overhead that is linked with low-power state <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:math></inline-formula> namely <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for comparison. Power usage is lower but the time and energy overhead are higher in the transition state to move the MPSoC into the low-power state as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. Where <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mspace width="thickmathspace" /><mml:mi>P</mml:mi></mml:math></inline-formula> is the processor&#x2019;s power usage in its normal condition when no jobs are running while <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is a specific idle state with a low transition overhead occurs. If the CPU is kept active throughout the idle interval the power consumption will be considered at the lowest speed. Various parameters define different low-power states. The two alternative state transitions represent a low-power state <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:math></inline-formula> with moderate power usage and a rapid breakeven time while on other hand the low-power state <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:math></inline-formula> reduces the power usage. The transition of state in low power mode occurs for short period due to the involvement of time and energy overheads [<xref ref-type="bibr" rid="ref-23">23</xref>]. Processors can achieve an active state rapidly when the transition&#x2019;s energy overhead is minimal in such conditions the power state is known as the power-saving state.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>T</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mi>x</mml:mi><mml:mfrac><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Two low-power states of an MPSoC</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-2.png"/></fig>
<p><xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> represents the parameter <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> known as the break-even time. <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> refers to the minimum length of idle interval that must be provided to schedule and utilizes the sleep state <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>&#x03B4;</mml:mi><mml:mi>x</mml:mi></mml:math></inline-formula> efficiently. <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the sum of the total time required to complete the state transition and the duration of idle time that is required to find a way to reduce the shifting energy [<xref ref-type="bibr" rid="ref-24">24</xref>]. The below <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> determines the <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">sleep</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> break-even time.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">sleep</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mfrac><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">sleep</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">sleep</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The short circuit power is utilized when both PMOS and NMOS are on for a short period. <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> represents the transition of the state <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and its power dissipation in running and the idle state as <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub></mml:math></inline-formula> [<xref ref-type="bibr" rid="ref-25">25</xref>].
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref> (<inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) breakeven time measures the length of the idle state of the CPU to optimize power.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>DPM analyzes the run time behavior of the system to reduce the power consumption of the MPSoC. During the running state of an application a selective shut-down of the system components occur that are in the idle state increases the performance. When the CPU starts to transition the energy required for the state transition from sleep to idle and from idle to running is represented as <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and its power dissipation at state 1 is denoted as <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and at state 2 its <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub></mml:math></inline-formula>. For highperformance delay due to the state transition must be less than <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as shown in <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrates the behavior of MPSoC. On the left side, the MPSoC is running while on the other hand the device is in an idle state. The energy consumption on both ends is equal because of the break-even time in DPM-based techniques [<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Task mapping in the system on chip working/idle state</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-3.png"/></fig>
<p>Proposed an accuracy measurement model based on scheduling for medical imaging using a high-quality multiprocessor CPU and general processing unit (GPU) based computing environment to speed up the simulation rate and enhance the real-time performance [<xref ref-type="bibr" rid="ref-27">27</xref>]. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> illustrates the optimization of power using the DPM technique that shows if the workload is not uniform on a system therefore the idle component of the system is considered [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Optimization of power with DPM</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-4.png"/></fig>
</sec>
<sec id="s2_2"><label>2.2</label><title>Predictive Techniques</title>
<p>A technique that measures the length of the next idle period of the processor using a simulation tool for real-time multiprocessor (STORM). The decision can be quickly made when the processor is in sleep mode and this policy doesn&#x2019;t predict the length greater or less than the break-even period (<inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). Introduced an exponential average scheme that predicts the next idle period length by considering an exponential average of the actual lengths of the previous idle period and the predicted one as shown in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:math></disp-formula></p>
<p>The new predicted values are represented as <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>ln</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> and the last predicted value is denoted as <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>ln</mml:mi></mml:math></inline-formula>. Where <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>ln</mml:mi></mml:math></inline-formula> is the latest idle period while <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>b</mml:mi></mml:math></inline-formula>&#x2019; is considered as an attenuation constant ranging between 0 to 1 [<xref ref-type="bibr" rid="ref-29">29</xref>]. The hardware architecture of Marvel X-Scale Intel PXA-270 MPSoC is widely used for predictive offline DPM techniques for both homogeneous and heterogeneous processors using STORM [<xref ref-type="bibr" rid="ref-30">30</xref>].</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Problem Definition</title>
<p>The most critical concerns in multi-core embedded systems are the performance and life span of the chip. The task scheduling and switching of jobs from one core to another are one of the major issues in today&#x2019;s MPSoC. Increasing power dissipation and energy utilization increases on chip temperature and resistance which reduces the life span of the chip. It also affects the reliability (hotspots, thermal cycles) as well as lowers the maximum speed for all battery powered devices, particularly in embedded systems that cause multiple performance and reliability issues. The key design difficulty in a task migrationbased system is an accurate forecast of energy, power, coolest core, utilization factor and the workload that needs to be relocated on an individual CPU. In multiprocessor systems task switching across various cores is a prevalent problem. Because the destination core may be in sleep mode there may be a delay while moving tasks from one core to another. Task migration is a technique for reducing power and energy while improving performance.</p>
<p>Power and energy optimization on multi-core systems are developed to address MPSoC dissipation concerns. The influence of tasks may be recognized when looking for the best solution task factors can be examined as tasks have an impact on each other. An energy-efficient task migration policy based on an EDF algorithm that optimizes energy while considering different configurations for migration of load is proposed in this research work. Normally, task schedules on each core are independent.</p>
<p><bold>Problem 1:</bold> <italic>Energy-Efficient Multiprocessor Scheduling Technique (EEMS)</italic>.</p>
<p>Consider a system having a periodic task set <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>&#x03C4;</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> over <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">identical</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> processors where many tasks in <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> have a common deadline <italic>D</italic> and are ready at time 0. Each task &#x03C4;i &#x2208; <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> is linked with CPU requirement that is approximately equal to power consumption function <italic>Pi(s)</italic> and CPU-cycles <italic>ci</italic> at the given CPU speed. The objective is to reduce the total energy consumption, of the CPU by scheduling for &#x03C4;i &#x2208; <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> over <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">identical</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> to complete before the deadline by allowing the suitable task migration among processors and core switching technique.</p>
<sec id="s3_1"><label>3.1</label><title>Proposed Energy-Efficient Multiprocessor Scheduling Algorithm with Task Migration</title>
<p>In this section, we have proposed EA-EDF an optimal algorithm for the <italic>EEMS</italic> problem. Since the power consumption <italic>Pi(s)/s</italic> is increasing at each cycle for every task &#x03C4;i &#x2208; <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> in a given periodic task set, the CPU executes each task &#x03C4;i &#x2208; task set <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> at some speed <italic>s.</italic> For this we have proposed EA-EDF an energy-efficient earliest deadline first scheduling algorithm based on the DPM technique for task migration policy and a guarantee on the energy consumption for MPSoC by monitoring the utilization factor. An energy-efficient policy for various configurations of cores to predict the power and energy profiles using both hardware &#x0026; software architecture of the Intel PXA-270 MPSoC. Scheduling technique based on task migration reduces energy and produces energy-efficient results according to the utilization factor (<inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). The proposed model uses an EA-EDF scheduler for energy and power optimization and is independently demonstrated to be the best-performing technique at run time.</p>
<p>The suggested policy operates with a set of parameters and generates effective outcomes for the given workload while also optimizing the chip&#x2019;s lifespan and improving QoS by lowering energy consumption. The task set generator provides randomized task sets under a ready task queue that are being used to generate workloads under various constraints as well as the number of CPU cores specified by the user in extensible markup language (XML) based on the application given to STORM as an input. EA-EDF the scheduler can also have a set of prepared tasks that are scheduled according to the scheduling policy by considering suitable migration of task policy that produces energy and power profiles on the individual cores according to the given set of parameters in XML. A periodic task set <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>&#x03C4;</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and a utilization factor that is non-increasing <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub><mml:mrow><mml:mtext>for all </mml:mtext></mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext> where </mml:mtext></mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:msub><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mstyle><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, consider <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width="thickmathspace" /><mml:mrow><mml:mtext>for</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext>n </mml:mtext></mml:mrow></mml:math></inline-formula> Let <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msup><mml:mrow><mml:mi mathvariant="normal">&#x03D5;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is a set of CPU with <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>&#x03C4;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x0026;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>m</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> &#x0026; <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, capacities <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>for</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> can be scheduled on the uniform MPSoC that meets all the deadlines <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mrow><mml:mtext>&#x00A0;where&#x00A0;</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>&#x00A0;for&#x00A0;all&#x00A0;</mml:mtext></mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow><mml:mo>;</mml:mo></mml:math></inline-formula> Overall utilization factor: <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:msub><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mstyle><mml:mspace width="thickmathspace" /><mml:mrow><mml:mtext>for</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <italic>n</italic> periodic task <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mspace width="thickmathspace" /><mml:mi>&#x03C4;</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> scheduled on a CPU the total <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is defined as <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mrow><mml:mtext>u</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:math></inline-formula> &#x2264; 1; <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mrow><mml:mtext>for</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:math></inline-formula> a set of <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:mrow><mml:mtext>&#x00A0;for</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi></mml:math></inline-formula> <italic>n</italic> periodic task <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> with random deadlines scheduled on a CPU, <italic>Load (</italic><inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula><italic>) &#x003D; max</italic> &#x007B;<inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mrow><mml:mtext>U</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> &#x007D;, <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref> is used to measure the densities of MPSoCs as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>For the elaboration of the power and energy model <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref> elaborates the sub-threshold leakage (<inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) that contains reverse bias junction current (<inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>).
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">leakage</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>Dynamic energy per cycle is represented as <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>y</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as shown below in <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>y</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:mi>f</mml:mi></mml:math></disp-formula></p>
<p>The total consumption of power is due to static and dynamic power that is used to represent the energy consumption of MPSoC cores. Static power is consumed while the CPU is on, whereas dynamic power is spent during calculation periods as shown in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>.
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:munderover><mml:mrow><mml:mo>&#x222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Cycle</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The leakage energy per cycle is elaborated in <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>. The delay per cycle is denoted as <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> and the required energy for running state per cycle is <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">running</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2217;</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> enhances when the frequency is low. <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref> represents the total energy consumption per cycle that is represented as:
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">total</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi>P</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Cycle</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">dynamic</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Cycle</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The proposed scheduling algorithm works for all real-time jobs in a running state using the system model represented in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> allowing all new tasks in the ready state to go to the scheduling phase and execute on time. When compared to the prior strategies utilized in the earliest deadline first algorithm the scheduling methodology improves the chip&#x2019;s overall working performance. When the tasks are ready to run the proposed scheduler verifies that the tasks are compatible with the scheduler and map them to cores based on the utilization factor (<inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). In the proposed system model dynamic fixed priorities are assigned to the entire <italic>n</italic> periodic task <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> with deadline <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>System model</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-5.png"/></fig>
</sec>
<sec id="s3_2"><label>3.2</label><title>Core Configurations for EEMST</title>
<p>Scheduling and switching of <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> jobs on various cores configurations are based on the utilization factor (<inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). The amount of tasks in the running state requires a suitable task migration policy that defines the criteria for scheduling of <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mrow><mml:mtext mathvariant="italic">ready</mml:mtext></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> on the core. When tasks are running the <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula> remains constant but as the number of tasks increases due to the concurrent processing of tasks on the multi-core processor&#x2019;<inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula> rapidly increases. For reducing the energy and power consumption optimal energy-efficient core configurations are defined for proper core switching and load balancing using task migration based on this policy. Various core configurations according to the <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula> utilization factors are mentioned below:
<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mrow><mml:mi mathvariant="bold">F</mml:mi><mml:mi mathvariant="bold">o</mml:mi><mml:mi mathvariant="bold">r</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x2265;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>9</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>9.1</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>18</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 7&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>1 Core configuration &#x007B;<italic>(1,), (2,),(3), (4),(5),(6),(7),(8)&#x007D;</italic></p>
<p><inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mn>18.1</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>27</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 14&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>2 Core configuration <italic>&#x007B;(1, 3),(4, 7),(2, 5), (6, 8)&#x007D;</italic></p>
<p><inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>27.1</mml:mn><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>36</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 24&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>3 Core configuration <italic>&#x007B;(1, 3, 5), (4, 7, 8), (1, 2, 6)&#x007D;</italic></p>
<p><inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>36.1</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>45</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 31&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>4 Core configuration <italic>&#x007B;(1, 3, 57),(2, 4, 6, 8)&#x007D;</italic></p>
<p><inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>45.1</mml:mn><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>54</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 40&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>5 Core configuration &#x007B;(<italic>1, 2, 3, 7, 8),(1, 2, 4, 5, 6)&#x007D;</italic></p>
<p><inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mn>54.1</mml:mn><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>62.5</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 47&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>6 Core configuration <italic>&#x007B;(1, 2, 3, 7, 8), (1, 2, 4, 5, 6)&#x007D;</italic></p>
<p><inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mn>54.1</mml:mn><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mn>62.5</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula>&#x003D; 67&#x0025;, <italic>P&#x2009;&#x003D;&#x2009;</italic>7 Core configuration <italic>&#x007B;(1, 2, 3, 5, 7, 8), (1, 2, 4, 5, 6, 8)&#x007D;</italic></p>
<p><inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mrow><mml:mi mathvariant="bold">F</mml:mi><mml:mi mathvariant="bold">o</mml:mi><mml:mi mathvariant="bold">r</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>62.6</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></inline-formula> <italic>P&#x2009;</italic> &#x003D;&#x2009;8 Core configuration <italic>&#x007B;(1, 2, 3, 4, 5, 6, 7 and 8)&#x007D;</italic>
</p>
<fig id="fig-9">
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-9.png"/>
</fig>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Simulation and Results</title>
<p>A simulation tool for real-time multiprocessor (STORM) is used to perform the experimental valuation on a homogeneous multiprocessor system and illustrate the importance due to advancements in semiconductor technology that increases the power density of a multiprocessor with the increase in demand of real-time applications based on a complex circuitry. STORM receives ready tasks from the XML input file as shown in the system model and schedules it on the hardware architecture of Marvel X-Scale Intel PXA-270 MPSoC by considering the suitable core configuration with DPM capabilities. Core configurations are chosen based on the utilization factor whereas the power model for all cores is the same.</p>
<p>Intel PXA-270 processor&#x2019;s power model is used for each core in the test scenarios because the Intel-PXA270 offers seven power states. We tested the behavior of our proposed method by running all tasks <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> till the arrival of the worst-case execution time (WCET). For this we created a task set and stored the data in an XML input file. The task set&#x2019;s size ranges from 5 to14 tasks with each task&#x2019;s period falling within [0.15&#x2005;ms, 14&#x2005;ms] as indicated. We executed the task set mentioned in <xref ref-type="table" rid="table-2">Tab. 2</xref> on the Intel-PXA270 MPSoC processing platforms. The XML input contains, starts time, WCET, period, priority, deadline, hardware architecture, number of cores and proposed EAEDF scheduling mechanism. The proposed scheduling algorithm using task migration ability is implemented on homogeneous multi-core architecture that has more than one core and shares the same architecture and microarchitecture integrated on a single chip.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Task set n&#x2009;&#x003D;&#x2009;14</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Tasks <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:mo stretchy="false">&#x2192;</mml:mo></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>4</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>5</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>6</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>7</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>8</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mn>9</mml:mn></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mrow><mml:mn>14</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Period</td>
<td align="left">0.15</td>
<td align="left">9</td>
<td align="left">6</td>
<td align="left">10</td>
<td align="left">9</td>
<td align="left">6</td>
<td align="left">8</td>
<td align="left">10</td>
<td align="left">7</td>
<td align="left">10</td>
<td align="left">12</td>
<td align="left">13</td>
<td align="left">14</td>
<td align="left">14</td>
</tr>
<tr>
<td align="left">Deadline</td>
<td align="left">10</td>
<td align="left">9</td>
<td align="left">6</td>
<td align="left">8</td>
<td align="left">9</td>
<td align="left">8</td>
<td align="left">6</td>
<td align="left">7</td>
<td align="left">6</td>
<td align="left">7</td>
<td align="left">10</td>
<td align="left">5</td>
<td align="left">11</td>
<td align="left">11</td>
</tr>
<tr>
<td align="left">WCET</td>
<td align="left">5</td>
<td align="left">3</td>
<td align="left">2</td>
<td align="left">6</td>
<td align="left">5</td>
<td align="left">4</td>
<td align="left">5</td>
<td align="left">4</td>
<td align="left">5</td>
<td align="left">4</td>
<td align="left">5</td>
<td align="left">4</td>
<td align="left">4</td>
<td align="left">4</td>
</tr>
<tr>
<td align="left">Priority</td>
<td align="left">1</td>
<td align="left">2</td>
<td align="left">3</td>
<td align="left">4</td>
<td align="left">5</td>
<td align="left">4</td>
<td align="left">4</td>
<td align="left">3</td>
<td align="left">7</td>
<td align="left">3</td>
<td align="left">10</td>
<td align="left">11</td>
<td align="left">5</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">Activation</td>
<td align="left">0</td>
<td align="left">0</td>
<td align="left">0</td>
<td align="left">2</td>
<td align="left">3</td>
<td align="left">4</td>
<td align="left">2</td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">5</td>
<td align="left">6</td>
<td align="left">0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> represents various power consumption states of Intel PXA-270 over multiple operating frequencies respectively by considering various states of running, idle and sleep. It also represents the current of the Intel PXA-270 CPU on various frequencies. All hardware characteristics from the Intel-PXA270 processor are employed in our tests to achieve better performance and minimize delays in the execution process. The proposed EA-EDF migrates tasks to a core that is physically away from the core with the highest power consumption and temperature. This section presents the evaluation of our improved energy-efficient scheduling algorithm for the optimization of energy and power. The proposed energy aware-EDF-based scheduler gives improved results and more energy optimization as compared to previous techniques. The Intel PXA-270 MPSoC is used to measure CPU energy usage. According to the proposed algorithm the job with the earliest scheduling deadline is prioritized when the periodic task set is examined the strategy works well that&#x2019;s why the context switch is valuable.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Power consumption specification of Intel PXA-270 MPSoC at various frequencies</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Frequency</th>
<th align="left">Typical active power</th>
<th align="left">System bus</th>
<th align="left">Idle power</th>
<th align="left">Current</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">624&#x2005;MHz</td>
<td align="left">925&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">260&#x2005;mW</td>
<td align="left">770&#x2005;mA</td>
</tr>
<tr>
<td align="left">520&#x2005;MHz</td>
<td align="left">747&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">222&#x2005;mW</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left">416&#x2005;MHz</td>
<td align="left">570&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">186&#x2005;mW</td>
<td align="left">500&#x2005;mA</td>
</tr>
<tr>
<td align="left">312&#x2005;MHz</td>
<td align="left">390&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">154&#x2005;mW</td>
<td align="left">380&#x2005;mA</td>
</tr>
<tr>
<td align="left">312&#x2005;MHz</td>
<td align="left">375&#x2005;mW</td>
<td align="left">104&#x2005;MHz</td>
<td align="left">109&#x2005;mW</td>
<td align="left">260 Ma</td>
</tr>
<tr>
<td align="left">208&#x2005;MHz</td>
<td align="left">279&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">129&#x2005;mW</td>
<td align="left">150&#x2005;mA</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Considering the same experimental characteristics such as deadlines and consumption. The simulation indicates that the STORM simulator performance criteria are equivalent to the real platform values. <xref ref-type="table" rid="table-4">Tab. 4</xref> represents the comparison of experimental results of energy consumption on 520&#x2005;MHz at various <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> <italic>&#x003D;</italic> 6&#x0025;, 10&#x0025;, 20&#x0025;, 36&#x0025;, 55&#x0025;, 60&#x0025;, 62.5&#x0025; and <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2265; 63&#x0025; when all the cores are running.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>Energy consumption at different <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> on Intel PXA-270 MPSoC at 520&#x2005;MHz</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Utilization/Active CPU</th>
<th align="left">No of task</th>
<th align="left">Proposed EA-EDF</th>
<th align="left">Active power</th>
<th align="left">Idle power</th>
<th align="left">System bus<break/>frequency</th>
<th align="left">Current</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 6&#x0025;, 1P</td>
<td align="left">1</td>
<td align="left">0.47&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 10&#x0025;, 2P</td>
<td align="left">3</td>
<td align="left">0.85&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 20&#x0025;, 3P</td>
<td align="left">14</td>
<td align="left">1.02&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 36&#x0025;, 4P</td>
<td align="left">16</td>
<td align="left">2.31&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 55&#x0025;, 5P</td>
<td align="left">19</td>
<td align="left">3.05&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 60&#x0025;, 6P</td>
<td align="left">24</td>
<td align="left">3.89&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 62.5, 7P</td>
<td align="left">26</td>
<td align="left">4.20&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2265; 63&#x0025;, All P</td>
<td align="left">27</td>
<td align="left">4.10&#x2005;J</td>
<td align="left">747&#x2005;mW</td>
<td align="left">222&#x2005;mW</td>
<td align="left">208&#x2005;MHz</td>
<td align="left">630&#x2005;mA</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-5">Tabs. 5</xref> and <xref ref-type="table" rid="table-6">6</xref> represents the comparison of proposed EA-EDF at various workloads <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as compared to other currently used techniques on 520 and 624 MHz. The simulation results show that the proposed EA-EDF is more energy-efficient as compared to other techniques at lower utilization and gives 4.7&#x0025; &#x0026; 4.3&#x0025; more energy efficient results on 10&#x0025;, 27&#x0025; &#x0026; 36&#x0025; <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /></mml:math></inline-formula> as compared to GEDF, RT-DPM, TBP, PDTM on 520 &#x0026; 624&#x2005;MHz in terms of power &#x0026; energy. The Intel PXA-270 MPSoC is used to measure CPU energy usage. The proposed EA-EDF algorithm prioritized the job with the earliest scheduling deadline.</p>
<table-wrap id="table-5"><label>Table 5</label><caption><title>Energy consumption comparison of different schedulers at 520&#x2005;MHz</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Utilization</th>
<th align="left">No of<break/>task</th>
<th align="left">Proposed<break/>EA-EDF</th>
<th align="left">Energy<break/>GEDF</th>
<th align="left">Energy<break/>PDTM</th>
<th align="left">Energy<break/>Uniform<break/>RT-DPM</th>
<th align="left">Energy<break/>TBP</th>
<th align="left">Active<break/>power<break/>mW</th>
<th align="left">Idle<break/>power<break/>mW</th>
<th align="left">System<break/>bus<break/>MHz</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 6&#x0025;</td>
<td align="left">1</td>
<td align="left">0.57&#x2005;J</td>
<td align="left">2.41&#x2005;J</td>
<td align="left">0.66&#x2005;J</td>
<td align="left">2.51&#x2005;J</td>
<td align="left">2.88&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 10&#x0025;</td>
<td align="left">3</td>
<td align="left">0.75&#x2005;J</td>
<td align="left">3.81&#x2005;J</td>
<td align="left">3.97&#x2005;J</td>
<td align="left">4.87&#x2005;J</td>
<td align="left">3.02&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 20&#x0025;</td>
<td align="left">14</td>
<td align="left">1.02&#x2005;J</td>
<td align="left">5.73&#x2005;J</td>
<td align="left">5.41&#x2005;J</td>
<td align="left">5.21&#x2005;J</td>
<td align="left">4.77&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 36&#x0025;</td>
<td align="left">16</td>
<td align="left">2.31&#x2005;J</td>
<td align="left">6.12&#x2005;J</td>
<td align="left">6.89&#x2005;J</td>
<td align="left">6.79&#x2005;J</td>
<td align="left">6.22&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 55&#x0025;</td>
<td align="left">19</td>
<td align="left">3.05&#x2005;J</td>
<td align="left">6.72&#x2005;J</td>
<td align="left">5.2&#x2005;J</td>
<td align="left">7.88&#x2005;J</td>
<td align="left">7.13&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 60&#x0025;</td>
<td align="left">24</td>
<td align="left">3.89&#x2005;J</td>
<td align="left">7.23&#x2005;J</td>
<td align="left">7.44&#x2005;J</td>
<td align="left">9.21&#x2005;J</td>
<td align="left">7.72&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>62.5</mml:mn></mml:math></inline-formula></td>
<td align="left">26</td>
<td align="left">4.20&#x2005;J</td>
<td align="left">8.11&#x2005;J</td>
<td align="left">8.76&#x2005;J</td>
<td align="left">10.96&#x2005;J</td>
<td align="left">8.38&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2265; 63&#x0025;</td>
<td align="left">27</td>
<td align="left">8.10&#x2005;J</td>
<td align="left">8.34&#x2005;J</td>
<td align="left">9.38&#x2005;J</td>
<td align="left">11.12&#x2005;J</td>
<td align="left">9.43&#x2005;J</td>
<td align="left">747</td>
<td align="left">222</td>
<td align="left">208</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="table-6"><label>Table 6</label><caption><title>Energy consumption comparison of different schedulers at 624&#x2005;MHz</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Utilization factor</th>
<th align="left">No of task</th>
<th align="left">Proposed EA-EDF</th>
<th align="left">Energy<break/>GEDF</th>
<th align="left">Energy<break/>PDTM</th>
<th align="left">Energy<break/>uniform<break/>RT-DPM</th>
<th align="left">Energy<break/>TBP</th>
<th align="left">Active power<break/>mW</th>
<th align="left">Idle power<break/>mW</th>
<th align="left">System bus<break/>MHz</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>6</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">1</td>
<td align="left">0.57&#x2005;J</td>
<td align="left">1.41&#x2005;J</td>
<td align="left">0.88&#x2005;J</td>
<td align="left">0.66&#x2005;J</td>
<td align="left">0.51&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">3</td>
<td align="left">0.95&#x2005;J</td>
<td align="left">1.81&#x2005;J</td>
<td align="left">1.02&#x2005;J</td>
<td align="left">0.97&#x2005;J</td>
<td align="left">0.87&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>20</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">14</td>
<td align="left">1.12&#x2005;J</td>
<td align="left">2.73&#x2005;J</td>
<td align="left">1.77&#x2005;J</td>
<td align="left">1.41&#x2005;J</td>
<td align="left">3.21&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>36</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">16</td>
<td align="left">1.51&#x2005;J</td>
<td align="left">3.12&#x2005;J</td>
<td align="left">3.22&#x2005;J</td>
<td align="left">1.89&#x2005;J</td>
<td align="left">3.79&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>55</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">19</td>
<td align="left">3.13&#x2005;J</td>
<td align="left">6.12&#x2005;J</td>
<td align="left">4.13&#x2005;J</td>
<td align="left">3.12&#x2005;J</td>
<td align="left">3.88&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-166"><mml:math id="mml-ieqn-166"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>60</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">24</td>
<td align="left">4.09&#x2005;J</td>
<td align="left">7.23&#x2005;J</td>
<td align="left">5.32&#x2005;J</td>
<td align="left">4.44&#x2005;J</td>
<td align="left">4.21&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-167"><mml:math id="mml-ieqn-167"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>62.5</mml:mn></mml:math></inline-formula></td>
<td align="left">26</td>
<td align="left">4.50&#x2005;J</td>
<td align="left">8.11&#x2005;J</td>
<td align="left">6.38&#x2005;J</td>
<td align="left">5.76&#x2005;J</td>
<td align="left">4.96&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-168"><mml:math id="mml-ieqn-168"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>63</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula></td>
<td align="left">27</td>
<td align="left">4.60&#x2005;J</td>
<td align="left">8.34&#x2005;J</td>
<td align="left">7.43&#x2005;J</td>
<td align="left">7.38&#x2005;J</td>
<td align="left">5.12&#x2005;J</td>
<td align="left">925</td>
<td align="left">260</td>
<td align="left">208</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The comparison of energy consumption at various utilization factors <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> on 520&#x2005;MHz as shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref> illustrates the results of the proposed energy-aware EA-EDF scheduler that behaves similar to GEDF and PDTM <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msub><mml:mo>=&#x003E;</mml:mo><mml:mn>62.5</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, but optimizes 4.7&#x0025; of the overall energy at <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>62.5</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Comparison of energy consumption <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> at 520 MHz</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-6.png"/></fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> represents the power consumption on various cores of MPSoCs with the increasing number of tasks using EA-EDF at<inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>36</mml:mn></mml:math></inline-formula>. Only 4 cores <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x0026;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>4</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> are running by intelligently migrating and switching the load towards the low energy cores before <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> meeting the threshold. The features of the task set include the software architecture, start time and worst-case execution time, period, priority and deadline. While hardware architecture contains the no of cores and the proposed scheduling algorithm that is defined in the XML file for achieving the experimental results in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>CPU power consumption at various CPU cores under <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 36&#x0025; utilization at 520&#x2005;MHz</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-7.png"/></fig>
<fig id="fig-8"><label>Figure 8</label><caption><title>Comparison of energy consumption <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> at 624&#x2005;MHz</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-8a.png"/><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31223-fig-8b.png"/></fig>
<p>The comparison of energy utilization of EA-EDF at <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; 6&#x0025;, 10&#x0025;, 20&#x0025;, 36&#x0025;, 55&#x0025;, 60&#x0025;, 62.5&#x0025; and <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2265; 63&#x0025; when all the cores are in running state on 624&#x2005;MHz as shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The proposed energy-aware EA-EDF scheduler had an impact on the system performance and enhances the life span of the chip by optimizing the average energy of 4.7&#x0025; <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mrow><mml:mtext>u</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>36.5</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula> by giving smoother energy utilization patterns between individual cores for a set of periodic R-T tasks with a common deadline.</p>
</sec>
<sec id="s5"><label>5</label><title>Conclusions</title>
<p>This research paper targets energy-efficient multiprocessor scheduling problems over &#x03C4;i &#x2208; <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:mrow><mml:mi mathvariant="normal">&#x03C4;</mml:mi></mml:mrow></mml:math></inline-formula> over <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">identical</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> homogeneous processors for a set of periodic <italic>R-T</italic> tasks with a common deadline for energy optimization for this problem we have developed an accurate energy optimization-based task migration policy that will be used to calculate the load of the destination core. For the selection of cores, various configurations have been proposed in terms of energy efficiency and utilization factor that enables a processor to reduce power and energy consumption by adopting a suitable task migration policy. An increase in power utilization reduces the life span of the chip and has become an integral chip design issue for the battery-operated multiprocessor system. The proposed EA-EDF model is based on an optimal scheduling policy for accurate migration of tasks without missing their deadlines by considering the hardware architecture of Intel PXA-270 MPSoC in the STORM simulator. The objective is to increase the performance of the homogenous multi-core systems by gradually decreasing the thermal cycles, power and energy consumption. whereas Less number of running cores are combined in configuration. Proposed EA-EDF algorithm enables load balancing and allows processes to run on various cores at various times as decided by the scheduler using periodic task sets with implicit deadlines on homogeneous multiprocessor platforms. In future work, our algorithm can be used for heterogeneous multiprocessor platforms apart from this the proposed technique gives us more efficient results by optimizing 4.3&#x0025;&#x2013;4.7&#x0025; energy on a utilization of 6&#x0025;, 36&#x0025; &#x0026; 46&#x0025; at 520 &#x0026; 624 MHz operating frequency when compared to previously deployed GEDF, TLP, PDTM, RT-DPM TBP energy-based optimization techniques.</p>
</sec>
</body>
<back>
<ack>
<p>The researchers wish to extend their sincere gratitude to the Deanship of Scientific Research at the Islamic University of Madinah for the support provided to the Post-Publishing Program1.</p>
</ack>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Somdip</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Isuwa</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Saha</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Singh</surname></string-name> and <string-name><given-names>K. M.</given-names> <surname>Maier</surname></string-name></person-group>, &#x201C;<article-title>CPU-GPU-memory DVFS for power-efficient MPSoC in mobile cyber physical systems</article-title>,&#x201D; <source>Future Internet</source>, vol. <volume>14</volume>, no. <issue>3</issue>, pp. <fpage>91</fpage>&#x2013;<lpage>103</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. A.</given-names> <surname>prasath</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Alzubi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ramachandran</surname></string-name></person-group>, &#x201C;<article-title>A high performance scalable fuzzy based modified asymmetric heterogene multiprocessor system on vhip (AHt-MPSOC) reconfigurable architecture</article-title>,&#x201D; <source>Journal of Intelligent &#x0026; Fuzzy Systems</source>, vol. <volume>42</volume>, no. <issue>2</issue>, pp. <fpage>647</fpage>&#x2013;<lpage>658</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Zhong</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Janjic</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Petoumenos</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Zhai</surname></string-name></person-group>, &#x201C;<article-title>Collaborative heterogeneity-aware os scheduler for asymmetric multicore processors</article-title>,&#x201D; <source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. <volume>32</volume>, no. <issue>5</issue>, pp. <fpage>1224</fpage>&#x2013;<lpage>1237</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>S. X. D.</given-names> <surname>Tan</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Tang</surname></string-name></person-group>, &#x201C;<article-title>Leakage-aware predictive thermal management for multicore systems using echo state network</article-title>,&#x201D; <source>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</source>, vol. <volume>39</volume>, no. <issue>7</issue>, pp. <fpage>1400</fpage>&#x2013;<lpage>1413</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. Z.</given-names> <surname>Sheikh</surname></string-name> and <string-name><given-names>M. A.</given-names> <surname>Pasha</surname></string-name></person-group>, &#x201C;<article-title>A dynamic cache-partition schedulability analysis for partitioned scheduling on multicore real-time systems</article-title>,&#x201D; <source>IEEE Letters of the Computer Society</source>, vol. <volume>3</volume>, no. <issue>2</issue>, pp. <fpage>46</fpage>&#x2013;<lpage>49</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Shan</surname></string-name> and <string-name><given-names>O.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Accelerating concurrent priority scheduling using adaptive in-hardware task distribution in multicores</article-title>,&#x201D; <source>IEEE Computer Architecture Letters</source>, vol. <volume>20</volume>, no. <issue>1</issue>, pp. <fpage>17</fpage>&#x2013;<lpage>21</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Feliu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Sahuquillo</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Petit</surname></string-name></person-group>, &#x201C;<article-title>Thread isolation to improve symbiotic scheduling on smt multicore processors</article-title>,&#x201D; <source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. <volume>31</volume>, no. <issue>2</issue>, pp. <fpage>359</fpage>&#x2013;<lpage>373</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Fruehauf</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Munding</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Pressel</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Schwarz</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Vogt</surname></string-name></person-group>, &#x201C;<article-title>Chip-package-board reliability of system-in-package using laminate chip embedding technology based on cu leadframe</article-title>,&#x201D; <source>IEEE Transactions on Components Packaging and Manufacturing Technology</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>44</fpage>&#x2013;<lpage>56</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Alberto</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Renato</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Andre</surname></string-name></person-group>, &#x201C;<article-title>Power consumption analysis in static cmosgates</article-title>,&#x201D; in <conf-name>26th Symp. on Integrated Circuits and Systems Design (SBCCI)</conf-name>, <conf-loc>Curitiba, Brazil</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Khadidja</surname></string-name>, <string-name><given-names>B. M.</given-names> <surname>Kamel</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Aboue</surname></string-name> and <string-name><given-names>A. K.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>A new efficient multi-task applications mapping for three-dimensional network-on-chip based MPSoC</article-title>,&#x201D; <source>Concurrency and Computation Practice and Experience</source>, vol. <volume>1</volume>, no. <issue>10</issue>, pp. 1&#x2013;20, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. A.</given-names> <surname>Prasath</surname></string-name>, <string-name><given-names>J. A.</given-names> <surname>Alzubi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ramachandran</surname></string-name></person-group>, &#x201C;<article-title>A high performance scalable fuzzy based modified asymmetric heterogene multiprocessor system on chip (AHt-MPSOC) reconfigurable architecture</article-title>,&#x201D; <source>Journal of Intelligent &#x0026; Fuzzy Systems</source>, vol. <volume>42</volume>, no. <issue>2</issue>, pp. <fpage>647</fpage>&#x2013;<lpage>658</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Chenyun</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Tang</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>A power management circuit compatible with Ti smart reflex and xilinx ultrascale MPSoC dual voltage mechanism</article-title>,&#x201D; in <conf-name>10th Int. Conf. on Computing and Pattern Recognition</conf-name>, <conf-loc>Shanghai, China</conf-loc>, pp. <fpage>357</fpage>&#x2013;<lpage>362</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Decomposition-based multi-objective optimization for energy-aware distributed hybrid flow shop scheduling with multiprocessor tasks</article-title>,&#x201D; <source>Tsinghua Science and Technology</source>, vol. <volume>26</volume>, no. <issue>5</issue>, pp. <fpage>646</fpage>&#x2013;<lpage>663</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. Y.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>E. Y.</given-names> <surname>Chung</surname></string-name> and <string-name><given-names>J. L.</given-names> <surname>Gaudiot</surname></string-name></person-group>, &#x201C;<article-title>An energy and performance efficient dvfs scheme for irregular parallel divide-and-conquer algorithms on the intel scc</article-title>,&#x201D; <source>IEEE Computer Architecture Letters</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>13</fpage>&#x2013;<lpage>16</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Italo</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Antonio</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Barros</surname></string-name>, <string-name><given-names>I. M.</given-names> <surname>Sardina</surname></string-name>, <string-name><given-names>C. P.</given-names> <surname>Bianchini</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Distributed-memory load balancing with cyclic token-based work-stealing applied to reverse time migration</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>128419</fpage>&#x2013;<lpage>128430</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Baital</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Chakrabarti</surname></string-name></person-group>, &#x201C;<article-title>Dynamic scheduling of real-time tasks in heterogeneous multicore systems</article-title>,&#x201D; <source>IEEE Embedded Systems Letters</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>29</fpage>&#x2013;<lpage>32</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Expected energy optimization for real-time multiprocessor socs running periodic tasks with uncertain execution time</article-title>,&#x201D; <source>IEEE Transactions on Sustainable Computing</source>, vol. <volume>6</volume>, no. <issue>3</issue>, pp. <fpage>398</fpage>&#x2013;<lpage>411</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>James</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Tenentes</surname></string-name>, <string-name><given-names>B. M.</given-names> <surname>AlHashimi</surname></string-name> and <string-name><given-names>G. V.</given-names> <surname>Merrett</surname></string-name></person-group>, &#x201C;<article-title>Online tuning of dynamic power management for efficient execution of interactive workloads</article-title>,&#x201D; in <conf-name>IEEE/ACM Int. Symp. on Low Power Electronics and Design (ISLPED)</conf-name>, <conf-loc>Boston, United States</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B. G.</given-names> <surname>Maryam</surname></string-name></person-group>, &#x201C;<article-title>MPSoC based dynamic power management in wireless sensor networks</article-title>,&#x201D; in <conf-name>Int. Conf. on Information Communication and Embedded Systems</conf-name>, <conf-loc>Chennai, India</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Bogdan</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Marculescu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Jain</surname></string-name></person-group>, &#x201C;<article-title>Dynamic power management for multidomain system-on-chip platforms: An optimal control approach</article-title>,&#x201D; <source>ACM Transactions on Design Automation of Electronic Systems (TODAES)</source>, vol. <volume>18</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>20</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Yankai</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Big data driven hierarchical digital twin predictive remanufacturing paradigm: Architecture, control mechanism, application scenario and benefits</article-title>,&#x201D; <source>Journal of Cleaner Production</source>, vol. <volume>248</volume>, no. <issue>1</issue>, pp. <fpage>119</fpage>&#x2013;<lpage>299</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Haris</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shafique</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Henkel</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Parameswaran</surname></string-name></person-group>, &#x201C;<article-title>System-level application-aware dynamic power management in adaptive pipelined MPSoCs for multimedia</article-title>,&#x201D; in <conf-name>IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD)</conf-name>, <conf-loc>Washington, D.C, </conf-loc> pp. <fpage>616</fpage>&#x2013;<lpage>623</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>George</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Pnevmatikatos</surname></string-name></person-group>, &#x201C;<article-title>Dynamic power and thermal management of noc-based heterogeneous mpsocs</article-title>,&#x201D; <source>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>26</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. E.</given-names> <surname>Abdellaoui</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Fakhri</surname></string-name></person-group>, &#x201C;<article-title>Power management strategies in energy-harvesting wireless sensor networks</article-title>,&#x201D; <source>International Journal of Communication Networks and Information Security</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>136</fpage>&#x2013;<lpage>142</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Yongkun</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Recent progress in organic field-effect transistor-based integrated circuits</article-title>,&#x201D; <source>Journal of Polymer Science</source>, vol. <volume>60</volume>, no. <issue>3</issue>, pp. <fpage>311</fpage>&#x2013;<lpage>327</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>X. Z.</given-names> <surname>He</surname></string-name></person-group>, &#x201C;<article-title>Vehicle re-odentification model based on optimized densenet121 with joint loss</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>67</volume>, no. <issue>3</issue>, pp. <fpage>3933</fpage>&#x2013;<lpage>3948</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Xiaorui</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Song</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A Real-time cutting model based on finite element and order reduction</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>43</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. M.</given-names> <surname>Kumar</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Nagendra</surname></string-name></person-group>, &#x201C;<article-title>Simulation of real time multiprocessor static scheduling algorithms</article-title>,&#x201D; <source>I-Manager&#x2019;s Journal on Embedded Systems</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>30</fpage>&#x2013;<lpage>38</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Richard</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Deplanche</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Trinquet</surname></string-name></person-group>, &#x201C;<article-title>Storm a simulation tool for real-time multiprocessor scheduling evaluation</article-title>,&#x201D; in <conf-name>IEEE 15th Conf. on Emerging Technologies &#x0026; Factory Automation (ETFA)</conf-name>, <conf-loc>Bilbao, Spain</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. A.</given-names> <surname>Kivilcim</surname></string-name>, <string-name><given-names>T. S.</given-names> <surname>Rosing</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Mihic</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Leblebici</surname></string-name></person-group>, &#x201C;<article-title>Analysis and optimization of mpsoc reliability</article-title>,&#x201D; <source>Journal of Low Power Electronics</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>56</fpage>&#x2013;<lpage>69</lpage>, <year>2006</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>