2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)最新文献

IPCCC 2018 General Chairs ipcc 2018总主席

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/pccc.2018.8711342

引用次数: 0

Availability-Aware Container Scheduler for Application Services in Cloud 云应用服务的可用性感知容器调度器

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8711295

Yanal Alahmad, T. Daradkeh, A. Agarwal

{"title":"Availability-Aware Container Scheduler for Application Services in Cloud","authors":"Yanal Alahmad, T. Daradkeh, A. Agarwal","doi":"10.1109/PCCC.2018.8711295","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711295","url":null,"abstract":"Cloud is a popular paradigm for providing online computing services to the end users. Recently many of the cloud service providers use containers instead of Virtual Machines (VMs) to host the applications. Using containers raises the application service availability concerns. Availability is a non-functional requirement that refers to the percentage of time the service is available for the end user. Scheduling containers (host application) on physical/virtual hosts has direct impact on the availability of the application service that is provided to the end user. According to the best of our knowledge, the existing container scheduling solutions do not directly address the availability of the application service. In this article we propose a new Availability-Aware container scheduling strategy that aims to increase the availability level of the application service in the cloud container-based platform. The strategy selects VMs and hosts that have higher availability values within constraints to schedule the containers in efficient way. We compare the proposed strategy with other container scheduling strategies that are used by Docker container platform. The results shown that the Availability-Aware strategy achieves higher service availability levels, and acceptable physical host CPU utilization.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125560921","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}

引用次数: 9

BFRP: Endpoint Congestion Avoidance Through Bilateral Flow Reservation BFRP:通过双边流量预留避免端点拥塞

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8710804

Tianye Yang, Dezun Dong, Cunlu Li, Liquan Xiao

{"title":"BFRP: Endpoint Congestion Avoidance Through Bilateral Flow Reservation","authors":"Tianye Yang, Dezun Dong, Cunlu Li, Liquan Xiao","doi":"10.1109/PCCC.2018.8710804","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710804","url":null,"abstract":"In HPC, endpoint congestion is a bottleneck in the network and seriously affects the performance of the system. The endpoint congestion can be effectively mitigated by quickly responding to the network and reducing the injection rate of the source. However, most of the prior works do not consider the impact of flow completion time on system performance, but only focus on the packet latency and perform scheduling at packet granularity. For HPC applications, the flow completion time and throughput are the metrics that determines the speed of application execution. Although prior works reduce package latency, they do not fundamentally reduce the flow latency in flow level. In this paper, we propose the bilateral flow-based reservation protocol (BFRP). BFRP quickly responds to network conditions through light-weight bilateral reservation mechanism and can effectively avoid the formation of endpoint congestion. BFRP also schedules packets based on flows, and smallest flow is preferentially sent to decrease the average flow latency. BFRP ensures the source and destination send or receive flows according to the allocated time slices without any conflict at both ends. We evaluate our BFRP protocol against state-of-the-art reservation-based protocol, speculative reservation protocol(SRP), and the simulation results show that the flow latency can be reduced by 27.68% under hotspot traffic with fixed flow size and 24.59% under uniform traffic with fixed flow size.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761725","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

ThinDedup: An I/O Deduplication Scheme that Minimizes Efficiency Loss due to Metadata Writes thinindedup:最大限度降低元数据写效率损失的I/O重复数据删除方案

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8710792

Fan Ni, Xingbo Wu, Weijun Li, Song Jiang

{"title":"ThinDedup: An I/O Deduplication Scheme that Minimizes Efficiency Loss due to Metadata Writes","authors":"Fan Ni, Xingbo Wu, Weijun Li, Song Jiang","doi":"10.1109/PCCC.2018.8710792","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710792","url":null,"abstract":"I/O deduplication is an important technique for saving I/O bandwidth and storage space for storage systems. However, it requires a new level of address mapping, and consequently needs to maintain corresponding metadata. To meet requirements on data persistency and consistency, the metadata writing is likely to make deduplication operations much fatter, in terms of amount of additional writes on the critical I/O path, than one might expect. In this paper we propose to compress the data and insert metadata into data blocks to reduce metadata writes. Assuming that performance-critical data are usually compressible, we can mostly remove separate writes of metadata out of the critical path of servicing users' requests, and make I/O deduplication much thinner. Accordingly we name the scheme ThinDedup. In addition to metadata insertion, ThinDedup also uses persistency of data fingerprints to evade enforcement of write order between data and metadata. We have implemented ThinDedup in the Linux kernel as a device mapper target to provide block-level deduplication. Experimental results show, compared to existing deduplication schemes, ThinDedup achieves (much) higher (up to 3X) I/O throughput and lower latency (reduced by up to 88%) without compromising data persistency.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122089166","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

OC-Cache: An Open-channel SSD Based Cache for Multi-Tenant Systems OC-Cache:用于多租户系统的基于开放通道SSD的缓存

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8711079

Haitao Wang, Zhanhuai Li, Xiao Zhang, Xiaonan Zhao, Xingsheng Zhao, Weijun Li, Song Jiang

{"title":"OC-Cache: An Open-channel SSD Based Cache for Multi-Tenant Systems","authors":"Haitao Wang, Zhanhuai Li, Xiao Zhang, Xiaonan Zhao, Xingsheng Zhao, Weijun Li, Song Jiang","doi":"10.1109/PCCC.2018.8711079","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711079","url":null,"abstract":"In a multi-tenant cloud environment, tenants are usually hosted by virtual machines. Cloud providers deploy multiple virtual machines on a physical server to better utilize physical resources including CPU, memory, and storage devices. SSDs are often used as an I/O cache shared among the tenants for large storage systems using hard disk drives (HDDs) as their main storage devices, which can receive much of SSD's performance benefit and HDD's cost advantage. A key challenge in the use of the shared cache is to ensure strong performance isolation and maintain its high utilization at the same time. However, conventional SSD cache management approaches cannot effectively address this challenge. In this paper, we propose OC-Cache, an open-channel SSD cache framework which utilizes SSD'd internal parallelism to adaptively allocate cache to tenants for both good performance isolation and high SSD utilization. In particular, OC-Cache uses a tenant's miss ratio curve to determine the amount of cache space allocation and where the allocation is (in dedicated or shared SSD channels) and dynamically manages cache space according to the workload characteristics. Experiments show that OC-Cache significantly reduces interference among tenants, and maintains high utilization of the SSD cache.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130621647","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

UAV-enabled Data Gathering in Wireless Sensor Networks 无线传感器网络中支持无人机的数据采集

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8711145

I. Cardei, M. Cardei, Rafael Papa

引用次数: 2

Fully Dynamic Broadcasting under SINR 全动态广播下的SINR

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8710988

Dongxiao Yu, Long Lin, Yong Zhang, Jiguo Yu, Yifei Zou, Qiang-Sheng Hua, Xiuzhen Cheng

{"title":"Fully Dynamic Broadcasting under SINR","authors":"Dongxiao Yu, Long Lin, Yong Zhang, Jiguo Yu, Yifei Zou, Qiang-Sheng Hua, Xiuzhen Cheng","doi":"10.1109/PCCC.2018.8710988","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710988","url":null,"abstract":"Dynamicity is one of the critical characteristics and a major challenge in designing communication protocols in wireless networks. Most of the previous works had focused on the internal node changes (e.g., mobility, arrival, or departure) and not considered the effect of external environmental change. However, the external environmental change, in general, is a more complex phenomenon that can impede nodes from successful communication, implying the protocols of the previous dynamic models do not work well in practice. In this paper, we give an algorithm for distributed broadcasting in a more general model with fully dynamic wireless networks, called FD-Broadcast. Specifically, we present a fully dynamic model which allows node mobility and churns (due to node arrivals/departure) and external environmental change. In contrast to the previous works on dynamic networks, our model defines the full dynamicity in terms of localized topological changes of each node and can tolerate some external environmental change. The external environment changes are captured by the random jamming method. We show that FD-Broadcast can achieve broadcasting in $O(D_{S})$ rounds with a high probability guarantee under the assumption of constant dynamic rate in the SINR model, where $D_{S}$ is the dynamic diameter, a parameter proposed to depict the complexity of dynamic broadcasting. Moreover, the lower bound of dynamic broadcasting is proved to be $Omega(D_{S})$, thus, FD-Broadcast is asymptotically optimal with high probability.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134330416","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

EasyOrchestrator: A NFV-based Network Service Creation Platform for End-users EasyOrchestrator:面向终端用户的基于nfv的网络服务创建平台

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8710935

Yi Yue, B. Cheng

引用次数: 3

How to Set Timeout: Achieving Adaptive Load Balance in Asymmetric Topology Based on Flowlet Switching 如何设置超时:在基于流交换的非对称拓扑中实现自适应负载均衡

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8711042

Zhiqiang Guo, Xiaodong Dong, Sheng Chen, Xiaobo Zhou, Keqiu Li

{"title":"How to Set Timeout: Achieving Adaptive Load Balance in Asymmetric Topology Based on Flowlet Switching","authors":"Zhiqiang Guo, Xiaodong Dong, Sheng Chen, Xiaobo Zhou, Keqiu Li","doi":"10.1109/PCCC.2018.8711042","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711042","url":null,"abstract":"Traditional schemes achieving load balancing in asymmetric topology, which need to maintain global or local congestion information, turn out to be complicated to implement. One recent research has verified that flowlet switching is more simple and efficient to achieve adaptive load balancing in asymmetric topology. Nevertheless, one tricky problem lies in determining the flowlet timeout value, $delta$. Setting it too small would risk reordering issue while setting it too large would reduce flowlet opportunities. In this paper, by formulating the timeout setting problem with a stationary distribution of Markov chain, we give a theoretical reference for setting an appropriate timeout value in flowlet switching based load balancing scheme. Then, we implement a flowlet switching based load balancing scheme, called EasyLB, by extending OpenFlow protocol. Experiment results show that, by setting timeout value following the preceding theoretical reference, EasyLB is adaptive to asymmetric topology and achieves fast convergence of load balancing after link failures.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127051060","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

CoDE: Fast Name Lookup and Update using Conflict-driven Encoding 代码:使用冲突驱动编码的快速名称查找和更新

2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) Pub Date : 2018-11-01 DOI: 10.1109/PCCC.2018.8711226

Tong Shen, Xinyi Zhang, Gaogang Xie, Yuanmei Meng, Dafang Zhang

{"title":"CoDE: Fast Name Lookup and Update using Conflict-driven Encoding","authors":"Tong Shen, Xinyi Zhang, Gaogang Xie, Yuanmei Meng, Dafang Zhang","doi":"10.1109/PCCC.2018.8711226","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711226","url":null,"abstract":"Like IP lookup in the traditional networking, name lookup is a key technology for packet forwarding in the named data networking (NDN). However, unlike fixed-length IP addresses, such hierarchical names are of variable and unlimited length in theory. Both the large-scale name prefix database and high-frequency name update bring unprecedented challenges to the high-performance packet forwarding in the NDN. However, most existing approaches have drawbacks, such as the complex structure, the frequent memory access, and the time-consuming encoding, which make them difficult to meet these requirements. In this paper, we propose CoDE, an effective name lookup approach, to achieve both fast name lookup and update using conflict-driven encoding. CoDE has the following features: 1) The compact and scalable data structure can be stored in the cache; 2) The efficient index can fast locate the possible names and thus significantly speed up the name lookup and prefix update; and 3) The conflict-driven mechanism can greatly reduce the number of name components to be encoded. Experiments using real name prefix databases give an integrated evaluation. Compared with the state-of-the-art algorithms, CoDE achieves a high-performance name lookup which is an order of magnitude faster than the other algorithms on average and performs a fast prefix update which is twenty times that of the other algorithms on average. Moreover, CoDE saves at least half memory footprint of that of the other algorithms.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124401247","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