Performance Evaluation最新文献

{"title":"The impact of load comparison errors on the power-of-d load balancing","authors":"Sanidhay Bhambay ,&nbsp;Arpan Mukhopadhyay ,&nbsp;Thirupathaiah Vasantam","doi":"10.1016/j.peva.2024.102408","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102408","url":null,"abstract":"<div><p>We consider a system with <span><math><mi>n</mi></math></span> unit-rate servers where jobs arrive according a Poisson process with rate <span><math><mrow><mi>n</mi><mi>λ</mi></mrow></math></span> (<span><math><mrow><mi>λ</mi><mo>&lt;</mo><mn>1</mn></mrow></math></span>). In the standard <em>Power-of-</em><span><math><mi>d</mi></math></span> or Pod scheme with <span><math><mrow><mi>d</mi><mo>≥</mo><mn>2</mn></mrow></math></span>, for each incoming job, a dispatcher samples <span><math><mi>d</mi></math></span> servers uniformly at random and sends the incoming job to the least loaded of the <span><math><mi>d</mi></math></span> sampled servers. However, in practice, load comparisons may not always be accurate. In this paper, we analyse the effects of noisy load comparisons on the performance of the Pod scheme. To test the robustness of the Pod scheme against load comparison errors, we assume an adversarial setting where, in the event of an error, the adversary assigns the incoming job to the worst possible server, i.e., the server with the maximum load among the <span><math><mi>d</mi></math></span> sampled servers. We consider two error models: <em>load-dependent</em> and <em>load-independent</em> errors. In the load-dependent error model, the adversary has limited power in that it is able to cause an error with probability <span><math><mrow><mi>ϵ</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span> only when the difference in the minimum and the maximum queue lengths of the <span><math><mi>d</mi></math></span> sampled servers is bounded by a constant threshold <span><math><mrow><mi>g</mi><mo>≥</mo><mn>0</mn></mrow></math></span>. For this type of errors, we show that, in the large system limit, the benefits of the Pod scheme are retained even if <span><math><mi>g</mi></math></span> and <span><math><mi>ϵ</mi></math></span> are arbitrarily large as long as the system is heavily loaded, i.e., <span><math><mi>λ</mi></math></span> is close to 1. In the load-independent error model, the adversary is assumed to be more powerful in that it can cause an error with probability <span><math><mi>ϵ</mi></math></span> independent of the loads of the sampled servers. For this model, we show that the performance benefits of the Pod scheme are retained only if <span><math><mrow><mi>ϵ</mi><mo>≤</mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span>; for <span><math><mrow><mi>ϵ</mi><mo>&gt;</mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span> we show that the stability region of the system reduces and the system performs poorly in comparison to the <em>random scheme</em>. Our mean-field analysis uses a new approach to characterise fixed points which neither have closed form solutions nor admit any recursion. Furthermore, we develop a generic approach to prove tightness and stability for any state-dependent load balancing scheme.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102408"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000130/pdfft?md5=e219034bb5ef6f93c589b57673e3885d&pid=1-s2.0-S0166531624000130-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139993482","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":"A dependence graph pattern mining method for processor performance analysis","authors":"Yawen Zheng ,&nbsp;Chenji Han ,&nbsp;Tingting Zhang ,&nbsp;Fuxin Zhang ,&nbsp;Jian Wang","doi":"10.1016/j.peva.2024.102409","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102409","url":null,"abstract":"<div><p>As the complexity of processor microarchitecture and applications increases, obtaining performance optimization knowledge, such as critical dependent chains, becomes more challenging. To tackle this issue, this paper employs pattern mining methods to analyze the critical path of processor micro-execution dependence graphs. We propose a high average utility pattern mining algorithm called Dependence Graph Miner (DG-Miner) based on the characteristics of dependence graphs. DG-Miner overcomes the limitations of current pattern mining algorithms for dependence graph pattern mining by offering support for variable utility, candidate generation using endpoint matching, the adjustable upper bound, and the concise pattern judgment mechanism. Experiments reveal that, compared with existing upper bound candidate generation methods, the adjustable upper bound reduces the number of candidate patterns by 28.14% and the running time by 27% on average. The concise pattern judgment mechanism enhances the conciseness of mining results by 16.31% and reduces the running time by 39.82%. Furthermore, DG-Miner aids in identifying critical dependent chains, critical program regions, and performance exceptions.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102409"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140014628","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":"Editorial: Special issue on IFIP performance 2023","authors":"","doi":"10.1016/j.peva.2023.102393","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102393","url":null,"abstract":"","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102393"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000639/pdfft?md5=009149602188b30a410785f5299fddf3&pid=1-s2.0-S0166531623000639-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138467707","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":"Two families of indexable partially observable restless bandits and Whittle index computation","authors":"Nima Akbarzadeh,&nbsp;Aditya Mahajan","doi":"10.1016/j.peva.2023.102394","DOIUrl":"10.1016/j.peva.2023.102394","url":null,"abstract":"<div><p>We consider the restless bandits with general finite state space under partial observability with two observational models: first, the state of each bandit is not observable at all, and second, the state of each bandit is observable when it is selected. Under the assumption that the models satisfy a restart property, we prove that both models are indexable. For the first model, we derive a closed-form expression for the Whittle index. For the second model, we propose an efficient algorithm to compute the Whittle index by exploiting the qualitative properties of the optimal policy. We present detailed numerical experiments for multiple instances of machine maintenance problem. The result indicates that the Whittle index policy outperforms myopic policy and can be close to optimal in different setups.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102394"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000640/pdfft?md5=98383ecb3b115be5f69d3bebd74f984f&pid=1-s2.0-S0166531623000640-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495078","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":"Marginal and joint distribution of inter-departure times for a PH/PH/c queue","authors":"Ruth Sagron ,&nbsp;Yoav Kerner","doi":"10.1016/j.peva.2023.102383","DOIUrl":"10.1016/j.peva.2023.102383","url":null,"abstract":"<div><p>In this paper, we introduce the Laplace–Stieltjes transform (LST) of the inter-departure time distribution in a <em>PH/PH/c</em> queue, and the two-dimensional joint LST of two consecutive inter-departure times to construct their correlation structure. We exploit the properties of phase-type (PH) random variables, as well as the steady-state distribution of the underlying continuous-time Markov chain in a <em>PH/PH</em>/<em>c</em> queue to construct these LSTs. We demonstrate our approach through numerical examples, while validating the results. Later, we analyze the correlation between two consecutive inter-departure times for various <em>PH/PH/c</em> queues. We observe that, if the fundamental elements of the queue have high (low) variability, then the correlation is positive (negative).</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102383"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000536/pdfft?md5=b3ce45055b5a49cf2750969c2b7c7d10&pid=1-s2.0-S0166531623000536-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135411886","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":"Decentralized fault tolerant source localization without sensor parameters in wireless sensor networks","authors":"Akram Hussain,&nbsp;Yuan Luo","doi":"10.1016/j.peva.2023.102395","DOIUrl":"10.1016/j.peva.2023.102395","url":null,"abstract":"<div><p>In this paper, we study the source (event) localization problem in decentralized wireless sensor networks (WSNs) under faulty sensor nodes without knowledge of the sensor parameters. Source localization has many applications, such as localizing WiFi hotspots and mobile users. Some works in the literature localize the source by utilizing the knowledge or estimates of the fault probability of each sensor node or the region of influence of the source. However, this paper proposes two approaches: the hitting set and feature selection for estimating the source location without any knowledge of the sensor parameters under faulty sensor nodes in WSN. The proposed approaches provide better or comparable source localization performances. For the hitting set approach, we also derive a lower bound on the required number of samples. In addition, we extend the proposed methods for localizing multiple sources. Finally, we provide extensive simulations to illustrate the performances of the proposed methods against the centroid, maximum likelihood (ML), fault-tolerant ML (FTML), and subtract on negative add on positive (SNAP) estimators. The proposed approaches significantly outperform the centroid and maximum likelihood estimators for faulty sensor nodes while providing comparable or better performance to FTML or SNAP algorithm. In addition, we use real-world WiFi data set to localize the source in comparison to the support vector machine based estimator in the literature, where the proposed methods outperformed the estimator.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102395"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000652/pdfft?md5=917546a42fc91c4d2235d2f09f3e4318&pid=1-s2.0-S0166531623000652-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138553529","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":"ASIP tandem queues with consumption","authors":"Yaron Yeger ,&nbsp;Onno Boxma ,&nbsp;Jacques Resing ,&nbsp;Maria Vlasiou","doi":"10.1016/j.peva.2023.102380","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102380","url":null,"abstract":"<div><p>The Asymmetric Inclusion Process (ASIP) tandem queue is a model of stations in series with a gate after each station. At a gate opening, all customers in that station instantaneously move to the next station unidirectionally. In our study, we enhance the ASIP model by introducing the capability for individual customers to independently move from one station to the next, and by allowing both individual customers and batches of customers from any station to exit the system. The model is inspired by the process by which macromolecules are transported within cells.</p><p>We present a comprehensive analysis of various aspects of the queue length in the ASIP tandem model. Specifically, we provide an exact analysis of queue length moments and correlations and, under certain circumstances, of the queue length distribution. Furthermore, we propose an approximation for the joint queue length distribution. This approximation is derived using three different approaches, one of which employs the concept of the replica mean-field limit. Among other results, our analysis offers insight into the extent to which nutrients can support the survival of a cell.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102380"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000500/pdfft?md5=979d6daae1fd3cf701761a51f472a8ff&pid=1-s2.0-S0166531623000500-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92030401","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":"Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times","authors":"Yige Hong ,&nbsp;Ziv Scully","doi":"10.1016/j.peva.2023.102377","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102377","url":null,"abstract":"<div><p>How should we schedule jobs to minimize mean queue length? In the preemptive M/G/1 queue, we know the optimal policy is the Gittins policy, which uses any available information about jobs’ remaining service times to dynamically prioritize jobs. For models more complex than the M/G/1, optimal scheduling is generally intractable. This leads us to ask: beyond the M/G/1, does Gittins still perform well?</p><p>Recent results show Gittins performs well in the M/G/<em>k</em>, meaning that its additive suboptimality gap is bounded by an expression which is negligible in heavy traffic. But allowing multiple servers is just one way to extend the M/G/1, and most other extensions remain open. Does Gittins still perform well with non-Poisson arrival processes? Or if servers require setup times when transitioning from idle to busy?</p><p>In this paper, we give the first analysis of the Gittins policy that can handle any combination of (a) multiple servers, (b) non-Poisson arrivals, and (c) setup times. Our results thus cover the G/G/1 and G/G/<em>k</em>, with and without setup times, bounding Gittins’s suboptimality gap in each case. Each of (a), (b), and (c) adds a term to our bound, but all the terms are negligible in heavy traffic, thus implying Gittins’s heavy-traffic optimality in all the systems we consider. Another consequence of our results is that Gittins is optimal in the M/G/1 with setup times at all loads.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102377"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000470/pdfft?md5=688fb1b83300cd7ea4fea9d191278825&pid=1-s2.0-S0166531623000470-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92030400","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":"The effect of network delays on Distributed Ledgers based on Directed Acyclic Graphs: A mathematical model","authors":"Navdeep Kumar ,&nbsp;Alexandre Reiffers-Masson ,&nbsp;Isabel Amigo ,&nbsp;Santiago Ruano Rincón","doi":"10.1016/j.peva.2023.102392","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102392","url":null,"abstract":"<div><p>We present a new stochastic model for the evolution of Directed Acyclic Graphs (DAG)-based distributed ledgers (DL), under the presence of heterogeneous delay. This model is used to analyse the performance metrics of the DL, showing in particular that the number of unapproved messages, in expectation, does not diverge to infinity, even under the presence of delay. We propose an analysis based on conveniently defined sets, as well as an alternative drift-based analysis. The former allows to get a bound on the average number of unapproved messages, while the latter, through a simpler analysis, allows to prove the existence of such bound. For particular scenarios, we are able to derive the expected value of the drift of unapproved messages, through a Markov process-based approach. State-of-the-art mathematical models trying to capture the impact of delays on the performance of such DLs rely on some particular simplifications. In contrast, through our model, we are able to analytically derive similar performance guarantees, in a more realistic setup. In particular, we focus on IOTA foundation’s tangle, while our results can be extended to other DAG-based distributed ledgers. We compare our results to results obtained in a real testbed, showing good accordance between them.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102392"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000627/pdfft?md5=418849af0d02f48109fd2defe85bc15f&pid=1-s2.0-S0166531623000627-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138474715","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":"POBO: Safe and optimal resource management for cloud microservices","authors":"Hengquan Guo ,&nbsp;Hongchen Cao ,&nbsp;Jingzhu He,&nbsp;Xin Liu,&nbsp;Yuanming Shi","doi":"10.1016/j.peva.2023.102376","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102376","url":null,"abstract":"<div><p>Resource management in microservices<span> is challenging due to the uncertain latency–resource relationship, dynamic environment, and strict Service-Level Agreement (SLA) guarantees. This paper presents a Pessimistic and Optimistic Bayesian Optimization<span><span> framework, named POBO, for safe and optimal resource configuration for microservice applications. POBO leverages </span>Bayesian learning to estimate the uncertain latency–resource functions and combines primal–dual and penalty-based optimization to maximize resource efficiency while guaranteeing strict SLAs. We prove that POBO can achieve sublinear regret and SLA violation against the optimal resource configuration in hindsight. We have implemented a prototype of POBO and conducted extensive experiments on a real-world microservice application. Our results show that POBO can find the safe and optimal configuration efficiently, outperforming Kubernetes’ built-in auto-scaling module and the state-of-the-art algorithms.</span></span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"162 ","pages":"Article 102376"},"PeriodicalIF":2.2,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49874154","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}