The Queue State for Multiprocessor System with Waiting Time Restriction

Sahakyan, Vladimir; Vardanyan, Artur

doi:10.1109/csitechnol.2019.8895093

Cited by 7 publications

(10 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where in accordance with [4], we used the notation L i,j to denote the state of the system when i tasks are being serviced, and j tasks are waiting in the queue.…”

Section: Main Notationsmentioning

confidence: 99%

“…This article discusses a single-threaded multiprocessing queuing system, which is denoted by M |M |m|n. Jobs will be serviced in the order they arrive in the system, i.e., FIFO discipline is used [1], [2]. The system consists of m processors (cores, cluster nodes, etc.,) dedicated to task servicing, with a queue capable of accommodating up to n tasks awaiting service [3].…”

Section: Introductionmentioning

confidence: 99%

“…Here, P i,j represents the probability that there are i tasks being serviced (1 ≤ i ≤ m), while j tasks are waiting in the queue (1 ≤ j ≤ n). In order to determine the values of P i,j , a system of linear equations is proposed in [4] to account for a more comprehensive scenario. This paper aims to analyze the virtual waiting time in the aforementioned queueing system by leveraging the steadystate probabilities derived earlier.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

About Virtual Waiting Time in a Multiprocessor System

Sahakyan,

Vardanyan

2023

Proceedings of Computer Science and Information Technologies 2023 Conference

View full text Add to dashboard Cite

In multiprocessor queueing systems, the waiting time to start servicing tasks is crucial to optimize system performance. However, traditional measures of latency may not accurately reflect the actual task experience due to differences in service requirements and resource availability.The concept of virtual waiting time has become a valuable metric that takes into account the amount of time tasks would wait if they arrived at a given time.The article analyzes the virtual waiting time in a multiprocessor queuing system with limited queue capacity. Taking into account the distributions of arrivals and servicing of tasks, equations are derived that describe the behavior of the virtual waiting time.Based on the analysis, expressions for estimating the expected virtual waiting time are obtained. The conclusions will make it possible to optimize task scheduling and resource allocation in multiprocessor systems, increasing system performance.

show abstract

“…where in accordance with [4], we used the notation L i,j to denote the state of the system when i tasks are being serviced, and j tasks are waiting in the queue.…”

Section: Main Notationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

About Virtual Waiting Time in a Multiprocessor System

Sahakyan,

Vardanyan

2023

Proceedings of Computer Science and Information Technologies 2023 Conference

View full text Add to dashboard Cite

show abstract

“…Tasks will be serviced in the order they enter the system, i.e., FIFO discipline is used [3]. Those tasks that the system receives when the queue is fully occupied (that is, there are already n tasks in the queue waiting to be serviced), receive system access and service denial.…”

Section: System Parametersmentioning

confidence: 99%

“…In the previous publications [1], [3], three lemmas were derived and established that are instrumental to this current analysis. These lemmas provide key insights and results that will be utilized in this section to advance the derivation of supporting probabilities.…”

Section: Supporting Probability Formulasmentioning

confidence: 99%

A Computational Approach for Evaluating Steady-State Probabilities of a Multiprocessor Queueing System with a Waiting Time Restriction

Sahakyan,

Vardanyan

2023

Proceedings of Computer Science and Information Technologies 2023 Conference

View full text Add to dashboard Cite

Distributed and parallel high-speed computing systems have become increasingly important in recent years for handling large amounts of data and performing complex scientific research using multi-agent intelligent methods. Accurate modeling tasks in science and technology require fast and large-scale computations. However, organizing computations in a cluster environment to optimally utilize system resources is a challenge that requires effective scheduling of task execution, which takes into account the required resources and execution time.In this context, this paper proposes a computational approach for evaluating steady-state probabilities in the environment of a multiprocessor queueing system. The proposed approach contributes to a practical partial solution to the challenges of organizing computations in a cluster environment and can be applied of the organizing process in modeling tasks that require fast and large-scale computations for accurate results to the optimal utilization of resources.Overall, the paper contributes to the growing field of distributed and parallel computing by providing a practical approach to evaluating steady-state probabilities in a multiprocessor queueing system.

show abstract

About the possibility of executing tasks with a waiting time restriction in a multiprocessor system

Sahakyan¹,

Vardanyan²

2023

AIP Conference Proceedings

View full text Add to dashboard Cite

The Queue State for Multiprocessor System with Waiting Time Restriction

Cited by 7 publications

References 3 publications

About Virtual Waiting Time in a Multiprocessor System

About Virtual Waiting Time in a Multiprocessor System

A Computational Approach for Evaluating Steady-State Probabilities of a Multiprocessor Queueing System with a Waiting Time Restriction

About the possibility of executing tasks with a waiting time restriction in a multiprocessor system

Contact Info

Product

Resources

About