Method and system for job prioritization in backup windows

Patent metadata

Field	Value
Publication number	US-11119823-B1
Application number	US-202016925672-A
Country	US
Kind code	B1
Filing date	Jul 10, 2020
Priority date	May 27, 2020
Publication date	Sep 14, 2021
Grant date	Sep 14, 2021

Abstract

A method and system for performing jobs that includes obtaining a current status of a job scheduler queue, obtaining policy level information comprising one or more weightages for each job in the job scheduler queue, and obtaining a current number of available streams for processing jobs in the job scheduler queue. The method and system includes calculating a distance between a first job in the job scheduler queue and the remaining jobs in the job scheduler queue using the one or more weightages to obtain a plurality of distances. The remaining jobs are reordered in the job scheduler queue based on the calculated distances. After the reordering, the first job is scheduled in the job scheduler queue and, after the scheduling of the first job, removing the first job from the job scheduler queue.

First claim

What is claimed is:

1. A method for performing jobs, the method comprising:
obtaining a current status of a job scheduler queue;
obtaining policy-level information comprising one or more weightages for each job in the job scheduler queue;
obtaining a current number of available streams for processing jobs in the job scheduler queue;
calculating a distance between a first job in the job scheduler queue and the remaining jobs in the job scheduler queue using the one or more weightages to obtain a plurality of distances;
reordering the remaining jobs in the job scheduler queue based on the calculated distances;
scheduling, after the reordering, the first job in the job scheduler queue; and
after scheduling the first job, removing the first job from the job scheduler queue.

2. The method of claim 1 , wherein the weightage comprises a policy weightage and an application weightage.

3. The method of claim 1 , wherein the calculated distances is further based on the current number of available streams and a number of jobs in the job scheduler queue.

4. The method of claim 1 , wherein the remaining jobs in the job scheduler queue are arranged in decreasing order of the calculated distances.

5. The method of claim 1 , wherein the jobs in the job scheduler queue are a part of a backup process.

6. The method of claim 1 , wherein the current status of the job scheduler queue comprises a time factor for each job in the job scheduler queue.

7. The method of claim 6 , wherein a calculated distance of the calculated distances is calculated using the following equation:

d
=

1

N
·
S

⁢

(

W
j

·

T
j

-

W
i

·

T
i

)

2

where d is the distance between two jobs, N is a number of jobs in the job scheduler queue, S is the number of available streams, W is the weightage of each job, and T is the time factor for the corresponding job.

8. A non-transitory computer: readable medium comprising computer-readable program code, which when executed by a computer processor enables the computer processor to perform a method for performing jobs, the method comprising:
obtaining a current status of a job scheduler queue;
obtaining policy-level information comprising one or more weightages for each job in the job scheduler queue;
obtaining a current number of available streams for processing jobs in the job scheduler queue;
calculating a distance between a first job in the job scheduler queue and the remaining jobs in the job scheduler queue using the one or more weightages to obtain a plurality of distances;
reordering the remaining jobs in the job scheduler queue based on the calculated distances;
scheduling, after the reordering, the first job in the job scheduler queue; and
after scheduling the first job, removing the first job from the job scheduler queue.

9. The non-transitory computer-readable medium of claim 8 , wherein the weightage comprises a policy weightage and an application weightage.

10. The non-transitory computer-readable medium of claim 8 , wherein the calculated distances is further based on the current number of available streams and a number of jobs in the job scheduler queue.

11. The non-transitory computer-readable medium of claim 8 , wherein the remaining jobs in the job scheduler queue are arranged in decreasing order of the calculated distances.

12. The non-transitory computer-readable medium of claim 8 , wherein the jobs in the job scheduler queue are a part of a backup process.

13. The non-transitory computer-readable medium of claim 8 , wherein the current status of the job scheduler queue comprises a time factor for each job in the job scheduler queue.

14. The non-transitory computer: readable medium of claim 13 , wherein a calculated distance of the calculated distances is calculated using the following equation:

d
=

1

N
·
S

⁢

(

W
j

·

T
j

-

W
i

·

T
i

)

2

where d is the distance between two jobs, N is a number of jobs in the job scheduler queue, S is the number of available streams, W is the weightage of each job, and T is the time factor for the corresponding job.

15. A system, comprising:
a backup storage device comprising a processors with memory configured to:
obtaining a current status of a job scheduler queue;
obtaining policy-level information comprising one or more weightages for each job in the job scheduler queue;
obtaining a current number of available streams for processing jobs in the job scheduler queue;
calculating a distance between a first job in the job scheduler queue and the remaining jobs in the job scheduler queue using the one or more weightages to obtain a plurality of distances;
reordering the remaining jobs in the job scheduler queue based on the calculated distances;
scheduling, after the reordering, the first job in the job scheduler queue; and
after scheduling the first job, removing the first job from the job scheduler queue.

16. The system of claim 15 , wherein the weightage comprises a policy weightage and an application weightage.

17. The system of claim 15 , wherein the calculated distances is further based on the current number of available streams and a number of jobs in the job scheduler q

Assignees

• Emc Ip Holding Co Llc

Inventors

• Appireddygari Venkataramana Mahesh Reddy
• Battal Chetan
• Shankar D H Swaroop
• Chopra Shelesh

Classifications

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• G06F9/4887 Primary

  involving deadlines, e.g. rate based, periodic · CPC title