Optimization of mixed database workload scheduling and concurrency control by mining data dependency relationships via lock tracking

A computer readable storage medium, tangibly embodying a program of instructions executable by the computer for workload scheduling, the program of instructions, when executing, performing the following steps:

• obtaining first lock trace data associated with a plurality of workloads, the first lock trace data relating to a first set of objects;
• replaying the first lock trace data associated with the workloads to identify first data access conflicts between a first one of the workloads and a second one of the workloads;
• determining, based upon the identified first data access conflicts associated with the first lock trace data, a subset of the first set of objects;
• obtaining second lock trace data associated with the workloads, the second lock trace data relating to the subset of objects,
• replaying the second lock trace data associated with the workloads to identify second data access conflicts between the first one of the workloads and the second one of the workloads;
• decomposing, based at least in part upon the identified second data access conflicts, at least the first one of the workloads into a plurality of shorter duration execution units;
• and
• scheduling at least one of the shorter duration execution units at a first time window that at least partially overlaps a second time window of at least the second one of the workloads.

A computer-implemented system for workload scheduling, the system comprising:

• a processor;
• and
• a memory storing computer readable instructions that, when executed by the processor, implement:
• obtaining first lock trace data associated with a plurality of workloads, the first lock trace data relating to a first set of objects;
• replaying the first lock trace data associated with the workloads to identify first data access conflicts between a first one of the workloads and a second one of the workloads;
• determining, based upon the identified first data access conflicts associated with the first lock trace data, a subset of the first set of objects;
• obtaining second lock trace data associated with the workloads, the second lock trace data relating to the subset of objects;
• replaying the second lock trace data associated with the workloads to identify second data access conflicts between the first one of the workloads and the second one of the workloads;
• decomposing, based at least in part upon the identified second data access conflicts, at least the first one of the workloads into a plurality of shorter duration execution units;
• and
• scheduling at least one of the shorter duration execution units at a first time window that at least partially overlaps a second time window of at least the second one of the workloads.