Modified Concept to Achieve Maximum Efficiency of CPU Scheduling Algorithm

Chauhan, Himani; Inani, Anunaya

doi:10.1109/iceca.2019.8821820

Cited by 1 publication

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If a CPU-intensive process blocks the CPU, multiple I/O intensive processes can be backed up, which leaves the I/O devices idle. This can also leave the CPU idle while everyone queues for I/O, and the cycle repeats itself when the CPU-intensive process comes back on the queue [8][9][10].…”

Section: First Come First Scheduling (Fcfs)mentioning

confidence: 99%

“…Shortest Job First (SJF), also known as Shortest Job Next (SJN) or Shortest Process Next (SPN), is an inactive scheduling strategy that selects the waiting process with the shortest execution time to be executed next [10][11][12]. The shortest job first is advantageous because of its simplicity and it also minimizes the average amount of time each process has to wait until its execution is completed [13][14][15].…”

Section: Shortest Job First (Sjf)mentioning

confidence: 99%

See 1 more Smart Citation

Optimal CPU Jobs Scheduling Method Based on Simulated Annealing Algorithm

Kareem

Hussein²

2022

eijs

View full text Add to dashboard Cite

Task scheduling in an important element in a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt to reduce the expense of optimizing the use of the CPU. These techniques mostly lack planning and in need to be comprehensive. To address this fault, a hybrid optimization scheduling technique is proposed for the hybridization of both First-Come First-Served (FCFS), and Shortest Job First (SJF). In addition, we propose to apply Simulated Annealing (SA) algorithm as an optimization technique to find optimal job’s execution sequence considering both job’s entrance time and job’s execution time to balance them to reduce the job’s waiting time to be executed. As a result, this research proves that the proposed technique achieves an optimization efficiency with a percentage average 45.5 % according to the FCFS algorithm and 54.5% according to SJF method.

show abstract

Section: First Come First Scheduling (Fcfs)mentioning

confidence: 99%