Simulation of dynamic priority calculation for multilevel priority queue

ABSTRACT

The paper introduces the simulation results for a formula for dynamic priority calculation for multilevel priority queue. Priority queues are widely used data structures, especially in operating systems. Some database servers, Oracle for example, use also such a structures. In previous work is introduced a multilevel priority queue, called CMPQ, used in experimentally developed database server. A formula to calculate the next queue to service is also introduced. In order to examine the behaviour of the queue, some simulations of the scheduling algorithm are performed using MatLab. The goal is to assure that even in worst-case situations "starvation" does not occurs.

REFERENCES

• 1: Atanassov, I., Dynamic Priority Calculation for Multilevel Priority Queues, Information Technologies and Control, Union of Automatics and Informatics, April 2007
• 2: Cameron Hughes , Tracy Hughes, Parallel and Distributed Programming Using C++, Prentice Hall Professional Technical Reference, 2003
• 3: Douglas W. Jones, Concurrent operations on priority queues, Communications of the ACM, v.32 n.1, p.132-137, Jan. 1989 [doi>10.1145/63238.63249]
• 4: Thomas Kyte, Expert Oracle Database Architecture: 9i and 10g Programming Techniques and Solutions, Apress, Berkely, CA, 2005
• 5: Marshall Kirk McKusick , George V. Neville-Neil, The Design and Implementation of the FreeBSD Operating System, Pearson Education, 2004
• 6: Oracle 9i, 10g documentation, www.oracle.com
• 7: Raz, D., B. Itzhak, H. Levy, Classes, Priorities and Fairness in Queueing Systems, Research report, Rutgers University, 2004, http://rutcor.rutgers.edu/~rrr
• 8: Abraham Silberschatz, Operating Systems Concepts, John Wiley & Sons, 2005
• 9: Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall PTR, Upper Saddle River, NJ, 2001

INDEX TERMS

Keywords:
database server, dispatching, dynamic priority, multilevel priority queues, scheduling, starvation