Preemptive queueing system with randomized push-out mechanism

Muliukha, Vladimir; Ilyashenko, Alexander; Zayats, Oleg; Zaborovsky, Vladimir

doi:10.1016/j.cnsns.2014.08.020

Cited by 19 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the data-missing will be caused by the overtime duration of processing because there is no consideration of the deadline issue for this method. Muliukha et al [10] described a preemptive dual-stream queuing system method with random rollout probability, and proposed an efficient algorithm for controlling the data flow of the system. And put that probability is the main parameter of the queuing system.…”

Section: Related Workmentioning

confidence: 99%

Research on Real-Time Embedded Software Scheduling Model Based on EDF

et al. 2020

View full text Add to dashboard Cite

Schedulability analysis is a very important part in real-time system research. Because the scenarios faced by real-time systems are very complicated, the functional characteristics must be combined with the predictability of response time. It is necessary to ensure the correctness of the calculation results and meet the real-time requirements. To solve this problem, we propose the IEDF (Improved Earliest Deadline First) algorithm, which is combined with the queuing theory model. The IEDF algorithm is based on the EDF (Earliest Deadline First) algorithm, which is more suitable for the scheduling of real-time embedded system. Scheduling of non-periodic tasks that arrive randomly. There are two types of tasks in the task set, tasks with a high static priority are executed first. In the ready queue of the same priority task, the deadline and execution time are considered. The comparison of simulation experiments shows that: the sum of waiting time in the execution of IEDF with enough deadline is much less than that of ordinary queuing algorithm; the number of errors in the execution of IEDF algorithm with deadline is much less than that of ordinary queuing algorithm. These results demonstrate the feasibility of the IEDF algorithm.INDEX TERMS Deadline, real-time scheduling, EDF (earliest deadline first) algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Research on Real-Time Embedded Software Scheduling Model Based on EDF

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Finite buffer queues are investigated using the generating function approach in [19,20,21]. In [19], the authors study a single server Markovian system with two classes of customers.…”

Section: Related Workmentioning

confidence: 99%

“…In [20], a non-preemptive priority queue with a push-out buffer management mechanism is studied and packet loss probabilities are obtained. A preemptive queue with 2 customer classes and the randomized push-out mechanism is analyzed in [21]. In this work, the packet loss probability and average relative waiting times are thoroughly investigated.…”

Section: Related Workmentioning

confidence: 99%

A Markovian Model for Internet of Things Application

Salameh¹,

Awad²,

AbuAlrub³

2019

IJCNC

View full text Add to dashboard Cite

Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-tothings that are incorporated into an information networks allowing automatic information interchange and the processing of data at real time. In this paper, we conduct a performance analysis of a real application defined through four traffic classes with the priorities present in smart cities using Continuous Time Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic. Based on the analytical model, several performance measures for different traffic classes have been studiedextensively including blocking probability; push out probability, delay, channel utilization as well as overall system performance.

show abstract

“…It also considers numerical techniques and problems arising when natural phenomena are modelled on computers. The papers included in this special issue (see [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]) have been carefully selected by the guest editors among the submissions reflecting the talks presented at the international conference ''Numerical computations: Theory and Algorithms (NUMTA)'' held in June 17-23, 2013, Falerna (CZ), Italy. The NUMTA 2013 has been organized by the University of Calabria, Rende (CS), Italy and the N.I.…”

mentioning

confidence: 99%