Measurement and Modeling of Computer Systems最新文献_第10页

The design space of probing algorithms for network-performance measurement 网络性能测量探测算法的设计空间

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465765

A. D. Jaggard, Swara Kopparty, V. Ramachandran, R. Wright

{"title":"The design space of probing algorithms for network-performance measurement","authors":"A. D. Jaggard, Swara Kopparty, V. Ramachandran, R. Wright","doi":"10.1145/2465529.2465765","DOIUrl":"https://doi.org/10.1145/2465529.2465765","url":null,"abstract":"We present a framework for the design and analysis of probing methods to monitor network performance, an important technique for collecting measurements in tasks such as fault detection. We use this framework to study the interaction among numerous, possibly conflicting, optimization goals in the design of a probing algorithm. We present a rigorous definition of a probing-algorithm design problem that can apply broadly to network-measurement scenarios. We also present several metrics relevant to the analysis of probing algorithms, including probing frequency and network coverage, communication and computational overhead, and the amount of algorithm state required. We show inherent tradeoffs among optimization goals and give hardness results for achieving some combinations of optimization goals. We also consider the possibility of developing approximation algorithms for achieving some of the goals and describe a randomized approach as an alternative, evaluating it using our framework. Our work aids future development of low-overhead probing techniques and introduces principles from IP-based networking to theoretically grounded approaches for concurrent path-selection problems.","PeriodicalId":306456,"journal":{"name":"Measurement and Modeling of Computer Systems","volume":"38 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126604690","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}

引用次数: 20

Elastic paging 弹性分页

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2479781

Enoch Peserico

引用次数: 7

Delays and mixing times in random-access networks 随机存取网络中的延迟和混合时间

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465759

N. Bouman, S. Borst, J. V. Leeuwaarden

引用次数: 14

Multipath TCP algorithms: theory and design 多路径TCP算法:理论与设计

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2466585

Qiuyu Peng, A. Elwalid, S. Low

引用次数: 59

Accelerating GPGPU architecture simulation 加速GPGPU架构仿真

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465540

Zhibin Yu, L. Eeckhout, Nilanjan Goswami, Tao Li, L. John, Hai Jin, Chengzhong Xu

{"title":"Accelerating GPGPU architecture simulation","authors":"Zhibin Yu, L. Eeckhout, Nilanjan Goswami, Tao Li, L. John, Hai Jin, Chengzhong Xu","doi":"10.1145/2465529.2465540","DOIUrl":"https://doi.org/10.1145/2465529.2465540","url":null,"abstract":"Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.","PeriodicalId":306456,"journal":{"name":"Measurement and Modeling of Computer Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127271583","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}

引用次数: 13

Characterizing the impact of process variation on write endurance enhancing techniques for non-volatile memory systems 表征进程变化对非易失性存储系统写入持久性增强技术的影响

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465755

M. Cintra, Niklas Linkewitsch

{"title":"Characterizing the impact of process variation on write endurance enhancing techniques for non-volatile memory systems","authors":"M. Cintra, Niklas Linkewitsch","doi":"10.1145/2465529.2465755","DOIUrl":"https://doi.org/10.1145/2465529.2465755","url":null,"abstract":"Much attention has been given recently to a set of promising non-volatile memory technologies, such as PCM, STT-MRAM, and ReRAM. These, however, have limited endurance relative to DRAM. Potential solutions to this endurance challenge exist in the form of fine-grain wear leveling techniques and aggressive error tolerance approaches. While the existing approaches to wear leveling and error tolerance are sound and demonstrate true potential, their studies have been limited in that i) they have not considered the interactions between wear leveling and error tolerance and ii) they have assumed a simple write endurance failure model where all cells fail uniformly. In this paper we perform a thorough study and characterize such interactions and the effects of more realistic non-uniform endurance models under various workloads, both synthetic and derived from benchmarks. This study shows that, for instance, variability in the endurance of cells significantly affects wear leveling and error tolerance mechanisms and the values of their tuning parameters. It also shows that these mechanisms interact in subtle ways, sometimes cancelling and sometimes boosting each other's impact on overall endurance of the device.","PeriodicalId":306456,"journal":{"name":"Measurement and Modeling of Computer Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133951088","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}

引用次数: 14

FaRNet: fast recognition of high multi-dimensional network traffic patterns FaRNet:快速识别高多维网络流量模式

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465743

Ignasi Paredes-Oliva, P. Barlet-Ros, X. Dimitropoulos

引用次数: 3

Delivering fairness and priority enforcement on asymmetric multicore systems via OS scheduling 通过操作系统调度在非对称多核系统上提供公平性和优先级强制执行

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465532

J. C. Saez, Fernando Castro, D. Chaver, M. Prieto

引用次数: 6

Detecting user dissatisfaction and understanding the underlying reasons 发现用户的不满并了解潜在的原因

Measurement and Modeling of Computer Systems Pub Date : 2013-06-17 DOI: 10.1145/2465529.2465538

Å. Arvidsson, Y. Zhang

{"title":"Detecting user dissatisfaction and understanding the underlying reasons","authors":"Å. Arvidsson, Y. Zhang","doi":"10.1145/2465529.2465538","DOIUrl":"https://doi.org/10.1145/2465529.2465538","url":null,"abstract":"Quantifying quality of experience for network applications is challenging as it is a subjective metric with multiple dimensions such as user expectation, satisfaction, and overall experience. Today, despite various techniques to support differentiated Quality of Service (QoS), the operators still lack of automated methods to translate QoS to QoE, especially for general web applications.\u0000 In this work, we take the approach of identifying unsatisfactory performance by searching for user initiated early terminations of web transactions from passive monitoring. However, user early abortions can be caused by other factors such as loss of interests. Therefore, naively using them to represent user dissatisfaction will result in large false positives. In this paper, we propose a systematic method for inferring user dissatisfaction from the set of early abortion behaviors observed from identifying the traffic traces. We conduct a comprehensive analysis on the user acceptance of throughput and response time, and compare them with the traditional MOS metric. Then we present the characteristics of early cancelation from dimensions like the types of URLs and objects. We evaluate our approach on four data sets collected in both wireline network and a wireless cellular network.","PeriodicalId":306456,"journal":{"name":"Measurement and Modeling of Computer Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129203591","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

Efficient crowdsourcing for multi-class labeling 高效众包多类标签

Measurement and Modeling of Computer Systems Pub Date : 2013-06-01 DOI: 10.1145/2465529.2465761

David R Karger, Sewoong Oh, D. Shah

{"title":"Efficient crowdsourcing for multi-class labeling","authors":"David R Karger, Sewoong Oh, D. Shah","doi":"10.1145/2465529.2465761","DOIUrl":"https://doi.org/10.1145/2465529.2465761","url":null,"abstract":"Crowdsourcing systems like Amazon's Mechanical Turk have emerged as an effective large-scale human-powered platform for performing tasks in domains such as image classification, data entry, recommendation, and proofreading. Since workers are low-paid (a few cents per task) and tasks performed are monotonous, the answers obtained are noisy and hence unreliable. To obtain reliable estimates, it is essential to utilize appropriate inference algorithms (e.g. Majority voting) coupled with structured redundancy through task assignment. Our goal is to obtain the best possible trade-off between reliability and redundancy. In this paper, we consider a general probabilistic model for noisy observations for crowd-sourcing systems and pose the problem of minimizing the total price (i.e. redundancy) that must be paid to achieve a target overall reliability. Concretely, we show that it is possible to obtain an answer to each task correctly with probability 1-ε as long as the redundancy per task is O((K/q) log (K/ε)), where each task can have any of the $K$ distinct answers equally likely, q is the crowd-quality parameter that is defined through a probabilistic model. Further, effectively this is the best possible redundancy-accuracy trade-off any system design can achieve. Such a single-parameter crisp characterization of the (order-)optimal trade-off between redundancy and reliability has various useful operational consequences. Further, we analyze the robustness of our approach in the presence of adversarial workers and provide a bound on their influence on the redundancy-accuracy trade-off.\u0000 Unlike recent prior work [GKM11, KOS11, KOS11], our result applies to non-binary (i.e. K>2) tasks. In effect, we utilize algorithms for binary tasks (with inhomogeneous error model unlike that in [GKM11, KOS11, KOS11]) as key subroutine to obtain answers for K-ary tasks. Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.","PeriodicalId":306456,"journal":{"name":"Measurement and Modeling of Computer Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129918768","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}

引用次数: 165