Two continuous queuing disciplines in mixed priority systems

Cybernetics ◽  
1979 ◽  
Vol 14 (3) ◽  
pp. 421-426
Author(s):  
A. Ya. Matov ◽  
V. I. Zhluktenko ◽  
K. A. Chernous ◽  
N. F. Tishchenko
Keyword(s):  
Priority Systems ◽  
Mixed Priority

scholarly journals Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5042
Author(s):  
Tomasz Nycz ◽  
Tadeusz Czachórski ◽  
Monika Nycz
Keyword(s):  
Diffusion Approximation ◽  
Numerical Models ◽  
Software Defined Networks ◽  
Detailed Model ◽  
Preemptive Resume ◽  
Central Controller ◽  
Priority Systems ◽  
Primary Element ◽  
Preemptive Resume Priority ◽  
General Distributions

The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.

Scheduling soft aperiodic tasks in adaptable fixed-priority systems

1996 ◽  
Vol 30 (4) ◽  
pp. 17-28 ◽  
Author(s):  
Jongwoon Lee ◽  
Sungyoung Lee ◽  
Hyungill Kim
Keyword(s):  
Fixed Priority ◽  
Priority Systems ◽  
Aperiodic Tasks

scholarly journals Memory-processor co-scheduling in fixed priority systems

2015 ◽  
Author(s):  
Alessandra Melani ◽  
Marko Bertogna ◽  
Vincenzo Bonifaci ◽  
Alberto Marchetti-Spaccamela ◽  
Giorgio Buttazzo
Keyword(s):  
Fixed Priority ◽  
Priority Systems

Special Topics in Queueing Theory

2018 ◽  
pp. 212-254
Keyword(s):  
Queueing Theory ◽  
Finite Population ◽  
Service Process ◽  
Batch Service ◽  
Priority Level ◽  
Priority System ◽  
Priority Systems ◽  
The One ◽  
Number Of Customers

Topics covered in Chapter 7 are priority systems with preemptive or non-preemptive system, systems with N classes of customers, customers in groups: bulk arrivals, batch service, balking and reneging, and finite population. In a priority system, it is assumed that there are 1, 2, 3, …, N different classes or types of customers, where Type 1 customers are the most important while class N ones are the least important. When a server is available to serve a customer from the queue, the one with the highest priority level will go to the server to start their service process. In batch service, before starting the service process, a group or batch needs to be formed with a certain number of customers.

Exact response time analysis of fixed priority systems based on sporadic servers

2020 ◽  
Vol 110 ◽  
pp. 101836 ◽  
Author(s):  
Jorge Martinez ◽  
Dakshina Dasari ◽  
Arne Hamann ◽  
Ignacio Sañudo ◽  
Marko Bertogna
Keyword(s):  
Response Time ◽  
Response Time Analysis ◽  
Time Analysis ◽  
Fixed Priority ◽  
Priority Systems
Sign in / Sign up

Export Citation Format

Share Document