Accounting for large jobs for a single-processor online model

The paper proposes for consideration an online scheduling model for single processor with a deadlines and minimization of the total delay. A new LJSF algorithm has been proposed that takes into account the size of the jobs entering the process and is adapted to cases of large jobs. In comparison wit...

Full description

Saved in:
Bibliographic Details
Main Authors: Tarasova, Elizaveta, Grigoreva, Natalia
Format: Conference Proceeding
Language:English
Subjects:
Adaptation models
deadlines
Delays
Linear programming
Minimization
minimization of the total delay
online scheduling model
Processor scheduling
Schedules
Scheduling
single processor model
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper proposes for consideration an online scheduling model for single processor with a deadlines and minimization of the total delay. A new LJSF algorithm has been proposed that takes into account the size of the jobs entering the process and is adapted to cases of large jobs. In comparison with existing algorithms, LJSF improved the results on average by 3% - 20% in more than 40% of examples for different testing groups, while in other cases the values of the objective functions were close with a deviation of no more than 2%.
ISSN:2768-6388
DOI:10.1109/ICOA55659.2022.9934593