ACM SIGOPS Oper. Syst. Rev.最新文献_第5页

A Roadmap and Plan of Action for Community-Supported Empirical Evaluation in Computer Architecture 计算机体系结构中社区支持的经验评估的路线图和行动计划

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723886

B. Childers, A. Jones, D. Mossé

引用次数: 3

Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems 定位阵列:一种筛选复杂工程系统的新实验设计

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723878

A. Aldaco, C. Colbourn, V. Syrotiuk

{"title":"Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems","authors":"A. Aldaco, C. Colbourn, V. Syrotiuk","doi":"10.1145/2723872.2723878","DOIUrl":"https://doi.org/10.1145/2723872.2723878","url":null,"abstract":"The purpose of a screening experiment is to identify significant factors and interactions on a response for a system. Engineered systems are complex in part due to their size. To apply traditional experimental designs for screening in complex engineered systems requires either restricting the factors considered, which automatically restricts the interactions to those in the set, or restricting interest to main effects, which fails to consider any possible interactions. To address this problem we propose a locating array (LA) as a screening design. Locating arrays exhibit logarithmic growth in the number of factors because their focus is on identification rather than on measurement. This makes practical the consideration of an order of magnitude more factors in experimentation than traditional screening designs. We present preliminary results applying an LA for screening the response of TCP throughput in a simulation model of a mobile wireless network. The full-factorial design for this system is infeasible (over 1043 design points!) yet an LA has only 421 design points. We validate the significance of the identified factors and interactions independently using the statistical software JMP. Screening using locating arrays is viable and yields useful models.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85290653","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}

引用次数: 22

Towards Fast Invariant Preservation in Geo-replicated Systems 地理复制系统的快速不变保存

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723889

Valter Balegas, S. Duarte, Carla Ferreira, R. Rodrigues, Nuno M. Preguiça, Mahsa Najafzadeh, M. Shapiro

{"title":"Towards Fast Invariant Preservation in Geo-replicated Systems","authors":"Valter Balegas, S. Duarte, Carla Ferreira, R. Rodrigues, Nuno M. Preguiça, Mahsa Najafzadeh, M. Shapiro","doi":"10.1145/2723872.2723889","DOIUrl":"https://doi.org/10.1145/2723872.2723889","url":null,"abstract":"Today's global services and applications are expected to be highly available, scale to an unprecedented number of clients, and offer reliable, low-latency operations. This can be achieved through geo-replication, particularly when data consistency is relaxed. There are, however, applications whose data must obey global invariants at all times. Strong consistency protocols easily address this issue, but require global coordination among replicas and inevitably degrade application throughput and latency.\u0000 While coordination is an inherent requirement for maintaining global application invariants, there are instances where coordination on a per operation basis can be avoided. In particular, it has been shown that either moving coordination outside the critical path for executing operations, or having one coordination round for multiple operations, are both effective ways to maintain global invariants and avoid most of the penalties of coordination. However, current georeplication protocols still have not taken advantage of these observations.\u0000 In this paper, we review the design space of current solutions for building geo-replicated applications and present our guiding vision towards a general technique for providing global application invariants under eventual consistency, as a much cheaper alternative to strong consistency.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91112146","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

From Repeatability to Reproducibility and Corroboration 从可重复性到再现性和确证性

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723875

D. Feitelson

引用次数: 75

Automated Assessment of Secure Search Systems 安全搜索系统的自动评估

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723877

Mayank Varia, Benjamin Price, Nicholas Hwang, Ariel Hamlin, Jonathan C. Herzog, Jill Poland, Michael Reschly, Sophia Yakoubov, R. Cunningham

引用次数: 18

Building a Secure and Privacy-Preserving Smart Grid 构建一个安全且保护隐私的智能电网

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723891

K. Birman, Márk Jelasity, Robert D. Kleinberg, E. Tremel

引用次数: 27

Creating Repeatable Computer Science and Networking Experiments on Shared, Public Testbeds 在共享的公共测试平台上创建可重复的计算机科学和网络实验

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723884

Sarah Edwards, Xuan Liu, N. Riga

{"title":"Creating Repeatable Computer Science and Networking Experiments on Shared, Public Testbeds","authors":"Sarah Edwards, Xuan Liu, N. Riga","doi":"10.1145/2723872.2723884","DOIUrl":"https://doi.org/10.1145/2723872.2723884","url":null,"abstract":"There are many compelling reasons to use a shared, public testbed such as GENI, Emulab, or PlanetLab to conduct experiments in computer science and networking. These testbeds support creating experiments with a large and diverse set of resources. Moreover these testbeds are constructed to inherently support the repeatability of experiments as required for scientifically sound research. Finally, the artifacts needed for a researcher to repeat their own experiment can be shared so that others can readily repeat the experiment in the same environment.\u0000 However using a shared, public testbed is different from conducting experiments on resources either owned by the experimenter or someone the experimenter knows. Experiments on shared, public testbeds are more likely to use large topologies, use scarce resources, and need to be tolerant to outages and maintenances in the testbed. In addition, experimenters may not have access to low-level debugging information.\u0000 This paper describes a methodology for new experimenters to write and deploy repeatable and sharable experiments which deal with these challenges by: having a clear plan; automating the execution and analysis of an experiment by following best practices from software engineering and system administration; and building scalable experiments. In addition, the paper describes a case study run on the GENI testbed which illustrates the methodology described.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86832728","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}

引用次数: 18

Supercloud: Opportunities and Challenges 超级云:机遇与挑战

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723892

Qin Jia, Zhiming Shen, Weijia Song, R. V. Renesse, Hakim Weatherspoon

引用次数: 35

Conducting Repeatable Experiments and Fair Comparisons using 802.11n MIMO Networks 使用802.11n MIMO网络进行可重复实验和公平比较

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723879

A. Abedi, Andrew Heard, Tim Brecht

{"title":"Conducting Repeatable Experiments and Fair Comparisons using 802.11n MIMO Networks","authors":"A. Abedi, Andrew Heard, Tim Brecht","doi":"10.1145/2723872.2723879","DOIUrl":"https://doi.org/10.1145/2723872.2723879","url":null,"abstract":"A commonly used technique for evaluating and comparing the performance of systems using 802.11 (WiFi) networks is to conduct experiments. This approach is appealing and important because it inherently captures critical properties of wireless signal transmission that are difficult to analytically model and simulate. Unfortunately, obtaining consistent and statistically meaningful empirical results using 802.11 networks, even in well-controlled environments, can be quite challenging and time consuming because channel conditions can vary over time.\u0000 In this paper, we use 2.4 and 5 GHz 802.11n MIMO networks to study different methodologies that could be used to evaluate and compare the performance of different alternatives used in 802.11 systems (e.g., different systems, configurations or algorithms). We first illustrate that some of the more commonly used methods in existing research are flawed and explain why. We then describe a methodology called multiple interleaved trials that, to our knowledge, has not been used for, or studied on, 802.11 networks. We evaluate this methodology and find that it can be used to repeat experiments and to compare the performance of different alternatives. Finally, we discuss other possible applications of this approach for comparative performance evaluations.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76397746","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}

引用次数: 23

Apt: A Platform for Repeatable Research in Computer Science Apt:计算机科学可重复研究的平台

ACM SIGOPS Oper. Syst. Rev. Pub Date : 2015-01-20 DOI: 10.1145/2723872.2723885

R. Ricci, Gary Wong, L. Stoller, Kirk Webb, Jonathon Duerig, Keith Downie, Mike Hibler

{"title":"Apt: A Platform for Repeatable Research in Computer Science","authors":"R. Ricci, Gary Wong, L. Stoller, Kirk Webb, Jonathon Duerig, Keith Downie, Mike Hibler","doi":"10.1145/2723872.2723885","DOIUrl":"https://doi.org/10.1145/2723872.2723885","url":null,"abstract":"Repeating research in computer science requires more than just code and data: it requires an appropriate environment in which to run experiments. In some cases, this environment appears fairly straightforward: it consists of a particular operating system and set of required libraries. In many cases, however, it is considerably more complex: the execution environment may be an entire network, may involve complex and fragile configuration of the dependencies, or may require large amounts of resources in terms of computation cycles, network bandwidth, or storage. Even the \"straightforward\" case turns out to be surprisingly intricate: there may be explicit or hidden dependencies on compilers, kernel quirks, details of the ISA, etc. The result is that when one tries to repeat published results, creating an environment sufficiently similar to one in which the experiment was originally run can be troublesome; this problem only gets worse as time passes. What the computer science community needs, then, are environments that have the explicit goal of enabling repeatable research. This paper outlines the problem of repeatable research environments, presents a set of requirements for such environments, and describes one facility that attempts to address them.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75331431","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