Proceedings of the 12th ACM International Conference on Computing Frontiers最新文献_第5页

Genesis: a language for generating synthetic training programs for machine learning Genesis:一种为机器学习生成合成训练程序的语言

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742883

A. Chiu, Joseph Garvey, T. Abdelrahman

引用次数: 12

AMTCP: an adaptive multi-path transmission control protocol AMTCP:一种自适应多路径传输控制协议

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742871

Long Li, Nongda Hu, Ke Liu, Binzhang Fu, Mingyu Chen, Lixin Zhang

{"title":"AMTCP: an adaptive multi-path transmission control protocol","authors":"Long Li, Nongda Hu, Ke Liu, Binzhang Fu, Mingyu Chen, Lixin Zhang","doi":"10.1145/2742854.2742871","DOIUrl":"https://doi.org/10.1145/2742854.2742871","url":null,"abstract":"Enabling multiple paths in datacenter networks is a common practice to improve the performance and robustness. Multi-path TCP (MPTCP) explores multiple paths by splitting a single flow into multiple subflows. The number of the subflows in MPTCP is determined before a connection is established, and it usually remains unchanged during the lifetime of that connection. While MPTCP improves both bandwidth efficiency and network reliability, more subflows incur additional overhead, especially for small (so-called mice) subflows. Additionally, it is difficult to choose the appropriate number of the subflows for each TCP connection to achieve good performance without incurring significant overhead. To address this problem, we propose an adaptive multi-path transmission control protocol, namely the AMTCP, which dynamically adjusts the number of the subflows according to application workloads. Specifically, AMTCP divides the time into small intervals and measures the throughput of each subflow over the latest interval, then adjusts the number of the subflows dynamically with the goal of reducing resource and scheduling overheads for mice flows and achieving a higher throughput for elephant flows. Our evaluations show that AMTCP increases the throughput by over 30% compared to conventional TCP. Meanwhile, AMTCP decreases the average number of the subflows by more than 37.5% while achieving a similar throughput compared to MPTCP.","PeriodicalId":417279,"journal":{"name":"Proceedings of the 12th ACM International Conference on Computing Frontiers","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122928581","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

An evaluation and analysis of graph processing frameworks on five key issues 图处理框架在五个关键问题上的评价与分析

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742884

Yun Gao, W. Zhou, Jizhong Han, Dan Meng, Zhang Zhang, Zhiyong Xu

{"title":"An evaluation and analysis of graph processing frameworks on five key issues","authors":"Yun Gao, W. Zhou, Jizhong Han, Dan Meng, Zhang Zhang, Zhiyong Xu","doi":"10.1145/2742854.2742884","DOIUrl":"https://doi.org/10.1145/2742854.2742884","url":null,"abstract":"With the continuously emerging applications in fields like social media analysis, mining massive graphs has drawn increasing attentions from industry and academia. To aid the development of distributed graph algorithms, various programming frameworks have been proposed. To better understand their performance differences under specific scenarios, we analyzed and compared a set of seven representative frameworks under five design aspects, including distribution policy, on-disk data organization, programming model, synchronization policy and message model. Our experiments reveal some interesting phenomena. For example, We observed that the vertex-cut method overweighs the edge-cut method on neighbor-based algorithms while leads to inefficiency for non-neighbor-based algorithms. Furthermore, we observed that using asynchronous update can reduce the total workload by 20% to 30%, but the processing time may still doubled due to fine-grained lock conflicts. Overall, we analyzed the pros and cons of each option for the five key issues. We believe our findings will help end-users choose a suitable framework, and designers improve current ones.","PeriodicalId":417279,"journal":{"name":"Proceedings of the 12th ACM International Conference on Computing Frontiers","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117275214","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

A practical framework for real-time diffusion analysis in social media 社交媒体中实时扩散分析的实用框架

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742899

Miki Enoki, Issei Yoshida, M. Oguchi

引用次数: 1

A significance-driven programming framework for energy-constrained approximate computing 一种能量约束近似计算的意义驱动规划框架

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742857

V. Vassiliadis, Charalampos Chalios, K. Parasyris, C. Antonopoulos, S. Lalis, Nikolaos Bellas, H. Vandierendonck, Dimitrios S. Nikolopoulos

引用次数: 5

Cooperative repair based on tree structure for multiple failures in distributed storage systems with regenerating codes 基于树形结构的代码再生分布式存储系统多故障协同修复

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742869

Xiaoqiang Pei, Yijie Wang, Xingkong Ma, Yongquan Fu, Fangliang Xu

{"title":"Cooperative repair based on tree structure for multiple failures in distributed storage systems with regenerating codes","authors":"Xiaoqiang Pei, Yijie Wang, Xingkong Ma, Yongquan Fu, Fangliang Xu","doi":"10.1145/2742854.2742869","DOIUrl":"https://doi.org/10.1145/2742854.2742869","url":null,"abstract":"Regenerating codes have been proposed to achieve an optimal trade-off curve between the amount of storage space and the network traffic for repair. However, existing repair schemes based on regenerating codes are inadequate to meet the requirements of small network traffic cost and high efficiency when repairing multiple failures. In this paper, we propose a cooperative repair scheme based on tree structure for multiple failures with regenerating codes, called CTREE. For generality, we propose a two-layer repair framework to support both repairs for single and multiple failures. For high repair efficiency, a parallel tree-structured data transmission technique is proposed to organize the data transmissions between the providers and newcomers. For small network network traffic cost, a core-based data exchange technique is proposed to organize the data exchanges between the coordinator and the other newcomers. To evaluate the performance of CTREE, we conduct experiments on both 30 physical and 200 virtual servers. Numerical analysis and extensive experiments confirm that CTREE can support both single and multiple failure repairs, significantly reduces the network traffic cost and improves the repair efficiency compared with the state-of-the-art approaches under various parameter settings.","PeriodicalId":417279,"journal":{"name":"Proceedings of the 12th ACM International Conference on Computing Frontiers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131183291","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

HOSA: hybrid optical switch architecture for data center networks HOSA:用于数据中心网络的混合光交换机架构

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742877

Muhammad Imran, M. Collier, P. Landais, K. Katrinis

{"title":"HOSA: hybrid optical switch architecture for data center networks","authors":"Muhammad Imran, M. Collier, P. Landais, K. Katrinis","doi":"10.1145/2742854.2742877","DOIUrl":"https://doi.org/10.1145/2742854.2742877","url":null,"abstract":"Optical interconnect is a fundamental requisite to realize Internet-scale data centers due to capabilities and benefits of optical devices. Optical interconnects are energy efficient and offer massive bandwidth support. State of the art interconnects can be divided into three types based on the optical technology used: 1) micro-electromechanical system (MEMS) optical cross connects (OXCs), 2) arrayed waveguide grating routers (AWGRs) and 3) semiconductor optical amplifiers (SOAs). MEMS switches are based on mature technology, have low insertion loss and cross-talk, and are data rate independent. They are also the most scalable and the cheapest class of optical switches. However, the reconfiguration time of these switches is in the order of tens of milliseconds. An AWGR switch is a passive device and works in conjunction with tunable wavelength converters (TWCs) or tunable lasers (TLs) while an SOA works as a gate element that manipulates light and also compensates for losses that occur during transmission of optical signals. AWGR and SOA switches have switching time in the range of nanoseconds but they are expensive as compared to MEMS. In this paper, we propose a novel all optical core interconnection scheme that utilizes potentials of both slow and fast optical switches. The core idea is to route traffic through slow or fast optical switch so that minimum end-to-end latency is achieved. Our architecture employs a single stage topology which allows our design to both incrementally scaled up (in capacity) and scaled out (in the number of racks) without requiring major re-cabling and network reconfiguration. We evaluate performance of the system using simulation and investigate a trade-off between cost and power consumption by comparing it with other well known interconnects. Our technique demonstrates a considerable improvement in power consumption and low latency with high throughput is achieved.","PeriodicalId":417279,"journal":{"name":"Proceedings of the 12th ACM International Conference on Computing Frontiers","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126844965","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}

引用次数: 31

Achieving high throughput and low delay in mobile data networks by accurately predicting queue lengths 通过准确预测队列长度，实现移动数据网络的高吞吐量和低延迟

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2742875

Ke Liu, Jack Y. B. Lee

{"title":"Achieving high throughput and low delay in mobile data networks by accurately predicting queue lengths","authors":"Ke Liu, Jack Y. B. Lee","doi":"10.1145/2742854.2742875","DOIUrl":"https://doi.org/10.1145/2742854.2742875","url":null,"abstract":"Knowledge of the queue length for a radio link in a mobile data network has a significant effect on the performance of the communication protocol TCP. If the queue length can be accurately estimated and regulated to a target value, then low end-to-end delay and high bandwidth utilization can be achieved. One method for estimating and regulating the queue length is the queue-length-based congestion control (QCC) algorithm. However, this algorithm estimates the queue length over one RTT interval prior to transmission, and the actual queue length after that time can differ significantly, because the bandwidth can vary substantially between the neighboring propagation delays, which could result in a false positive in the queue length adaption, thereby affecting the QoS performance. To address this problem, we propose PQ-TCP, a method that predicts the queue length directly by predicting the bandwidth variations over the ensuing period of time equal to the propagation delay and using post-bandwidth analysis to minimize the prediction error. Trace-driven simulations are used to show that the QoS performance of PQ-TCP is superior to that of current QCC algorithms. PQ-TCP achieves the lowest RTT while maintaining nearly 90% bandwidth utilization for a small target queue length of 5 packets.","PeriodicalId":417279,"journal":{"name":"Proceedings of the 12th ACM International Conference on Computing Frontiers","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129495958","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

Automated power gating methodology for dataflow-based reconfigurable systems 基于数据流的可重构系统的自动功率门控方法

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2747285

Tiziana Fanni, Carlo Sau, L. Raffo, F. Palumbo

引用次数: 11

SparkBench: a comprehensive benchmarking suite for in memory data analytic platform Spark SparkBench:内存数据分析平台Spark的全面基准测试套件

Proceedings of the 12th ACM International Conference on Computing Frontiers Pub Date : 2015-05-06 DOI: 10.1145/2742854.2747283

Min Li, Jian Tan, Yandong Wang, Li Zhang, V. Salapura

引用次数: 177