Efficiency sequencer for multiple concurrently-executing threads of execution

A system comprising:

• a memory storing a designated next ticket value and a waiters list of tickets;
• and
• a hardware processor configured to:
• receive an instruction to advance the designated next ticket value;
• increment the designated next ticket value in response to receiving the instruction;
• insert a ticket into the waiters list of tickets stored in the memory to preserve a sorted order of a plurality of tickets in the waiters list using a value of the ticket provided by a waiter associated with the ticket, wherein the ticket in the waiters list corresponds to a thread;
• search a part of the waiters list identifying the ticket as having the designated next ticket value, without searching the entire waiters list by identifying a threshold ticket value which is the greatest ticket value in the waiters list that is less than or equal to the designated next ticket value, wherein the searching starts at a waiters list head element;
• remove the ticket from the waiters list using a single atomic operation by one of setting the waiters list head element to refer to a next element in the waiters list after a threshold element having the threshold ticket value, and setting the waiters list head element to refer to another ticket in the waiters list;
• and
• cause a thread associated with the ticket to proceed.

A non-transitory machine-readable medium for a computer system, the non-transitory machine-readable medium having stored thereon a series of instructions executable by a processor, the series of instructions comprising:

• instructions that cause the processor to receive an instruction to advance a designated next ticket value;
• instructions that cause the processor to increment the designated next ticket value in response to receiving the instruction;
• instructions that cause the processor to insert a ticket into a waiters list of tickets stored in a memory of the computer system to preserve a sorted order of a plurality of tickets in the waiters list using a value of the ticket provided by a waiter associated with the ticket, wherein the ticket in the waiters list corresponds to a thread;
• instructions that cause the processor to search a part of the waiters list in the memory identifying the ticket as having the designated next ticket value, without searching the entire waiters list by identifying a threshold ticket value which is the greatest ticket value in the waiters list that is less than or equal to the designated next ticket value, wherein the searching starts at a waiters list head element;
• instructions that cause the processor to remove the ticket from the waiters list using a single atomic operation by one of setting the waiters list head element to refer to a next element in the waiters list after a threshold element having the threshold ticket value, and setting the waiters list head element to refer to another ticket in the waiters list;
• and
• instructions that cause the processor to cause a thread associated with the ticket to proceed.