Lock-free scheduler queue with bulk insertion

A method comprising:

• identifying a plurality of computing jobs associated with a same execution priority;
• generating a first skiplist including a first plurality of queues, each of the first plurality of queues including a queue entry for at least one of the plurality of computing jobs;
• determining an insertion point for each one of a second plurality of queues of a second skiplist based on the execution priority, each of the second plurality of queues including a queue entry for at least one of a second plurality of computing jobs;
• and
• inserting each of the first plurality of queues of the first skiplist into a respective one of the second plurality of queues of a second skiplist at the determined insertion points.

One or more non-transitory media storing processor-executable program code, the program code executable by a computing system to cause the computing system to:

• identify a plurality of computing jobs associated with a same execution priority;
• determine an insertion point for each one of a second plurality of queues of a second skiplist based on the execution priority, each of the second plurality of queues including a queue entry for at least one of a second plurality of computing jobs;
• and
• generate a first skiplist including a first plurality of queues, the first skiplist including one or more queue entries for each of the plurality of computing jobs;
• and
• insert each of the first plurality of queues of the first skiplist into a respective one of the second plurality of queues at a respective one of the determined insertion points.