z-logo
open-access-imgOpen Access
Dynamic Analysis of Priority with Linear Decreasing Function of a Priority in the Service System with Four Types of Application
Author(s) -
Fathollah Dadgar
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2015905555
Subject(s) - computer science , service (business) , function (biology) , priority inheritance , operations research , telecommunications , dynamic priority scheduling , quality of service , mathematics , business , evolutionary biology , biology , marketing , rate monotonic scheduling
problem of choosing optimal parameters for dynamic priorities in the case of the various types of service requests with linearly decreasing function of priorities, performed experiments and obtained results. These results can be used to develop algorithms of functioning nodes for data and their software. In this paper we propose a method for solving the problem of choosing the optimal values of these coefficients that minimize the total value of the queue length in systems with four types of applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom