Priority queue administration by sublist index

Open Access
Publisher Website
Google Scholar
Abstract
A variant of indexed lists is proposed for the management of priority queues: the queue is divided into a number of two-way linked sublists. The adequate sublist can be found by using an address mapping function and a sublist index. The dynamic reorganisation of the sublists and the index is based on the analysis of the statistics collected during the process. The method is tested in the environment of discrete event simulation. Comparison with the previous index and tree algorithms, shows that the new method is advantageous at least for priority queues of moderate size.

This publication has 0 references indexed in Scilit: