Browse Prior Art Database

Scheduling of disk intensive operations on shared remote disk systems

IP.com Disclosure Number: IPCOM000247629D
Publication Date: 2016-Sep-21
Document File: 3 page(s) / 73K

Publishing Venue

The IP.com Prior Art Database

Abstract

This article presents new way of scheduling of disk intensive operations on shared remote disk systems. Proposed solution do not require administrative priviliges for shared remote resource (disk drive).

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 01 of 3

Scheduling of disk intensive operations on shared remote disk systems

When shared remote disk systems are being used by multiple distributed computer systems concurrently, it is possible that some disk intensive operations will occur in the same time of the day (week, month, etc) creating performance penalty and additional strain on system resources.

Core idea is to secure proper scheduling of resource intensive workloads (e.g. backups, filesystem scanning, batch processing) with limited time constraints via creating dedicated, standard file (does not require additional layer for communication since the shared storage is readable by the computers) with preferred and allowed time windows beingpresented in machine readable form. These files needs to be read by all software that is using the resource, then algorithm (which is present in all software sharing the resource and is key point of this disclosure) for scheduling is being used in order to create optimal schedule .

Example scenario

Assumption 1:

We have 2 different computer system (A and B) that share the same remote storage system (e.g. Network Attached Storage, NAS).

Assumption 2:

Both computer system execute disk intensive operation (like scanning or backup), on the same time (e.g. due to software defaults). While supposedly it was scheduled for out of business hours processing, it is still starving the same resource in the same time. The same occur for every operation constrained by shared resource.

Hourly distribution of work:

0

1

2

3

4

5

6

7

8

9

1 0

1 1

1

2

1 3

1 4

1 5

1 6

1 7

1 8

1 9

2 0

2 1

2 2

2

3

Computer A

Computer B

Business hours

As we may see at schema above, executing A and B processes simultaneously leads to each one of them taking 4 hours and processing time overlapping with

1


Page 02 of 3

business hours which leads to the core business being impacted.

Let us look at the same schema with slight change of the timing.

Hourly distribution of work:

0

1

2

3

4

5

6

7

8

9

1 0

1 1

1

2

1 3

1 4

1 5

1 6

1 7

1 8

1 9

2 0

2 1

2 2

2

3

Computer A

Computer B

Business hours

Due to the time-shift, resource-heavy workload processing we are able to avoid impacting business hours processing.

Let's imagine that Computer A and B have the same processing needs and built-in defaults, bei...