Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing

DOI10.1016/j.matcom.2023.07.029OpenAlexW4385607061MaRDI QIDQ6094069

No author found.

Publication date: 12 September 2023

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2023.07.029

zbMATH Keywords

linear regressionparallel computationsqueueing systemmean response timesystem with parallel task processing

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• Cost optimization of an unreliable server queue with two stage service process under hybrid vacation policy
• Queuing system in VLSI physical design
• Bivariate distributions of maximum remaining service times in fork-join infinite-server queues
• Maximum remaining service time in infinite-server queues
• Delay asymptotics and bounds for multitask parallel jobs
• Order Statistics
• The Pareto Distribution as a Queue Service Discipline
• A Simplex Method for Function Minimization
• Queueing modeling and optimization of a fault-tolerant system with reboot, recovery, and vacationing server operating under admission control policy
• A neural network approach to performance analysis of tandem lines: the value of analytical knowledge
• Fork-join and redundancy systems with heavy-tailed job sizes

This page was built for publication: Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing