Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm (Q1718052): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of fixed-priority scheduling of periodic, real-time tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning real-time tasks to heterogeneous processors by applying ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems / rank
 
Normal rank

Latest revision as of 02:19, 18 July 2024

scientific article
Language Label Description Also known as
English
Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm
scientific article

    Statements

    Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40\%--50\% less energy than the GA-based and SFLA-based algorithms and spends 10\% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19\% more feasible solutions than the SFLA-based algorithm.
    0 references

    Identifiers