Multi-criteria Scheduling of Soft Real-time Tasks on Uniform Multiprocessors Using Fuzzy Inference

Salmani, Vahid; Naghibzadeh, Mahmoud; Kahani, Mohsen; Nejad, Sedigheh Khajouie

doi:10.1007/978-1-4020-6264-3_76

Cited by 10 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [28], Salmani et al propose MMUF algorithm, that combines fixed and dynamic scheduling to feasible schedule transition overloaded systems (load ≥ 100%). When the processor utilization is less or equal to one, EDF is a special case of the MMUF algorithm [29].…”

Section: Combined Schedulermentioning

confidence: 99%

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

View full text Add to dashboard Cite

Multicore systems were developed to provide a substantial performance increase over monocore systems. But shared hardware resources are a problem as they add unpredictable delays that affect the schedulability of multicore hard real-time systems. In recent years much effort has been put into modelling interference and proposing scheduling techniques to mitigate its negative effect. Using one of these models, we propose a scheduling technique, based on Integer Linear Programming (ILP) that, in combination with a task to core allocator, not only achieves a feasible schedule but also reduces the interference produced by shared hardware resources in the context of hard real-time multicore systems. The evaluation shows how both the interference is reduced (≈ 83.47%) and the schedulability is increased (≈ 12.25%) compared to traditional heuristics.INDEX TERMS integer linear programming, optimization, partitioned systems, real-time systems, static scheduling I. INTRODUCTION

show abstract

Section: Combined Schedulermentioning

confidence: 99%

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The length of schedule in balanced case is also minimized. We apply the formula below for defining the system's load balance [11]:…”

Section: Load Balancementioning

confidence: 99%

Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines

Salmani

Naghibzadeh

Kahani

2007

7th IEEE International Conference on Computer and Information Technology (CIT 2007)

Self Cite

View full text Add to dashboard Cite

It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its non-optimality, EDF is an appropriate algorithm to use in such environments. However, its performance significantly degrades in overloaded situations. Moreover, EDF produces a relatively large number of migrations which may prove unacceptable for use on some parallel machines. In this paper a new deadlinebased algorithm for scheduling real-time tasks on uniform parallel machines is presented. The performance of this algorithm is then compared with that of EDF algorithm. It is shown that our proposed approach not only demonstrates a performance close to that of EDF in non-overloaded conditions but also has supremacy over EDF in overloaded situations in many aspects. Furthermore, it imposes much less overhead on the system.

show abstract

“…Our proposed algorithm is based on our previous contribution called Highest Fuzzy Priority First (HFPF) Algorithm [14]. Although HFPF has supremacy over EDF in some aspects, it imposes more overhead to the system in terms of migrations than EDF does.…”

Section: Proposed Approachmentioning

confidence: 99%

“…The length of schedule in balanced case is also minimized. We apply the formula below for defining the system's load balance [14]: in which m is the number of processors. U denotes the average CPU utilization and U j represents the j th processor's utilization.…”

Section: Load Balancementioning

confidence: 99%

A Fuzzy-Based Multi-criteria Scheduler for Uniform Multiprocessor Real-Time Systems

Dutta

Kundu

Mukhopadhyay

2007

10th International Conference on Information Technology (ICIT 2007)

Self Cite

View full text Add to dashboard Cite

It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its nonoptimality, EDF is an appropriate algorithm to use in such environments. However, its performance significantly drops in overloaded situations. Moreover, EDF produces a relatively large number of migrations which may prove unacceptable for use on some parallel machines. In this paper a new algorithm based on fuzzy logic for scheduling soft real-time tasks on uniform multiprocessors is presented. The performance of this algorithm is then compared with that of EDF algorithm. It is shown that our proposed approach not only demonstrates a performance close to that of EDF in nonoverloaded conditions but also has supremacy over EDF in overloaded situations in many aspects. Furthermore, it imposes much less overhead on the system.

show abstract

Multi-criteria Scheduling of Soft Real-time Tasks on Uniform Multiprocessors Using Fuzzy Inference

Cited by 10 publications

References 9 publications

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines

A Fuzzy-Based Multi-criteria Scheduler for Uniform Multiprocessor Real-Time Systems

Contact Info

Product

Resources

About