Implementation

• Keep track of the number of processes waiting on first-delay and second-delay, with first-count and second-count respectively.
• The algorithm assumes a FIFO ordering in the queuing of processes for a semaphore.
• For an arbitrary queuing discipline, a more complicated implementation is required.