Simulation of dynamic priority calculation for multilevel priority queue

Authors:
Ivaylo Atanassov
Affiliations:
Technical University -- Sofia
Venue:
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Year:
2007

Citing 6
Cited 0

Concurrent operations on priority queues

Communications of the ACM
Modern Operating Systems

Modern Operating Systems
Parallel and Distributed Programming Using C++

Parallel and Distributed Programming Using C++
The Design and Implementation of the FreeBSD Operating System

The Design and Implementation of the FreeBSD Operating System
Expert Oracle Database Architecture: 9i and 10g Programming Techniques and Solutions

Expert Oracle Database Architecture: 9i and 10g Programming Techniques and Solutions
Operating Systems Concepts

Operating Systems Concepts

Quantified Score

Hi-index	0.00

Visualization

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.