ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)最新文献_第8页

False-Positive Probability and Compression Optimization for Tree-Structured Bloom Filters 树状结构布隆滤波器的假正概率与压缩优化

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-09-21 DOI: 10.1145/2940324

Yongquan Fu, E. Biersack

引用次数: 2

A Truthful Incentive Mechanism for Emergency Demand Response in Geo-Distributed Colocation Data Centers 地理分布式托管数据中心应急需求响应的真实激励机制

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-09-21 DOI: 10.1145/2950046

Linquan Zhang, Shaolei Ren, Chuan Wu, Zongpeng Li

{"title":"A Truthful Incentive Mechanism for Emergency Demand Response in Geo-Distributed Colocation Data Centers","authors":"Linquan Zhang, Shaolei Ren, Chuan Wu, Zongpeng Li","doi":"10.1145/2950046","DOIUrl":"https://doi.org/10.1145/2950046","url":null,"abstract":"Data centers are key participants in demand response programs, including emergency demand response (EDR), in which the grid coordinates consumers of large amounts of electricity for demand reduction in emergency situations to prevent major economic losses. While existing literature concentrates on owner-operated data centers, this work studies EDR in geo-distributed multitenant colocation data centers in which servers are owned and managed by individual tenants. EDR in colocation data centers is significantly more challenging due to lack of incentives to reduce energy consumption by tenants who control their servers and are typically on fixed power contracts with the colocation operator. Consequently, to achieve demand reduction goals set by the EDR program, the operator has to rely on the highly expensive and/or environmentally unfriendly on-site energy backup/generation. To reduce cost and environmental impact, an efficient incentive mechanism is therefore needed, motivating tenants’ voluntary energy reduction in the case of EDR. This work proposes a novel incentive mechanism, Truth-DR, which leverages a reverse auction to provide monetary remuneration to tenants according to their agreed energy reduction. Truth-DR is computationally efficient, truthful, and achieves 2-approximation in colocation-wide social cost. Trace-driven simulations verify the efficacy of the proposed auction mechanism.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129909328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Contention-Aware Workload Placement for In-Memory Databases in Cloud Environments 云环境中内存数据库的竞争感知工作负载安置

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-09-14 DOI: 10.1145/2961888

Karsten Molka, G. Casale

引用次数: 7

PEAS 豌豆

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-08-02 DOI: 10.1145/2930659

A. Papadopoulos, A. Ali-Eldin, Karl-Erik Årzén, Johan Tordsson, E. Elmroth

{"title":"PEAS","authors":"A. Papadopoulos, A. Ali-Eldin, Karl-Erik Årzén, Johan Tordsson, E. Elmroth","doi":"10.1145/2930659","DOIUrl":"https://doi.org/10.1145/2930659","url":null,"abstract":"Numerous auto-scaling strategies have been proposed in the past few years for improving various Quality of Service (QoS) indicators of cloud applications, for example, response time and throughput, by adapting the amount of resources assigned to the application to meet the workload demand. However, the evaluation of a proposed auto-scaler is usually achieved through experiments under specific conditions and seldom includes extensive testing to account for uncertainties in the workloads and unexpected behaviors of the system. These tests by no means can provide guarantees about the behavior of the system in general conditions. In this article, we present a Performance Evaluation framework for Auto-Scaling (PEAS) strategies in the presence of uncertainties. The evaluation is formulated as a chance constrained optimization problem, which is solved using scenario theory. The adoption of such a technique allows one to give probabilistic guarantees of the obtainable performance. Six different auto-scaling strategies have been selected from the literature for extensive test evaluation and compared using the proposed framework. We build a discrete event simulator and parameterize it based on real experiments. Using the simulator, each auto-scaler’s performance is evaluated using 796 distinct real workload traces from projects hosted on the Wikimedia foundations’ servers, and their performance is compared using PEAS. The evaluation is carried out using different performance metrics, highlighting the flexibility of the framework, while providing probabilistic bounds on the evaluation and the performance of the algorithms. Our results highlight the problem of generalizing the conclusions of the original published studies and show that based on the evaluation criteria, a controller can be shown to be better than other controllers.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

A Control-Theoretic Analysis of Low-Priority Congestion Control Reprioritization under AQM AQM下低优先级拥塞控制重优先化的控制理论分析

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-08-02 DOI: 10.1145/2934652

L. D. Cicco, YiXi Gong, D. Rossi, Emilio Leonardi

{"title":"A Control-Theoretic Analysis of Low-Priority Congestion Control Reprioritization under AQM","authors":"L. D. Cicco, YiXi Gong, D. Rossi, Emilio Leonardi","doi":"10.1145/2934652","DOIUrl":"https://doi.org/10.1145/2934652","url":null,"abstract":"Recently, a negative interplay has been shown to arise when scheduling/Active Queue Management (AQM) techniques and low-priority congestion control protocols are used together; namely, AQM resets the relative level of priority among congestion control protocols. This work explores this issue by carrying out a control-theoretic analysis of the dynamical system to prove some fundamental properties that fully characterize the reprioritization phenomenon. In particular, (i) we provide the closed-form solution of the equilibrium in the open loop (i.e., fixing a target loss probability p); (ii) we provide a stability analysis and a characterization of the reprioritization phenomenon when closing the loop with AQM (i.e., that dynamically adjusts the system loss probability). Our results are important as the characterization of the reprioritization phenomenon is not only quantitatively accurate for the specific protocols and AQM considered but also qualitatively accurate for a broader range of congestion control protocol and AQM combinations. Finally, while we find a sufficient condition to avoid the reprioritization phenomenon, we also show, at the same time, such conditions to be likely impractical: Therefore, we propose a simple and practical system-level solution that is able to reinstate priorities among protocols.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"7 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114109862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Performance of a Fixed Reward Incentive Scheme for Two-hop DTNs with Competing Relays 具有竞争中继的两跳DTNs固定奖励激励方案的性能

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-06-14 DOI: 10.1145/3325288

T. Nguyen, O. Brun, B. Prabhu

引用次数: 6

Energy--Performance Trade-Offs via the EP Queue 能量-通过EP队列进行性能权衡

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-06-07 DOI: 10.1145/2818726

P. Harrison, N. Patel, W. Knottenbelt

引用次数: 6

Performance Evaluation of Dynamic Page Allocation Strategies in SSDs 固态硬盘动态页面分配策略的性能评价

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-06-07 DOI: 10.1145/2829974

Arash Tavakkol, Pooyan Mehrvarzy, M. Arjomand, H. Sarbazi-Azad

{"title":"Performance Evaluation of Dynamic Page Allocation Strategies in SSDs","authors":"Arash Tavakkol, Pooyan Mehrvarzy, M. Arjomand, H. Sarbazi-Azad","doi":"10.1145/2829974","DOIUrl":"https://doi.org/10.1145/2829974","url":null,"abstract":"Solid-state drives (SSDs) with tens of NAND flash chips and highly parallel architectures are widely used in enterprise and client storage systems. As any write operation in NAND flash is preceded by a slow erase operation, an out-of-place update mechanism is used to distribute writes through SSD storage space to postpone erase operations as far as possible. SSD controllers use a mapping table along with a specific allocation strategy to map logical host addresses to physical page addresses within storage space. The allocation strategy is further responsible for accelerating I/O operations through better striping of physical addresses over SSD parallel resources. Proposals already exist for using static logical-to-physical address mapping that does not balance the I/O traffic load within the SSD, and its efficiency highly depends on access patterns. A more balanced distribution of I/O operations is to alternate resource allocation in a round-robin manner irrespective of logical addresses. The number of resources that can be dynamically allocated in this fashion is defined as the degree of freedom, and to the best of our knowledge, there has been no research thus far to show what happens if different degrees of freedom are used in allocation strategy. This article explores the possibility of using dynamic resource allocation and identifies key design opportunities that it presents to improve SSD performance. Specifically, using steady-state analysis of SSDs, we show that dynamism helps to mitigate performance and endurance overheads of garbage collection. Our steady-state experiments indicate that midrange/high-end SSDs with dynamic allocation can provide I/O operations per second (IOPS) improvement of up to 3.3x/9.6x, response time improvement of up to 56%/32%, and about 88%/96% average reduction in the standard deviation of erase counts of NAND flash blocks.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133529132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30

Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses 高速客车中禁止重叠码的编码率分析

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-05-10 DOI: 10.1145/2846091

Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, D. Lee, Cheng-Yu Chen

{"title":"Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses","authors":"Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, D. Lee, Cheng-Yu Chen","doi":"10.1145/2846091","DOIUrl":"https://doi.org/10.1145/2846091","url":null,"abstract":"One of the main problems in deep submicron designs of high-speed buses is propagation delay due to the crosstalk effect. To alleviate the crosstalk effect, there are several types of crosstalk avoidance codes proposed in the literature. In this article, we analyze the coding rates of forbidden overlap codes (FOCs) that avoid “010 → 101” transition and “101 → 010” transition on any three adjacent wires in a bus. We first compute the maximum achievable coding rate of FOCs and the maximum coding rate of memoryless FOCs. Our numerical results show that there is a significant gap between the maximum coding rate of memoryless FOCs and the maximum achievable rate. We then analyze the coding rates of FOCs generated from the bit-stuffing algorithm. Our worst-case analysis yields a tight lower bound of the coding rate of the bit-stuffing algorithm. Under the assumption of Bernoulli inputs, we use a Markov chain model to compute the coding rate of a bus with n wires under the bit-stuffing algorithm. The main difficulty of solving such a Markov chain model is that the number of states grows exponentially with respect to the number of wires n. To tackle the problem of the curse of dimensionality, we derive an approximate analysis that leads to a recursive closed-form formula for the coding rate over the nth wire. Our approximations match extremely well with the numerical results from solving the original Markov chain for n ⩽ 10 and the simulation results for n ⩽ 3000. Our analysis of coding rates of FOCs could be helpful in understanding the trade-off between propagation delay and coding rate among various crosstalk avoidance codes in the literature. In comparison with the forbidden transition codes (FTCs) that have shorter propagation delay than that of FOCs, our numerical results show that the coding rates of FOCs are much higher than those of FTCs.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130633269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Estimation of Flow Distributions from Sampled Traffic 基于采样流量的流量分布估计

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2016-05-07 DOI: 10.1145/2891106

Nelson Antunes, V. Pipiras

引用次数: 14