Performance Evaluation最新文献

{"title":"Spatial queues with nearest neighbour shifts","authors":"B.R. Vinay Kumar ,&nbsp;Lasse Leskelä","doi":"10.1016/j.peva.2024.102448","DOIUrl":"10.1016/j.peva.2024.102448","url":null,"abstract":"<div><div>This work studies queues in a Euclidean space. Consider <span><math><mi>N</mi></math></span> servers that are distributed uniformly in <span><math><msup><mrow><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow><mrow><mi>d</mi></mrow></msup></math></span>. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide whether to join the queue they arrived at, or shift to one of the nearest neighbours. Such shifting strategies affect the load on the servers, and may cause some of the servers to become overloaded. We derive a law of large numbers and a central limit theorem for the fraction of overloaded servers in the system as the total number of servers <span><math><mrow><mi>N</mi><mo>→</mo><mi>∞</mi></mrow></math></span>. Additionally, in the one-dimensional case (<span><math><mrow><mi>d</mi><mo>=</mo><mn>1</mn></mrow></math></span>), we evaluate the expected fraction of overloaded servers for any finite <span><math><mi>N</mi></math></span>. Numerical experiments are provided to support our theoretical results. Typical applications of the results include electric vehicles queueing at charging stations, and queues in airports or supermarkets.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"166 ","pages":"Article 102448"},"PeriodicalIF":1.0,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analyzing the age of information in prioritized status update systems under an interruption-based hybrid discipline","authors":"Tamer E. Fahim ,&nbsp;Sherif I. Rabia ,&nbsp;Ahmed H. Abd El-Malek ,&nbsp;Waheed K. Zahra","doi":"10.1016/j.peva.2024.102415","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102415","url":null,"abstract":"<div><p>Motivated by real-life applications, a special research-work interest has been recently directed towards the prioritized status update systems, which prioritize the update streams according to their timeliness constraints. The preferential service treatment between priority classes is commonly based on classical disciplines, preemption and non-preemption. However, both disciplines fail to give an even satisfaction between all classes. In our work, an interruption-based hybrid preemptive/non-preemptive discipline is proposed under a single-buffer system modeled as an M/M/1/2 priority queueing system. Each class being served (resp. buffered) can be preempted unless its recorded number of service preemptions reaches the predetermined in-service (resp. in-waiting) threshold. All thresholds between classes are the controlling parameters of the whole system’s performance. Using the stochastic hybrid system approach, the age of information (AoI) performance metric is analyzed in terms of its statistical average along with the higher-order moments, considering a general number of priority classes. Closed-form results are also obtained for some special cases, giving analytical insights about the AoI stability in heavy loading conditions. The average AoI and its dispersion are numerically investigated for the case of a three-class network. The significance of the proposed model is manifested in achieving a compromise satisfaction between all priority classes by a thorough adjustment of its threshold parameters. Two approaches are proposed to clarify the adjustment of these parameters. It turned out that the proposed hybrid discipline compensates for the limited buffer resource, achieving more promising performance with low design complexity and low cost. Moreover, the proposed scheme can operate under a wider span of the total offered load, through which the whole network satisfaction can be optimized under some legitimate constraints on the age-sensitive classes.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102415"},"PeriodicalIF":2.2,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140640916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Inference latency prediction for CNNs on heterogeneous mobile devices and ML frameworks","authors":"Zhuojin Li,&nbsp;Marco Paolieri,&nbsp;Leana Golubchik","doi":"10.1016/j.peva.2024.102429","DOIUrl":"10.1016/j.peva.2024.102429","url":null,"abstract":"<div><p>Due to the proliferation of inference tasks on mobile devices, state-of-the-art neural architectures are typically designed using Neural Architecture Search (NAS) to achieve good tradeoffs between machine learning accuracy and inference latency. While measuring inference latency of a huge set of candidate architectures during NAS is not feasible, latency prediction for mobile devices is challenging, because of hardware heterogeneity, optimizations applied by machine learning frameworks, and diversity of neural architectures. Motivated by these challenges, we first quantitatively assess the characteristics of neural architectures (specifically, convolutional neural networks for image classification), ML frameworks, and mobile devices that have significant effects on inference latency. Based on this assessment, we propose an operation-wise framework which addresses these challenges by developing operation-wise latency predictors and achieves high accuracy in end-to-end latency predictions, as shown by our comprehensive evaluations on multiple mobile devices using multicore CPUs and GPUs. To illustrate that our approach does not require expensive data collection, we also show that accurate predictions can be achieved on real-world neural architectures using only small amounts of profiling data.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102429"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141714597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Performance analysis of a collision channel with abandonments","authors":"Dieter Fiems ,&nbsp;Tuan Phung-Duc","doi":"10.1016/j.peva.2024.102424","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102424","url":null,"abstract":"<div><p>We consider a Markovian retrial queueing system with customer collisions and abandonment in the context of carrier-sense multiple access systems. Using <span><math><mi>z</mi></math></span>-transform techniques, we find a set of first-order differential equations for the probability generating functions of the orbit size when the server is empty, busy, or in the collision phase. We then rely on series expansion techniques to extract approximations for relevant performance measures from this set of differential equations. More precisely, we construct a numerical algorithm to calculate the terms in the series expansions of various factorial moments of the orbit size. To improve the accuracy of our series expansion approach, we apply Wynn’s epsilon algorithm which not only speeds up convergence, but also extends the region of convergence. We illustrate the accuracy of our approach by means of some numerical examples, and find that the method is both fast and accurate for a wide range of the parameter values.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102424"},"PeriodicalIF":2.2,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A comprehensive exploration of approximate DNN models with a novel floating-point simulation framework","authors":"Myeongjin Kwak,&nbsp;Jeonggeun Kim,&nbsp;Yongtae Kim","doi":"10.1016/j.peva.2024.102423","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102423","url":null,"abstract":"<div><p>This paper introduces <em>TorchAxf</em><span>¹</span>, a framework for fast simulation of diverse approximate deep neural network (DNN) models, including spiking neural networks (SNNs). The proposed framework utilizes various approximate adders and multipliers, supports industrial standard reduced precision floating-point formats, such as <span>bfloat16</span>, and accommodates user-customized precision representations. Leveraging GPU acceleration on the PyTorch framework, <em>TorchAxf</em> accelerates approximate DNN training and inference. In addition, it allows seamless integration of arbitrary approximate arithmetic algorithms with C/C++ behavioral models to emulate approximate DNN hardware accelerators.</p><p>We utilize the proposed <em>TorchAxf</em> framework to assess twelve popular DNN models under approximate multiply-and-accumulate (MAC) operations. Through comprehensive experiments, we determine the suitable degree of floating-point arithmetic approximation for these DNN models without significant accuracy loss and offer the optimal reduced precision formats for each DNN model. Additionally, we demonstrate that approximate-aware re-training can rectify errors and enhance pre-trained DNN models under reduced precision formats. Furthermore, <em>TorchAxf</em>, operating on GPU, remarkably reduces simulation time for complex DNN models using approximate arithmetic by up to 131.38<span><math><mo>×</mo></math></span> compared to the baseline optimized CPU implementation. Finally, we compare the proposed framework with state-of-the-art frameworks to highlight its superiority.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102423"},"PeriodicalIF":2.2,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141239841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Energy performance of off-grid green cellular base stations","authors":"Godlove Suila Kuaban ,&nbsp;Erol Gelenbe ,&nbsp;Tadeusz Czachórski ,&nbsp;Piotr Czekalski ,&nbsp;Valery Nkemeni","doi":"10.1016/j.peva.2024.102426","DOIUrl":"10.1016/j.peva.2024.102426","url":null,"abstract":"<div><p>The most energy-hungry parts of mobile networks are the base station sites, which consume around <span><math><mrow><mn>60</mn><mo>−</mo><mn>80</mn><mtext>%</mtext></mrow></math></span> of their total energy. One of the approaches for relieving this energy pressure on the electricity grid infrastructure and reducing the Operational Expenditures (OPEX) is to power base stations with renewable energy. However, the design of a green mobile network requires the dimensioning of the energy harvesting and storage systems through the estimation of the network’s energy demand. Therefore, this paper develops a diffusion-based modelling framework for solar-powered green off-grid base station sites. We apply this framework to evaluate the energy performance of homogeneous and hybrid energy storage systems supplied by harvested solar energy. We present the complete analysis, with numerical examples, to study the relationship between the design parameters and the energy performance metrics. The numerical computations demonstrate how the proposed framework can be applied to evaluate homogeneous and unconventional hybrid energy storage systems.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102426"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141408839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Preface: Special issue on ACM/SPEC ICPE 2023","authors":"Antinisca Di Marco (Research Track Co-Chairs) ,&nbsp;Petr Tůma (Research Track Co-Chairs)","doi":"10.1016/j.peva.2024.102430","DOIUrl":"10.1016/j.peva.2024.102430","url":null,"abstract":"","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102430"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141850193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic load balancing in energy packet networks","authors":"A. Bušić ,&nbsp;J. Doncel ,&nbsp;J.M. Fourneau","doi":"10.1016/j.peva.2024.102414","DOIUrl":"10.1016/j.peva.2024.102414","url":null,"abstract":"<div><p>Energy Packet Networks (EPNs) model the interaction between renewable sources generating energy following a random process and communication devices that consume energy. This network is formed by cells and, in each cell, there is a queue that handles energy packets and another queue that handles data packets. We assume Poisson arrivals of energy packets and of data packets to all the cells and exponential service times. We consider an EPN model with a dynamic load balancing where a cell without data packets can poll other cells to migrate jobs. This migration can only take place when there is enough energy in both interacting cells, in which case a batch of data packets is transferred and the required energy is consumed (i.e. it disappears). We consider that data packet also consume energy to be routed to the next station. Our main result shows that the steady-state distribution of jobs in the queues admits a product form solution provided that a stable solution of a fixed point equation exists. We prove sufficient conditions for irreducibility. Under these conditions and when the fixed point equation has a solution, the Markov chain is ergodic. We also provide sufficient conditions for the existence of a solution of the fixed point equation. We then focus on layered networks and we study the polling rates that must be set to achieve a fair load balancing, i.e., such that, in the same layer, the load of the queues handling data packets is the same. Our numerical experiments illustrate that dynamic load balancing satisfies several interesting properties such as performance improvement or fair load balancing.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102414"},"PeriodicalIF":2.2,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000191/pdfft?md5=fb96a067de593ae411502a62f32b10ab&pid=1-s2.0-S0166531624000191-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140777407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Retransmission performance in a stochastic geometric cellular network model","authors":"Ingemar Kaj,&nbsp;Taisiia Morozova","doi":"10.1016/j.peva.2024.102428","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102428","url":null,"abstract":"<div><p>Suppose sender–receiver transmission links in a downlink network at a given data rate are subject to fading, path loss, and inter-cell interference, and that transmissions either pass, suffer loss, or incur retransmission delay. We introduce a method to obtain the average activity level of the system required for handling the buffered work and from this derive the resulting coverage probability and key performance measures. The technique involves a family of stationary buffer distributions which is used to solve iteratively a nonlinear balance equation for the unknown busy-link probability and then identify throughput, loss probability, and delay. The results allow for a straightforward numerical investigation of performance indicators, are in special cases explicit and may be easily used to study the trade-off between reliability, latency, and data rate.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102428"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000336/pdfft?md5=97726bced24fd554d6c6c2472331ff66&pid=1-s2.0-S0166531624000336-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141484959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the performance evaluation of distributed join-idle-queue load balancing with and without token withdrawals","authors":"Benny Van Houdt","doi":"10.1016/j.peva.2024.102427","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102427","url":null,"abstract":"<div><p>Distributed Join-Idle-Queue load balancing is known to achieve vanishing waiting times in the large-scale limit provided that the number of dispatchers remains fixed, while the number of servers tends to infinity. When the number of dispatchers <span><math><mi>m</mi></math></span> scales to infinity together with the number of servers <span><math><mi>n</mi></math></span>, such that <span><math><mrow><mi>r</mi><mo>=</mo><mi>n</mi><mo>/</mo><mi>m</mi></mrow></math></span> remains fixed, the large-scale performance of Join-Idle-Queue load balancing is less clear as waiting times no longer vanish.</p><p>In this paper we first discuss some existing mean field models for distributed Join-Idle-Queue load balancing with <span><math><mrow><mi>r</mi><mo>=</mo><mi>n</mi><mo>/</mo><mi>m</mi></mrow></math></span> fixed and explain why the well-known model introduced in Lu et al. (2011) is not exact in the large-scale limit. The inexactness is caused by mixing two variants of distributed Join-Idle-Queue load balancing: a variant with and one without token withdrawals. Next we introduce mean field models for Join-Idle-Queue load balancing with and without token withdrawals, where an idle server places a token at a dispatcher with the shortest among <span><math><mi>d</mi></math></span> randomly chosen dispatchers.</p><p>The introduced mean field models in case of token withdrawals imply that for phase type distributed service times and a total job arrival rate of <span><math><mrow><mi>λ</mi><mi>n</mi><mo>&lt;</mo><mi>n</mi></mrow></math></span>, the response time of a job corresponds to that in a standard M/PH/1 queue with load <span><math><mrow><mi>λ</mi><msub><mrow><mi>q</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math></span>. The value of <span><math><msub><mrow><mi>q</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> can be determined numerically and depends on <span><math><mrow><mi>λ</mi><mo>,</mo><mi>r</mi></mrow></math></span> and <span><math><mi>d</mi></math></span>, but not on the job size distribution (apart from its mean). This simple behavior is lost if token withdrawals do not take place. For the models without withdrawals we develop fast numerical algorithms to determine the performance. We present simulation experiments that suggest that the unique fixed point of the introduced mean field models provides exact results in the large-scale limit.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102427"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}