Non-Asymptotic Performance Analysis of Size-Based Routing Policies

被引：0

作者：

Bachmat, Eitan ^{[1
]}

Doncel, Josu ^{[2
]}

机构：

[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel

[2] Univ Basque Country, UPV EHU, Dept Math, Leioa 48940, Spain

来源：

2020 IEEE 28TH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS 2020) | 2020年

关键词：

Size-based Routing; Parallel Servers; Heavy-tailed distributions; ASSIGNMENT; QUEUE; JOIN; LOAD;

D O I：

10.1109/mascots50786.2020.9285943

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We investigate the performance of two size-based routing policies: the Size Interval Task Assignment (SITA) and Task Assignment based on Guessing Size (TAGS). We consider a system with two servers and Bounded Pareto distributed job sizes with tail parameter 1 where the difference between the size of the largest and the smallest job is finite. We show that the ratio between the mean waiting time of TAGS over the mean waiting time of SITA is unbounded when the largest job size is large and the arrival rate times the largest job size is less than one. We provide numerical experiments that show that our theoretical findings extend to Bounded Pareto distributed job sizes with tail parameter different to 1.

引用

页码：241 / 244

页数：4

共 50 条

[11] Size-based scheduling policies with inaccurate scheduling information
Lu, D
Sheng, HY
Dinda, P
IEEE COMPUTER SOCIETY'S 12TH ANNUAL INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS - PROCEEDINGS, 2004, : 31 - 38
[12] Non-Asymptotic Analysis for Relational Learning with One Network
He, Peng
Zhang, Changshui
ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 33, 2014, 33 : 320 - 327
[13] Testing for Anomalies: Active Strategies and Non-asymptotic Analysis
Kartik, Dhruva
Nayyar, Ashutosh
Mitra, Urbashi
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1277 - 1282
[14] Non-asymptotic Analysis of Biased Stochastic Approximation Scheme
Karimi, Belhal
Miasojedow, Blazej
Moulines, Eric
Wai, Hoi-To
CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
[15] Non-asymptotic fuzzy estimators based on confidence intervals
Sfiris, D. S.
Papadopoulos, B. K.
INFORMATION SCIENCES, 2014, 279 : 446 - 459
[16] Non-Asymptotic Analysis of Monte Carlo Tree Search
Shah D.
Xie Q.
Xu Z.
Performance Evaluation Review, 2020, 48 (01): : 31 - 32
[17] Non-asymptotic robustness analysis of regression depth median
Zuo, Yijun
JOURNAL OF MULTIVARIATE ANALYSIS, 2024, 199
[18] Energy and Buffer Size-Based Routing Protocol for Internet of Things
Ahanger, Tariq Ahamed
Subbalakshmi, Chatti
Narayana, M.V.
Lecture Notes in Networks and Systems, 2023, 565 LNNS : 297 - 304
[19] Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis
Jin, Jikai
Zhang, Bohang
Wang, Haiyang
Wang, Liwei
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
[20] Asymptotic and non-asymptotic analysis for a hidden Markovian process with a quantum hidden system
Hayashi, Masahito
Yoshida, Yuuya
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2018, 51 (33)

← 1 2 3 4 5 →