Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools最新文献

How to improve the performance of the d-choices garbage collection algorithm in flash-based SSDs 如何提高基于闪存的ssd中d-choices垃圾收集算法的性能

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388833

Robin Verschoren, B. V. Houdt

{"title":"How to improve the performance of the d-choices garbage collection algorithm in flash-based SSDs","authors":"Robin Verschoren, B. V. Houdt","doi":"10.1145/3388831.3388833","DOIUrl":"https://doi.org/10.1145/3388831.3388833","url":null,"abstract":"The performance of flash-based solid state drives is greatly impacted by the garbage collection algorithm. The d-choices garbage collection algorithm, which selects a victim block with the fewest number of valid pages among d randomly selected blocks, is known to perform well in terms of the write amplification. However, the number of erasures performed on a block may be quite unbalanced, which reduces the lifespan of SSDs that can only tolerate a limited number of erasures per block. This unequal wear is caused by the hot/cold data separation used to achieve a low write amplification, as blocks holding hot data tend to endure more erasures. Methods to reduce this unequal wear often cause a significant increase in the write amplification (which slows down the device). In this paper we propose a new mechanism that allows us to severely reduce the unequal wear and thus improve the lifespan of the drive, without a significant increase in the write amplification. In fact, in many cases this mechanism even reduces the write amplification (eliminating the trade-off between low write amplification and a large lifespan altogether). To assess the performance of this new mechanism we rely both on a mean field model and simulation experiments.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127272698","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}

引用次数: 2

Improving Delay Bounds in the Stochastic Network Calculus by Using less Stochastic Inequalities 用较少的随机不等式改进随机网络微积分中的延迟界

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388848

Paul Nikolaus, J. Schmitt

引用次数: 8

FJProf

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388851

Eduardo Rosales, Andrea Rosà, Walter Binder

{"title":"FJProf","authors":"Eduardo Rosales, Andrea Rosà, Walter Binder","doi":"10.1145/3388831.3388851","DOIUrl":"https://doi.org/10.1145/3388831.3388851","url":null,"abstract":"Fork/join applications are divide-and-conquer algorithms recursively forking tasks that are executed in parallel, waiting for them to complete, and then typically joining their results. An efficient fork/join application maximizes parallelism while minimizing overheads, and maximizes locality while minimizing contention. However, there is no unique optimal implementation that best resolves such tradeoffs and failing in balancing them may lead to fork/join applications suffering from several issues (e.g., suboptimal forking, load imbalance, excessive synchronization), possibly compromising the benefits of task-parallel execution. Moreover, there is a lack of profilers enabling performance analysis of a fork/join application. As a result, developers are often required to implement their own tools to analyze fork/join applications, which could be time-consuming, error-prone, and is often beyond the expertise of the developer. In this paper, we present FJProf, a novel profiler which accurately collects runtime metrics to allow characterizing several performance attributes specific to a fork/join application running on a single Java Virtual Machine (JVM) in a shared-memory multi-core. FJProf reports information and graphics to developers that help them understand the details of any fork/join processing exposed by a parallel application running on the JVM. We show how FJProf supports performance analysis by characterizing a fork/join application from the Renaissance benchmark suite.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126469070","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}

引用次数: 6

Dynamic GSPNs: formal definition, transformation towards GSPNs and formal verification 动态gspn:形式化定义、向gspn转换和形式化验证

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388854

Samir Tigane, L. Kahloul, S. Baarir, Samir Bourekkache

{"title":"Dynamic GSPNs: formal definition, transformation towards GSPNs and formal verification","authors":"Samir Tigane, L. Kahloul, S. Baarir, Samir Bourekkache","doi":"10.1145/3388831.3388854","DOIUrl":"https://doi.org/10.1145/3388831.3388854","url":null,"abstract":"In their basic form, Petri nets face several shortcomings in the design/analysis of reconfigurable discrete-event systems. Hence, researchers have enriched Petri nets with dynamic structure. Such formalisms allow explicitly modeling system features and its structure evolution in two separate levels. To reuse available tools in verifying dynamic-structure Petri nets, several formalisms flatten dynamic nets into basic Petri nets. To the best of our knowledge, this kind of approaches copes only with dynamic topology, i.e. sets of places and transitions cannot be changed. However, this restriction limits severely the modeling power of these formalisms. In this paper, we propose a new formalism, called dynamic generalized stochastic Petri nets (D-GSPNs), that allows modeling dynamic sets of places and transitions, as well as, keeping the possibility to transform D-GSPNs into semantic-equivalent GSPNs that preserve their stochastic behaviors. Hence, D-GSPNs preserve the property decidability of GSPNs, as well as, the panoply of available verification tools of GSPNs is still usable in D-GSPNs analysis. The feasibility of the proposed formalism is demonstrated on an illustrative example of a reconfigurable manufacturing system.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131307786","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}

引用次数: 4

Performance Degradation in Parallel-Server Systems with Shared Resources 具有共享资源的并行服务器系统的性能退化

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388853

Esa Hyytiä, Rhonda Righter

{"title":"Performance Degradation in Parallel-Server Systems with Shared Resources","authors":"Esa Hyytiä, Rhonda Righter","doi":"10.1145/3388831.3388853","DOIUrl":"https://doi.org/10.1145/3388831.3388853","url":null,"abstract":"Parallel server systems are ubiquitous. Multicore CPUs are in practically every personal device from mobile handsets to high-end desktop PCs. At larger scale, data centers consist of a huge number of physical servers often shared by multiple users (for economic reasons). Moreover, the simultaneous users are typically unaware of each other due to reasons that can be technical (cf. security & privacy), practical (coordination layer would add complexity) and business related (usage can be business sensitive information). This results in server-side variability in terms of unpredictable response times. We study means for tackling these challenges. In particular, we consider a model where multiple users (dispatchers) route their jobs to a pool of servers using different (dispatching) policies. The goal is to determine how different policies interact: whether users' decisions support each other, or if some decisions are simply counterproductive. The lack of coordination is shown to increase, e.g., the mean response times, with two common and robust dispatching policies: the static Size-Interval-Task Assignment (SITA) and the dynamic Round-Robin (RR). We refer to this phenomenon as the price of ignorance.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966809","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}

引用次数: 1

The busy period distribution of the superposition of periodic arrivals with vacation time 周期性到达与休假时间叠加的繁忙期分布

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388857

J. V. D. Eynde, C. Blondia

引用次数: 1

Energy Packet Networks with Finite Capacity Energy Queues 有限容量能量队列的能量分组网络

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388841

Sébastien Samain, J. Doncel, A. Bušić, J. Fourneau

引用次数: 2

Macroscopic modelling and analysis of rush-hour congestion 高峰时段拥堵的宏观建模与分析

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388849

D. Fiems, B. Prabhu

引用次数: 2

QPS-r: A Cost-Effective Iterative Switching Algorithm for Input-Queued Switches QPS-r:一种具有成本效益的输入队列交换迭代算法

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388836

Long Gong, Jun Xu, Liang Liu, S. T. Maguluri

{"title":"QPS-r: A Cost-Effective Iterative Switching Algorithm for Input-Queued Switches","authors":"Long Gong, Jun Xu, Liang Liu, S. T. Maguluri","doi":"10.1145/3388831.3388836","DOIUrl":"https://doi.org/10.1145/3388831.3388836","url":null,"abstract":"In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed for each switching cycle, or time slot. It is a challenging research problem to design switching algorithms that produce high-quality matchings yet have a very low computational complexity when the switch has a large number of ports. Indeed, there appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the quality of the computed matchings. Parallel maximal matching algorithms (adapted for switching) appear to be a sweet tradeoff point in this regard. On one hand, they provide the following performance guarantees: Using maximal matchings as crossbar schedules results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N) average delay bounds for various traffic arrival processes. On the other hand, their computational complexities can be as low as O(log2 N) per port/processor, which is much lower than those of the algorithms for finding matchings of higher qualities such as maximum weighted matching. In this work, we propose QPS-r, a parallel iterative switching algorithm that has the lowest possible computational complexity: O(1) per port. Yet, the matchings that QPS-r computes have the same quality as maximal matchings in the following sense: Using such matchings as crossbar schedules results in exactly the same aforementioned provable throughput and delay guarantees as using maximal matchings, as we show using Lyapunov stability analysis. Although QPS-r builds upon an existing add-on technique called Queue-Proportional Sampling (QPS), we are the first to discover and prove this nice property of such matchings. We also demonstrate that QPS-3 (running 3 iterations) has comparable empirical throughput and delay performances as iSLIP (running log2 N iterations), a refined and optimized representative maximal matching algorithm adapted for switching.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853923","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}

引用次数: 1

Deployment Planning in Vehicular Supported Cellular Networks 车载支持蜂窝网络中的部署规划

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388855

Nadav Lavi, Eliran Sherzer, H. Levy

{"title":"Deployment Planning in Vehicular Supported Cellular Networks","authors":"Nadav Lavi, Eliran Sherzer, H. Levy","doi":"10.1145/3388831.3388855","DOIUrl":"https://doi.org/10.1145/3388831.3388855","url":null,"abstract":"We consider the planning problem of a unique cellular model in which parked vehicles, termed Vehicular Relay Nodes (VeRNs), assist the network by relaying data to and from users. VeRNs can lower cellular network load and provide a scalable solution to the explosive growth in data demand. The VeRN model presents a new paradigm that significantly differs from toady's cellular deployments that are based solely on fixed infrastructure. Consequently, known deployment planning methods are inapplicable. The complexity arises from utilizing vehicles which adds stochastic resource variables to the stochastic data demand variables, as well as from the deployment structure/topology and the cost trade-offs between fixed resources, stochastic resources, and user demand. We present a holistic solution for this unique deployment planning problem. Our solution is based on the combination of three methodologies, which enables us establishing the convexity, and thus greediness properties of the problem. This allows focusing the analysis on deriving marginal values, instead of full system analysis. We further propose an approach to approximate the marginal values supported by effective state space bounds. Numerical results show that the method is efficient, and addresses various distribution settings.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643803","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}

引用次数: 0