CPU scheduling algorithms: Case &amp; comparative study

Zouaoui, Sonia; Boussaid, Lotfi; Mtibaa, Abdellatif

doi:10.1109/sta.2016.7951997

Cited by 6 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Discussions, the results of the proposed approach are analyzed and compared with the existing fuzzy algorithms such as evaluationary fuzzy based algorithms [32], new fuzzy scheduling algorithms [33], earliest deadline first [34] and least laxity first [35] scheduling algorithms, and proved that the proposed approach placed better compartively. The graphical analysis given above demonstrates the results gained for missed deadlines, mean response time and mean turnaround time for different load factors, by making use of different number of processors scu as 10, 20, 50, and 100, in four cases.…”

Section: Resultsmentioning

confidence: 95%

Algorithm fuzzy scheduling (AFS) for realtime jobs on multiprocessor systems

Holagundi¹,

Ashwathsetty²,

Basthikodi

2022

IJEECS

View full text Add to dashboard Cite

The computing in Real-time is rapidly focusing much developments in technologies so that the real-time jobs are to be scheduled and executed on computing systems in particular time frame. The scheduling and load balancing techniques in distributed systems face numerous challenges because of lack of centralized strategy to dispatch the jobs in multiprocessors systems. In this work, we propose an Algorithm Fuzzy Scheduling (AFS) for real-time jobs that includes of Arrival time, Deadline and Computation time as the scheduling parameters of input. The approach AFS is analyzed and compared with Existing Fuzzy Algorithm (EFA) model for evaluation of performances from the outcome of the simulation. The jobs are scheduled on multiprocessor at higher system load by making use of fuzzy mechanisms in the algorithms. The experimental results prove that the proposed AFS achieves a better performance comparatively to EFA at various system load factors with respect to mean turnaroundtime, mean response time and count of missed deadlines. This is the initial phase of the algorithm, that will be enhanced to consider a greater number of parameters to be associated with jobs for better decision making and to investigate the scope for algorithm level parallelism.

show abstract

Section: Resultsmentioning

confidence: 95%

Algorithm fuzzy scheduling (AFS) for realtime jobs on multiprocessor systems

Holagundi¹,

Ashwathsetty²,

Basthikodi

2022

IJEECS

View full text Add to dashboard Cite

show abstract

“…. 6 K r = the total number of processes in each round Most of the traditional scheduling techniques [38] are developed based on the job sequencing method [54]. One of the common problems of all the scheduling techniques (exclude round-robin) is starvation.…”

Section: Introductionmentioning

confidence: 99%

Multiprocessor Scheduling Based on Evolutionary Technique for Solving Permutation Flow Shop Problem

Priya

Sahana

2020

IEEE Access

View full text Add to dashboard Cite

Multiprocessor scheduling is one of the thrust areas in the field of computational science. There are various traditional scheduling techniques exist for the allocation and processing of jobs. But the performance of these techniques reduce in terms of makespan and waiting time when a large number of jobs are allocated to multiprocessors. In this paper, a new stochastic evolutionary technique is proposed based on the Genetic Algorithm and Pareto optimality. The new technique is implemented in a high-performance computing (HPC) environment using a Message passing interface (MPI) to resolve the permutation flow shop scheduling problem. Pareto optimality technique is used for sample distribution and the basis of the decision to select the lower bound of the makespan, instead of selecting the makespan directly for the best solution. The performance and quality evaluation of proposed techniques (GA_PO_MPI, GA) are compared with traditional techniques (FCFS, FCFS_MPI, TSAB, TSGP, TSGW) on the basis of Relative Percentage Deviation (RPD), Computational Time (CT) and Average Waiting Time and found satisfactory. INDEX TERMS Average relative percentage deviation (RPD), computational time (CT), flowshop, GA_PO_MPI, HPC, MPI, pareto optimal, scheduling.

show abstract

“…Scheduling plays an important role to assign multiple resources for completing several scheduling activities. We have several traditional scheduling algorithms to make the processes to perform multiple tasks simultaneously [1] [2] [3]. The process in Operating System (OS) is nothing but the instance of programs that is being executed as it contains codes and activity.…”

Section: Introductionmentioning

confidence: 99%

Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems

Rao¹,

Jayaraman²,

Srinivasu³

2018

IJET

View full text Add to dashboard Cite

Scheduling play an important role to perform a single (or) multiple process activities by considering scheduling criteria’s such as, waiting time, turnaround time, CPU utilization and context switches. The scheduling criteria’s mainly depends on the quantum time which is specific to real time systems. The challenges faced by the real time systems based on scheduling activities viz., higher waiting time, more context switches and high turnaround time. All the scheduling criteria’s are integrated to achieve Quality of Service (QoS) like throughput and delay. To improve the scheduling criteria’s like waiting time, context switches and turnaround time, PIMRR algorithm is proposed. The PIMRR algorithm is first integrated with modulo operation to provide priority to all the process. The average of all the processes burst time is equal to the quantum time. Performance analysis is done for PMIRR with the existing simple round robin, PRR, Priority based RR scheduling based on the scheduling criteria’s. Our results demonstrates that the PIMRR is more efficient compared to the existing ones, in terms of waiting time and turnaround time versus quantum time.

show abstract

CPU scheduling algorithms: Case & comparative study

Cited by 6 publications

References 5 publications

Algorithm fuzzy scheduling (AFS) for realtime jobs on multiprocessor systems

Algorithm fuzzy scheduling (AFS) for realtime jobs on multiprocessor systems

Multiprocessor Scheduling Based on Evolutionary Technique for Solving Permutation Flow Shop Problem

Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems

Contact Info

Product

Resources

About