Because defraggers are slow and often require additional memory, so the overall memory footprint is not as low as it should be. A patent for the new technique has just been filed - hence nothing has been published yet. However, if you want to know more, email me. Thus, the best behaviour can be selected for a given application. Worst-case insertion and deletion may be significantly faster than for conventional priority queues, for example in situations where there are many duplicates and where values are tightly clustered.
Papers describing the new allocator and the new priority queue are in preparation.